TSTP Solution File: LCL230+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL230+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 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 : Thu Aug 31 06:48:35 EDT 2023
% Result : Theorem 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL230+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 03:00:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : LCL230+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.63 % Domain : Logic Calculi (Propositional)
% 0.20/0.63 % Problem : Principia Mathematica 2.85
% 0.20/0.63 % Version : Especial.
% 0.20/0.63 % English : Judged by [SRM73] to be the 'hardest' of the
% 0.20/0.63 % first 67 theorems of [WR27].
% 0.20/0.63
% 0.20/0.63 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.20/0.63 % : [SRM73] Siklossy et al. (1973), Breadth First Search: Some Sur
% 0.20/0.63 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.63 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.63 % Source : [Hah94]
% 0.20/0.63 % Names : Pelletier 5 [Pel86]
% 0.20/0.63
% 0.20/0.63 % Status : Theorem
% 0.20/0.63 % Rating : 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.20/0.63 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.20/0.63 % Number of atoms : 7 ( 0 equ)
% 0.20/0.63 % Maximal formula atoms : 7 ( 7 avg)
% 0.20/0.63 % Number of connectives : 6 ( 0 ~; 3 |; 0 &)
% 0.20/0.63 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.63 % Maximal formula depth : 4 ( 4 avg)
% 0.20/0.63 % Maximal term depth : 0 ( 0 avg)
% 0.20/0.63 % Number of predicates : 3 ( 3 usr; 3 prp; 0-0 aty)
% 0.20/0.63 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.63 % Number of variables : 0 ( 0 !; 0 ?)
% 0.20/0.63 % SPC : FOF_THM_PRP
% 0.20/0.63
% 0.20/0.63 % Comments :
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 fof(pel5,conjecture,
% 0.20/0.63 ( ( ( p
% 0.20/0.63 | q )
% 0.20/0.63 => ( p
% 0.20/0.63 | r ) )
% 0.20/0.63 => ( p
% 0.20/0.63 | ( q
% 0.20/0.63 => r ) ) ) ).
% 0.20/0.63
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.64 %ClaNum:4(EqnAxiom:0)
% 0.20/0.64 %VarNum:0(SingletonVarNum:0)
% 0.20/0.64 %MaxLitNum:3
% 0.20/0.64 %MaxfuncDepth:0
% 0.20/0.64 %SharedTerms:7
% 0.20/0.64 %goalClause: 1 2 3 4
% 0.20/0.64 %singleGoalClaCount:3
% 0.20/0.64 [1]P1(a500)
% 0.20/0.64 [2]~P2(a500)
% 0.20/0.64 [3]~P3(a500)
% 0.20/0.64 [4]P2(a500)+P3(a500)+~P1(a500)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(5,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[2,3,1,4]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------