%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL117-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 : n016.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:40 AM UTC 2026 % Result : Unsatisfiable 116.00s 116.13s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL117-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.12/0.36 % Computer : n016.cluster.edu % 0.12/0.36 % Model : x86_64 x86_64 % 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.36 % Memory : 8046.5625MB % 0.12/0.36 % OS : Linux 6.8.0-71-generic % 0.12/0.36 % CPULimit : 300 % 0.12/0.36 % WCLimit : 300 % 0.12/0.36 % DateTime : Fri Sep 4 21:15:43 UTC 2026 % 0.12/0.36 % CPUTime : % 0.23/0.53 start to proof:theBenchmark % 116.00/116.12 %------------------------------------------- % 116.00/116.12 % File :CSE---1.7 % 116.00/116.12 % Problem :theBenchmark % 116.00/116.12 % Transform :cnf % 116.00/116.12 % Format :tptp:raw % 116.00/116.12 % Command :java -jar mcs_scs.jar %d %s % 116.00/116.12 % 116.00/116.12 % Result :Theorem 115.606237s % 116.00/116.12 % Output :CNFRefutation 115.606237s % 116.00/116.12 %------------------------------------------- % 116.00/116.13 %-------------------------------------------------------------------------- % 116.00/116.13 % File : LCL117-1 : TPTP v9.3.1. Released v1.0.0. % 116.00/116.13 % Domain : Logic Calculi (R) % 116.00/116.13 % Problem : QYF depends on YQM % 116.00/116.13 % Version : [McC92] axioms. % 116.00/116.13 % English : Single axioms for the R calculus are QYF, YQM, WO, all % 116.00/116.13 % by Meredith and XGJ by Winker. Show that QYF depends on YQM. % 116.00/116.13 % 116.00/116.13 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio % 116.00/116.13 % : [McC92] McCune (1992), Email to G. Sutcliffe % 116.00/116.13 % Source : [McC92] % 116.00/116.13 % Names : R-85 [MW92] % 116.00/116.13 % 116.00/116.13 % Status : Unsatisfiable % 116.00/116.13 % 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 % 116.00/116.13 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 116.00/116.13 % Number of literals : 5 ( 0 equ; 3 neg) % 116.00/116.13 % Maximal clause size : 3 ( 1 avg) % 116.00/116.13 % Maximal term depth : 4 ( 2 avg) % 116.00/116.13 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 116.00/116.13 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 116.00/116.13 % Number of variables : 5 ( 0 sgn) % 116.00/116.13 % SPC : CNF_UNS_RFO_NEQ_HRN % 116.00/116.13 % 116.00/116.13 % Comments : % 116.00/116.13 %-------------------------------------------------------------------------- % 116.00/116.13 cnf(condensed_detachment,axiom, % 116.00/116.13 ( ~ is_a_theorem(equivalent(X,Y)) % 116.00/116.13 | ~ is_a_theorem(X) % 116.00/116.13 | is_a_theorem(Y) ) ). % 116.00/116.13 % 116.00/116.13 %----Axiom from Meredith % 116.00/116.13 cnf(yqm,axiom, % 116.00/116.13 is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))) ). % 116.00/116.13 % 116.00/116.13 %----Axiom from Meredith % 116.00/116.13 cnf(prove_qyf,negated_conjecture, % 116.00/116.13 ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))) ). % 116.00/116.13 % 116.00/116.13 %-------------------------------------------------------------------------- % 116.00/116.13 %------------------------------------------- % 116.00/116.13 % Proof found % 116.00/116.13 % SZS status Theorem for theBenchmark % 116.00/116.13 % SZS output start Proof % 116.00/116.13 %ClaNum:3(EqnAxiom:0) % 116.00/116.13 %VarNum:10(SingletonVarNum:5) % 116.00/116.13 %MaxLitNum:3 % 116.00/116.13 %MaxfuncDepth:3 % 116.00/116.13 %SharedTerms:9 % 116.00/116.13 %goalClause: 2 % 116.00/116.13 %singleGoalClaCount:1 % 116.00/116.13 [2]~P1(f1(f1(f1(a2,a3),f1(a2,a4)),f1(a4,a3))) % 116.00/116.13 [1]P1(f1(f1(x11,x12),f1(f1(x13,x12),f1(x13,x11)))) % 116.00/116.13 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31)) % 116.00/116.13 %EqnAxiom % 116.00/116.13 % 116.00/116.13 %------------------------------------------- % 116.00/116.13 cnf(4,plain, % 116.00/116.13 (P1(f1(f1(x41,x42),f1(x41,x43)))+~P1(f1(x43,x42))), % 116.00/116.13 inference(scs_inference,[],[1,3])). % 116.00/116.13 cnf(6,plain, % 116.00/116.13 (P1(f1(f1(x61,f1(f1(x62,x63),f1(x62,x64))),f1(x61,f1(x64,x63))))), % 116.00/116.13 inference(scs_inference,[],[1,4])). % 116.00/116.13 cnf(8,plain, % 116.00/116.13 (~P1(f1(f1(f1(a2,a3),f1(a2,a4)),f1(f1(x81,a3),f1(x81,a4))))), % 116.00/116.13 inference(scs_inference,[],[1,2,4,3])). % 116.00/116.13 cnf(10,plain, % 116.00/116.13 (P1(f1(f1(x101,f1(x102,f1(x103,x104))),f1(x101,f1(x102,f1(f1(x105,x104),f1(x105,x103))))))), % 116.00/116.13 inference(scs_inference,[],[6,4])). % 116.00/116.13 cnf(19,plain, % 116.00/116.13 (P1(f1(f1(x191,x192),f1(f1(x193,x192),f1(f1(x194,x191),f1(x194,x193)))))), % 116.00/116.13 inference(scs_inference,[],[1,10,3])). % 116.00/116.13 cnf(24,plain, % 116.00/116.13 (P1(f1(f1(x241,f1(f1(x242,x243),f1(x242,x244))),f1(f1(x245,f1(x244,x243)),f1(x245,x241))))), % 116.00/116.13 inference(scs_inference,[],[1,19,3])). % 116.00/116.13 cnf(27,plain, % 116.00/116.13 ($false), % 116.00/116.13 inference(scs_inference,[],[1,24,8,3]), % 116.00/116.13 ['proof']). % 116.00/116.13 % SZS output end Proof % 116.00/116.13 % Total time :115.606237s %------------------------------------------------------------------------------