%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n028.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:31 AM UTC 2026 % Result : Unsatisfiable 115.92s 116.11s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.07/0.34 % Computer : n028.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Fri Sep 4 14:02:28 UTC 2026 % 0.07/0.35 % CPUTime : % 0.23/0.50 start to proof:theBenchmark % 115.92/116.11 %------------------------------------------- % 115.92/116.11 % File :CSE---1.7 % 115.92/116.11 % Problem :theBenchmark % 115.92/116.11 % Transform :cnf % 115.92/116.11 % Format :tptp:raw % 115.92/116.11 % Command :java -jar mcs_scs.jar %d %s % 115.92/116.11 % 115.92/116.11 % Result :Theorem 115.599033s % 115.92/116.11 % Output :CNFRefutation 115.599033s % 115.92/116.11 %------------------------------------------- % 115.92/116.11 %-------------------------------------------------------------------------- % 115.92/116.11 % File : LCL013-1 : TPTP v9.3.1. Released v1.0.0. % 115.92/116.11 % Domain : Logic Calculi (Equivalential) % 115.92/116.11 % Problem : UM depends on XGF % 115.92/116.11 % Version : [McC92] axioms. % 115.92/116.11 % English : Show that the single Meredith axiom UM can be derived from % 115.92/116.11 % the single Meredith axiom XGF. % 115.92/116.11 % 115.92/116.11 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio % 115.92/116.11 % : [McC92] McCune (1992), Email to G. Sutcliffe % 115.92/116.11 % : [Wos95] Wos (1995), Searching for Circles of Pure Proofs % 115.92/116.11 % Source : [McC92] % 115.92/116.11 % Names : EC-76 [MW92] % 115.92/116.11 % 115.92/116.11 % Status : Unsatisfiable % 115.92/116.11 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.1.0, 0.00 v2.0.0 % 115.92/116.11 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 115.92/116.11 % Number of literals : 5 ( 0 equ; 3 neg) % 115.92/116.11 % Maximal clause size : 3 ( 1 avg) % 115.92/116.11 % Maximal term depth : 5 ( 2 avg) % 115.92/116.11 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 115.92/116.11 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 115.92/116.11 % Number of variables : 5 ( 0 sgn) % 115.92/116.11 % SPC : CNF_UNS_RFO_NEQ_HRN % 115.92/116.11 % 115.92/116.11 % Comments : % 115.92/116.11 %-------------------------------------------------------------------------- % 115.92/116.11 cnf(condensed_detachment,axiom, % 115.92/116.11 ( ~ is_a_theorem(equivalent(X,Y)) % 115.92/116.11 | ~ is_a_theorem(X) % 115.92/116.11 | is_a_theorem(Y) ) ). % 115.92/116.11 % 115.92/116.11 %----Axiom by Meredith % 115.92/116.11 cnf(xgf,axiom, % 115.92/116.11 is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(X,Z)),equivalent(Z,Y)))) ). % 115.92/116.11 % 115.92/116.11 %----Axiom by Meredith % 115.92/116.11 cnf(prove_um,negated_conjecture, % 115.92/116.11 ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))) ). % 115.92/116.11 % 115.92/116.11 %-------------------------------------------------------------------------- % 115.92/116.11 %------------------------------------------- % 115.92/116.11 % Proof found % 115.92/116.11 % SZS status Theorem for theBenchmark % 115.92/116.11 % SZS output start Proof % 115.92/116.11 %ClaNum:3(EqnAxiom:0) % 115.92/116.11 %VarNum:10(SingletonVarNum:5) % 115.92/116.11 %MaxLitNum:3 % 115.92/116.11 %MaxfuncDepth:3 % 115.92/116.11 %SharedTerms:9 % 115.92/116.11 %goalClause: 2 % 115.92/116.11 %singleGoalClaCount:1 % 115.92/116.11 [2]~P1(f1(f1(f1(a2,a3),a4),f1(a3,f1(a4,a2)))) % 115.92/116.11 [1]P1(f1(x11,f1(f1(x12,f1(x11,x13)),f1(x13,x12)))) % 115.92/116.11 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31)) % 115.92/116.11 %EqnAxiom % 115.92/116.11 % 115.92/116.11 %------------------------------------------- % 115.92/116.12 cnf(4,plain, % 115.92/116.12 (P1(f1(f1(x41,f1(x42,x43)),f1(x43,x41)))+~P1(x42)), % 115.92/116.12 inference(scs_inference,[],[1,3])). % 115.92/116.12 cnf(8,plain, % 115.92/116.12 (~P1(f1(f1(a3,f1(a4,a2)),f1(f1(x81,f1(f1(x82,f1(x81,x83)),f1(x83,x82))),f1(f1(a2,a3),a4))))), % 115.92/116.12 inference(scs_inference,[],[1,2,4,3])). % 115.92/116.12 cnf(10,plain, % 115.92/116.12 ($false), % 115.92/116.12 inference(scs_inference,[],[8,1]), % 115.92/116.12 ['proof']). % 115.92/116.12 % SZS output end Proof % 115.92/116.12 % Total time :115.599033s %------------------------------------------------------------------------------