%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL230-2 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n008.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:18:51 AM UTC 2026 % Result : Unsatisfiable 0.24s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL230-2 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.35 % Computer : n008.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sat Sep 5 04:31:38 UTC 2026 % 0.09/0.35 % CPUTime : % 0.24/0.52 start to proof:theBenchmark % 0.24/0.52 %------------------------------------------- % 0.24/0.52 % File :CSE---1.7 % 0.24/0.52 % Problem :theBenchmark % 0.24/0.52 % Transform :cnf % 0.24/0.52 % Format :tptp:raw % 0.24/0.52 % Command :java -jar mcs_scs.jar %d %s % 0.24/0.52 % 0.24/0.52 % Result :Theorem 0.003261s % 0.24/0.52 % Output :CNFRefutation 0.003261s % 0.24/0.52 %------------------------------------------- % 0.24/0.52 %-------------------------------------------------------------------------- % 0.24/0.52 % File : LCL230-2 : TPTP v9.3.1. Released v1.0.0. % 0.24/0.52 % Domain : Logic Calculi (Propositional) % 0.24/0.52 % Problem : Principia Mathematica 2.85 % 0.24/0.52 % Version : [Pel86] axioms. % 0.24/0.52 % English : Judged by [SRM73] to be the 'hardest' of the first 67 theorems % 0.24/0.52 % of [WR27]. % 0.24/0.52 % 0.24/0.52 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica % 0.24/0.52 % : [SRM73] Siklossy et al. (1973), Breadth First Search: Some Sur % 0.24/0.52 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.24/0.52 % Source : [Pel86] % 0.24/0.52 % Names : Pelletier 5 [Pel86] % 0.24/0.52 % 0.24/0.52 % Status : Unsatisfiable % 0.24/0.52 % Rating : 0.00 v4.1.0, 0.20 v3.7.0, 0.25 v3.5.0, 0.00 v3.3.0, 0.33 v3.2.0, 0.00 v2.0.0 % 0.24/0.52 % Syntax : Number of clauses : 4 ( 3 unt; 1 nHn; 4 RR) % 0.24/0.52 % Number of literals : 6 ( 0 equ; 3 neg) % 0.24/0.52 % Maximal clause size : 3 ( 1 avg) % 0.24/0.52 % Maximal term depth : 0 ( 0 avg) % 0.24/0.52 % Number of predicates : 3 ( 3 usr; 3 prp; 0-0 aty) % 0.24/0.52 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.24/0.52 % Number of variables : 0 ( 0 sgn) % 0.24/0.52 % SPC : CNF_UNS_PRP % 0.24/0.52 % 0.24/0.52 % Comments : % 0.24/0.52 % Bugfixes : v1.1.1 - Renamed from SYN043-1. % 0.24/0.52 %-------------------------------------------------------------------------- % 0.24/0.52 cnf(clause_1,negated_conjecture, % 0.24/0.52 ( ~ q % 0.24/0.52 | p % 0.24/0.52 | r ) ). % 0.24/0.52 % 0.24/0.52 cnf(clause_2,negated_conjecture, % 0.24/0.52 ~ p ). % 0.24/0.52 % 0.24/0.52 cnf(clause_3,negated_conjecture, % 0.24/0.52 q ). % 0.24/0.52 % 0.24/0.52 cnf(clause_4,negated_conjecture, % 0.24/0.52 ~ r ). % 0.24/0.52 % 0.24/0.52 %-------------------------------------------------------------------------- % 0.24/0.52 %------------------------------------------- % 0.24/0.52 % Proof found % 0.24/0.52 % SZS status Theorem for theBenchmark % 0.24/0.52 % SZS output start Proof % 0.24/0.52 %ClaNum:4(EqnAxiom:0) % 0.24/0.52 %VarNum:0(SingletonVarNum:0) % 0.24/0.52 %MaxLitNum:3 % 0.24/0.52 %MaxfuncDepth:0 % 0.24/0.52 %SharedTerms:7 % 0.24/0.52 %goalClause: 1 2 3 4 % 0.24/0.52 %singleGoalClaCount:3 % 0.24/0.52 [1]P1(a5000) % 0.24/0.52 [2]~P2(a5000) % 0.24/0.52 [3]~P3(a5000) % 0.24/0.52 [4]P2(a5000)+P3(a5000)+~P1(a5000) % 0.24/0.52 %EqnAxiom % 0.24/0.52 % 0.24/0.52 %------------------------------------------- % 0.24/0.52 cnf(5,plain, % 0.24/0.52 ($false), % 0.24/0.52 inference(scs_inference,[],[2,3,1,4]), % 0.24/0.52 ['proof']). % 0.24/0.52 % SZS output end Proof % 0.24/0.52 % Total time :0.003261s %------------------------------------------------------------------------------