%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : LCL075-1 : 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 : 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:36 AM UTC 2026
% Result : Unsatisfiable 118.48s 118.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL075-1 : 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.08/0.35 % Computer : n028.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 4 18:09:28 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.23/0.52 start to proof:theBenchmark
% 118.48/118.53 %-------------------------------------------
% 118.48/118.53 % File :CSE---1.7
% 118.48/118.53 % Problem :theBenchmark
% 118.48/118.53 % Transform :cnf
% 118.48/118.53 % Format :tptp:raw
% 118.48/118.53 % Command :java -jar mcs_scs.jar %d %s
% 118.48/118.53
% 118.48/118.53 % Result :Theorem 118.023010s
% 118.48/118.53 % Output :CNFRefutation 118.023010s
% 118.48/118.53 %-------------------------------------------
% 118.48/118.53 %--------------------------------------------------------------------------
% 118.48/118.53 % File : LCL075-1 : TPTP v9.3.1. Released v1.0.0.
% 118.48/118.53 % Domain : Logic Calculi (Implication/Negation 2 valued sentential)
% 118.48/118.53 % Problem : CN-3 depends on the single Meredith axiom
% 118.48/118.53 % Version : [McC92] axioms.
% 118.48/118.53 % English : Axiomatisations of the Implication/Negation 2 valued
% 118.48/118.53 % sentential calculus are {CN-1,CN-2,CN-3} by Lukasiewicz,
% 118.48/118.53 % {CN-18,CN-21,CN-35,CN-39,CN-39,CN-40,CN-46} by Frege,
% 118.48/118.53 % {CN-3,CN-18,CN-21,CN-22,CN-30,CN-54} by Hilbert, {CN-18,
% 118.48/118.53 % CN-35,CN-49} by Church, {CN-19,CN-37,CN-59} by Lukasiewicz,
% 118.48/118.53 % {CN-19,CN-37,CN-60} by Wos, and the single Meredith axiom.
% 118.48/118.53 % Show that CN-3 depends on the single Meredith axiom.
% 118.48/118.53
% 118.48/118.53 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio
% 118.48/118.53 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 118.48/118.53 % Source : [McC92]
% 118.48/118.53 % Names : CN-36 [MW92]
% 118.48/118.53
% 118.48/118.53 % Status : Unsatisfiable
% 118.48/118.54 % Rating : 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.17 v5.3.0, 0.25 v5.2.0, 0.08 v5.1.0, 0.19 v5.0.0, 0.20 v4.0.1, 0.00 v2.6.0, 0.29 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.14 v2.2.1, 0.33 v2.1.0, 0.38 v2.0.0
% 118.48/118.54 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% 118.48/118.54 % Number of literals : 5 ( 0 equ; 3 neg)
% 118.48/118.54 % Maximal clause size : 3 ( 1 avg)
% 118.48/118.54 % Maximal term depth : 7 ( 2 avg)
% 118.48/118.54 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 118.48/118.54 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 118.48/118.54 % Number of variables : 7 ( 1 sgn)
% 118.48/118.54 % SPC : CNF_UNS_RFO_NEQ_HRN
% 118.48/118.54
% 118.48/118.54 % Comments :
% 118.48/118.54 %--------------------------------------------------------------------------
% 118.48/118.54 cnf(condensed_detachment,axiom,
% 118.48/118.54 ( ~ is_a_theorem(implies(X,Y))
% 118.48/118.54 | ~ is_a_theorem(X)
% 118.48/118.54 | is_a_theorem(Y) ) ).
% 118.48/118.54
% 118.48/118.54 cnf(cn_CAMeredith,axiom,
% 118.48/118.54 is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(not(Z),not(U))),Z),V),implies(implies(V,X),implies(U,X)))) ).
% 118.48/118.54
% 118.48/118.54 cnf(prove_cn_3,negated_conjecture,
% 118.48/118.54 ~ is_a_theorem(implies(a,implies(not(a),b))) ).
% 118.48/118.54
% 118.48/118.54 %--------------------------------------------------------------------------
% 118.48/118.54 %-------------------------------------------
% 118.48/118.54 % Proof found
% 118.48/118.54 % SZS status Theorem for theBenchmark
% 118.48/118.54 % SZS output start Proof
% 118.48/118.54 %ClaNum:3(EqnAxiom:0)
% 118.48/118.54 %VarNum:14(SingletonVarNum:7)
% 118.48/118.54 %MaxLitNum:3
% 118.48/118.54 %MaxfuncDepth:3
% 118.48/118.54 %SharedTerms:6
% 118.48/118.54 %goalClause: 2
% 118.48/118.54 %singleGoalClaCount:1
% 118.48/118.54 [2]~P1(f1(a2,f1(f4(a2),a3)))
% 118.48/118.54 [1]P1(f1(f1(f1(f1(f1(x11,x12),f1(f4(x13),f4(x14))),x13),x15),f1(f1(x15,x11),f1(x14,x11))))
% 118.48/118.54 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31))
% 118.48/118.54 %EqnAxiom
% 118.48/118.54
% 118.48/118.54 %-------------------------------------------
% 118.48/118.54 cnf(4,plain,
% 118.48/118.54 (P1(f1(f1(x41,x42),f1(x43,x42)))+~P1(f1(f1(f1(f1(x42,x44),f1(f4(x45),f4(x43))),x45),x41))),
% 118.48/118.54 inference(scs_inference,[],[1,3])).
% 118.48/118.54 cnf(6,plain,
% 118.48/118.54 (P1(f1(f1(f1(f1(x61,x62),f1(x63,x62)),f1(x62,x64)),f1(x65,f1(x62,x64))))),
% 118.48/118.54 inference(scs_inference,[],[1,4])).
% 118.48/118.54 cnf(11,plain,
% 118.48/118.54 (P1(f1(f1(f1(x111,f1(f4(x112),x113)),x114),f1(x112,x114)))),
% 118.48/118.54 inference(scs_inference,[],[6,4])).
% 118.48/118.54 cnf(14,plain,
% 118.48/118.54 (P1(f1(f1(f1(x141,x141),x142),f1(x143,x142)))),
% 118.48/118.54 inference(scs_inference,[],[11,4])).
% 118.48/118.54 cnf(69,plain,
% 118.48/118.54 (P1(f1(x691,f1(x692,f1(x693,x692))))),
% 118.48/118.54 inference(scs_inference,[],[6,14,3])).
% 118.48/118.54 cnf(78,plain,
% 118.48/118.54 (P1(f1(x781,f1(x782,x781)))),
% 118.48/118.54 inference(scs_inference,[],[6,69,3])).
% 118.48/118.54 cnf(107,plain,
% 118.48/118.54 (P1(f1(x1071,f1(f1(f1(f4(x1071),x1072),x1073),f1(x1074,x1073))))),
% 118.48/118.54 inference(scs_inference,[],[11,1,3])).
% 118.48/118.54 cnf(144,plain,
% 118.48/118.54 (P1(f1(x1441,f1(f1(f1(f4(f1(x1442,x1442)),x1443),x1444),f1(x1445,x1444))))),
% 118.48/118.54 inference(scs_inference,[],[14,107,3])).
% 118.48/118.54 cnf(148,plain,
% 118.48/118.54 (P1(f1(f1(f1(f4(f1(x1481,x1481)),x1482),x1483),f1(x1484,x1483)))),
% 118.48/118.54 inference(scs_inference,[],[14,144,3])).
% 118.48/118.54 cnf(153,plain,
% 118.48/118.54 (P1(f1(x1531,f1(x1532,f1(f4(f1(x1533,x1533)),x1534))))),
% 118.48/118.54 inference(scs_inference,[],[148,78,3])).
% 118.48/118.54 cnf(364,plain,
% 118.48/118.54 (P1(f1(f1(f1(x3641,f1(f4(f1(x3642,x3642)),x3643)),x3644),f1(x3645,x3644)))),
% 118.48/118.54 inference(scs_inference,[],[153,1,3])).
% 118.48/118.54 cnf(373,plain,
% 118.48/118.54 (P1(f1(f1(f1(x3731,f1(x3732,x3732)),x3733),f1(x3734,x3733)))),
% 118.48/118.54 inference(scs_inference,[],[364,1,3])).
% 118.48/118.54 cnf(1270,plain,
% 118.48/118.54 (P1(f1(f1(f1(x12701,x12702),x12703),f1(x12702,x12703)))),
% 118.48/118.54 inference(scs_inference,[],[373,4])).
% 118.48/118.54 cnf(1336,plain,
% 118.48/118.54 (P1(f1(f1(f1(f1(f4(x13361),f4(x13362)),x13361),x13363),f1(x13362,x13363)))),
% 118.48/118.54 inference(scs_inference,[],[1270,4])).
% 118.48/118.54 cnf(1372,plain,
% 118.48/118.54 ($false),
% 118.48/118.54 inference(scs_inference,[],[2,1336,1270,3]),
% 118.48/118.54 ['proof']).
% 118.48/118.54 % SZS output end Proof
% 118.48/118.54 % Total time :118.023010s
%------------------------------------------------------------------------------