TSTP Solution File: LCL666+1.001 by CSE---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.5
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Sep 17 18:38:27 EDT 2022

% Result   : Theorem 0.57s 0.64s
% Output   : CNFRefutation 0.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Sep  1 23:52:07 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.53/0.59  start to proof:theBenchmark
% 0.57/0.64  %-------------------------------------------
% 0.57/0.64  % File        :CSE---1.5
% 0.57/0.64  % Problem     :theBenchmark
% 0.57/0.64  % Transform   :cnf
% 0.57/0.64  % Format      :tptp:raw
% 0.57/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.57/0.64  
% 0.57/0.64  % Result      :Theorem 0.000000s
% 0.57/0.64  % Output      :CNFRefutation 0.000000s
% 0.57/0.64  %-------------------------------------------
% 0.57/0.64  %------------------------------------------------------------------------------
% 0.57/0.64  % File     : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.57/0.64  % Domain   : Logic Calculi (Modal Logic)
% 0.57/0.64  % Problem  : In KT, pigeonhole formulae, size 1
% 0.57/0.64  % Version  : Especial.
% 0.57/0.64  % English  :
% 0.57/0.64  
% 0.57/0.64  % Refs     : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.57/0.64  %          : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.57/0.64  % Source   : [Kam08]
% 0.57/0.64  % Names    : kt_ph_p [BHS00]
% 0.57/0.64  
% 0.57/0.64  % Status   : Theorem
% 0.57/0.64  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v4.0.0
% 0.57/0.64  % Syntax   : Number of formulae    :    2 (   1 unt;   0 def)
% 0.57/0.64  %            Number of atoms       :    6 (   0 equ)
% 0.57/0.64  %            Maximal formula atoms :    5 (   3 avg)
% 0.57/0.64  %            Number of connectives :   10 (   6   ~;   2   |;   2   &)
% 0.57/0.64  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.57/0.64  %            Maximal formula depth :   10 (   6 avg)
% 0.57/0.64  %            Maximal term depth    :    1 (   1 avg)
% 0.57/0.64  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-2 aty)
% 0.57/0.64  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.57/0.64  %            Number of variables   :    3 (   2   !;   1   ?)
% 0.57/0.64  % SPC      : FOF_THM_EPR_NEQ
% 0.57/0.64  
% 0.57/0.64  % Comments : A naive relational encoding of the modal logic problem into
% 0.57/0.64  %            first-order logic.
% 0.57/0.64  %------------------------------------------------------------------------------
% 0.57/0.64  fof(reflexivity,axiom,
% 0.57/0.64      ! [X] : r1(X,X) ).
% 0.57/0.64  
% 0.57/0.64  fof(main,conjecture,
% 0.57/0.64      ~ ? [X] :
% 0.57/0.64          ~ ( ~ ! [Y] :
% 0.57/0.64                  ( ~ r1(X,Y)
% 0.57/0.64                  | ~ ( p201(Y)
% 0.57/0.64                      & p101(Y) ) )
% 0.57/0.64            | ~ ( p201(X)
% 0.57/0.64                & p101(X) ) ) ).
% 0.57/0.64  
% 0.57/0.64  %------------------------------------------------------------------------------
% 0.57/0.64  %-------------------------------------------
% 0.57/0.64  % Proof found
% 0.57/0.64  % SZS status Theorem for theBenchmark
% 0.57/0.64  % SZS output start Proof
% 0.57/0.65  %ClaNum:4(EqnAxiom:0)
% 0.57/0.65  %VarNum:5(SingletonVarNum:2)
% 0.57/0.65  %MaxLitNum:3
% 0.57/0.65  %MaxfuncDepth:0
% 0.57/0.65  %SharedTerms:3
% 0.57/0.65  %goalClause: 1 2 4
% 0.57/0.65  %singleGoalClaCount:2
% 0.57/0.65  [1]P1(a1)
% 0.57/0.65  [2]P2(a1)
% 0.57/0.65  [3]P3(x31,x31)
% 0.57/0.65  [4]~P2(x41)+~P1(x41)+~P3(a1,x41)
% 0.57/0.65  %EqnAxiom
% 0.57/0.65  
% 0.57/0.65  %-------------------------------------------
% 0.58/0.65  cnf(5,plain,
% 0.58/0.65     ($false),
% 0.58/0.65     inference(scs_inference,[],[2,1,3,4]),
% 0.58/0.65     ['proof']).
% 0.58/0.65  % SZS output end Proof
% 0.58/0.65  % Total time :0.000000s
%------------------------------------------------------------------------------