%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL010-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 : n001.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 116.39s 116.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL010-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.08/0.36 % Computer : n001.cluster.edu % 0.08/0.36 % Model : x86_64 x86_64 % 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.36 % Memory : 8046.5625MB % 0.08/0.36 % OS : Linux 6.8.0-71-generic % 0.01/0.36 % CPULimit : 300 % 0.01/0.36 % WCLimit : 300 % 0.01/0.36 % DateTime : Sat Sep 5 12:44:46 UTC 2026 % 0.01/0.36 % CPUTime : % 0.23/0.53 start to proof:theBenchmark % 116.39/116.57 %------------------------------------------- % 116.39/116.57 % File :CSE---1.7 % 116.39/116.57 % Problem :theBenchmark % 116.39/116.57 % Transform :cnf % 116.39/116.57 % Format :tptp:raw % 116.39/116.57 % Command :java -jar mcs_scs.jar %d %s % 116.39/116.57 % 116.39/116.57 % Result :Theorem 116.019240s % 116.39/116.57 % Output :CNFRefutation 116.019240s % 116.39/116.57 %------------------------------------------- % 116.39/116.57 %-------------------------------------------------------------------------- % 116.39/116.57 % File : LCL010-1 : TPTP v9.3.1. Released v1.0.0. % 116.39/116.57 % Domain : Logic Calculi (Equivalential) % 116.39/116.57 % Problem : YQL depends on YQF % 116.39/116.57 % Version : [McC92] axioms. % 116.39/116.57 % English : Show that the single Lukasiewicz axiom YQL can be derived % 116.39/116.57 % from the single Lukasiewicz axiom YQF. % 116.39/116.57 % 116.39/116.57 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio % 116.39/116.57 % : [McC92] McCune (1992), Email to G. Sutcliffe % 116.39/116.57 % : [Wos95] Wos (1995), Searching for Circles of Pure Proofs % 116.39/116.57 % Source : [McC92] % 116.39/116.57 % Names : EC-73 [MW92] % 116.39/116.57 % : ec_yq.in [OTTER] % 116.39/116.57 % 116.39/116.57 % Status : Unsatisfiable % 116.39/116.57 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.2.1, 0.11 v2.1.0, 0.13 v2.0.0 % 116.39/116.57 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 116.39/116.57 % Number of literals : 5 ( 0 equ; 3 neg) % 116.39/116.57 % Maximal clause size : 3 ( 1 avg) % 116.39/116.57 % Maximal term depth : 4 ( 2 avg) % 116.39/116.57 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 116.39/116.57 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 116.39/116.57 % Number of variables : 5 ( 0 sgn) % 116.39/116.57 % SPC : CNF_UNS_RFO_NEQ_HRN % 116.39/116.57 % 116.39/116.57 % Comments : % 116.39/116.57 %-------------------------------------------------------------------------- % 116.39/116.57 cnf(condensed_detachment,axiom, % 116.39/116.57 ( ~ is_a_theorem(equivalent(X,Y)) % 116.39/116.57 | ~ is_a_theorem(X) % 116.39/116.57 | is_a_theorem(Y) ) ). % 116.39/116.57 % 116.39/116.57 %----Axiom by Lukasiewicz % 116.39/116.57 cnf(yqf,axiom, % 116.39/116.57 is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Z,Y)))) ). % 116.39/116.57 % 116.39/116.57 %----Axiom by Lukasiewicz % 116.39/116.57 cnf(prove_yql,negated_conjecture, % 116.39/116.57 ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c)))) ). % 116.39/116.57 % 116.39/116.57 %-------------------------------------------------------------------------- % 116.39/116.57 %------------------------------------------- % 116.39/116.57 % Proof found % 116.39/116.57 % SZS status Theorem for theBenchmark % 116.39/116.57 % SZS output start Proof % 116.39/116.57 %ClaNum:3(EqnAxiom:0) % 116.39/116.57 %VarNum:10(SingletonVarNum:5) % 116.39/116.57 %MaxLitNum:3 % 116.39/116.57 %MaxfuncDepth:3 % 116.39/116.57 %SharedTerms:9 % 116.39/116.57 %goalClause: 2 % 116.39/116.57 %singleGoalClaCount:1 % 116.39/116.57 [2]~P1(f1(f1(a2,a3),f1(f1(a4,a3),f1(a2,a4)))) % 116.39/116.57 [1]P1(f1(f1(x11,x12),f1(f1(x11,x13),f1(x13,x12)))) % 116.39/116.57 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31)) % 116.39/116.57 %EqnAxiom % 116.39/116.57 % 116.39/116.57 %------------------------------------------- % 116.39/116.58 cnf(4,plain, % 116.39/116.58 (P1(f1(f1(x41,x42),f1(x42,x43)))+~P1(f1(x41,x43))), % 116.39/116.58 inference(scs_inference,[],[1,3])). % 116.39/116.58 cnf(6,plain, % 116.39/116.58 (P1(f1(f1(f1(x61,x62),x63),f1(x63,f1(f1(x61,x64),f1(x64,x62)))))), % 116.39/116.58 inference(scs_inference,[],[1,4])). % 116.39/116.58 cnf(8,plain, % 116.39/116.58 (P1(f1(f1(f1(x81,x82),f1(x82,x83)),f1(f1(x81,x82),f1(x82,x83))))), % 116.39/116.58 inference(scs_inference,[],[1,4,3])). % 116.39/116.58 cnf(12,plain, % 116.39/116.58 (P1(f1(f1(f1(x121,x122),f1(x122,x123)),f1(f1(x121,x124),f1(x124,x123))))), % 116.39/116.58 inference(scs_inference,[],[1,8,6,4,3])). % 116.39/116.58 cnf(15,plain, % 116.39/116.58 (P1(f1(f1(f1(f1(x151,x152),f1(x152,x153)),x154),f1(x154,f1(f1(x151,x155),f1(x155,x153)))))), % 116.39/116.58 inference(scs_inference,[],[12,4])). % 116.39/116.58 cnf(17,plain, % 116.39/116.58 (P1(f1(f1(x171,x172),f1(x172,f1(x173,f1(x171,x173)))))), % 116.39/116.58 inference(scs_inference,[],[1,12,4,3])). % 116.39/116.58 cnf(23,plain, % 116.39/116.58 (P1(f1(f1(f1(x231,x232),f1(x232,x233)),f1(x234,f1(f1(x231,x233),x234))))), % 116.39/116.58 inference(scs_inference,[],[1,17,4,3])). % 116.39/116.58 cnf(34,plain, % 116.39/116.58 (P1(f1(f1(f1(f1(x341,x342),x343),f1(x343,f1(x342,x344))),f1(f1(x341,x345),f1(x345,x344))))), % 116.39/116.58 inference(scs_inference,[],[1,15,6,4,3])). % 116.39/116.58 cnf(40,plain, % 116.39/116.58 (P1(f1(f1(x401,x402),f1(x402,f1(f1(x401,x403),x403))))), % 116.39/116.58 inference(scs_inference,[],[1,34,4,3])). % 116.39/116.58 cnf(46,plain, % 116.39/116.58 (P1(f1(f1(f1(x461,x462),f1(x462,x463)),f1(f1(f1(x461,x463),x464),x464)))), % 116.39/116.58 inference(scs_inference,[],[1,40,4,3])). % 116.39/116.58 cnf(49,plain, % 116.39/116.58 (P1(f1(f1(f1(f1(x491,x492),f1(x492,x493)),x494),f1(x494,f1(f1(f1(x491,x493),x495),x495))))), % 116.39/116.58 inference(scs_inference,[],[46,4])). % 116.39/116.58 cnf(310,plain, % 116.39/116.58 (P1(f1(f1(x3101,f1(f1(x3102,x3103),x3101)),f1(f1(f1(x3102,x3103),x3104),x3104)))), % 116.39/116.58 inference(scs_inference,[],[23,49,3])). % 116.39/116.58 cnf(317,plain, % 116.39/116.58 (P1(f1(f1(f1(f1(x3171,x3171),x3172),x3173),f1(x3173,x3172)))), % 116.39/116.58 inference(scs_inference,[],[23,310,3,4])). % 116.39/116.58 cnf(368,plain, % 116.39/116.58 (~P1(f1(f1(f1(f1(x3681,x3682),x3683),f1(x3683,f1(f1(x3681,x3684),f1(x3684,x3682)))),f1(f1(a2,a3),f1(f1(a4,a3),f1(a2,a4)))))), % 116.39/116.58 inference(scs_inference,[],[2,6,3])). % 116.39/116.58 cnf(370,plain, % 116.39/116.58 ($false), % 116.39/116.58 inference(scs_inference,[],[6,317,368,3]), % 116.39/116.58 ['proof']). % 116.39/116.58 % SZS output end Proof % 116.39/116.58 % Total time :116.019240s %------------------------------------------------------------------------------