%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : LCL077-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 : 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:36 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL077-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.08/0.34 % Computer : n016.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 5 05:47:29 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.24/0.50 start to proof:theBenchmark
% 0.24/0.53 %-------------------------------------------
% 0.24/0.53 % File :CSE---1.7
% 0.24/0.53 % Problem :theBenchmark
% 0.24/0.53 % Transform :cnf
% 0.24/0.53 % Format :tptp:raw
% 0.24/0.53 % Command :java -jar mcs_scs.jar %d %s
% 0.24/0.53
% 0.24/0.53 % Result :Theorem 0.051580s
% 0.24/0.53 % Output :CNFRefutation 0.051580s
% 0.24/0.53 %-------------------------------------------
% 0.24/0.54 %--------------------------------------------------------------------------
% 0.24/0.54 % File : LCL077-2 : TPTP v9.3.1. Released v1.0.0.
% 0.24/0.54 % Domain : Logic Calculi (Implication/Negation 2 valued sentential)
% 0.24/0.54 % Problem : CN-39 depends on the Church system
% 0.24/0.54 % Version : [ANL] axioms : Augmented.
% 0.24/0.54 % English : Axiomatisations of the Implication/Negation 2 valued
% 0.24/0.54 % sentential calculus are {CN-1,CN-2,CN-3} by Lukasiewicz,
% 0.24/0.54 % {CN-18,CN-21,CN-35,CN-39,CN-39,CN-40,CN-46} by Frege,
% 0.24/0.54 % {CN-3,CN-18,CN-21,CN-22,CN-30,CN-54} by Hilbert, {CN-18,
% 0.24/0.54 % CN-35,CN-49} by Church, {CN-19,CN-37,CN-59} by Lukasiewicz,
% 0.24/0.54 % {CN-19,CN-37,CN-60} by Wos, and the single Meredith axiom.
% 0.24/0.54 % Show that CN-39 depends on the Church system.
% 0.24/0.54
% 0.24/0.54 % Refs : [Mor84] Morgan (1984), Logic Problems
% 0.24/0.54 % Source : [ANL]
% 0.24/0.54 % Names : morgan.two.ver1.in [ANL]
% 0.24/0.54
% 0.24/0.54 % Status : Unsatisfiable
% 0.24/0.54 % 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.00 v2.1.0, 0.00 v2.0.0
% 0.24/0.54 % Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 3 RR)
% 0.24/0.54 % Number of literals : 10 ( 0 equ; 5 neg)
% 0.24/0.54 % Maximal clause size : 3 ( 1 avg)
% 0.24/0.54 % Maximal term depth : 4 ( 2 avg)
% 0.24/0.54 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 0.24/0.54 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% 0.24/0.54 % Number of variables : 12 ( 1 sgn)
% 0.24/0.54 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.24/0.54
% 0.24/0.54 % Comments : Transitivity of implies is supplied as an axiom
% 0.24/0.54 %--------------------------------------------------------------------------
% 0.24/0.54 cnf(condensed_detachment,axiom,
% 0.24/0.54 ( ~ is_a_theorem(implies(X,Y))
% 0.24/0.54 | ~ is_a_theorem(X)
% 0.24/0.54 | is_a_theorem(Y) ) ).
% 0.24/0.54
% 0.24/0.54 cnf(cn_18,axiom,
% 0.24/0.54 is_a_theorem(implies(X,implies(Y,X))) ).
% 0.24/0.54
% 0.24/0.54 cnf(cn_35,axiom,
% 0.24/0.54 is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ).
% 0.24/0.54
% 0.24/0.54 cnf(cn_49,axiom,
% 0.24/0.54 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 0.24/0.54
% 0.24/0.54 cnf(transitivity,axiom,
% 0.24/0.54 ( ~ is_a_theorem(implies(X1,X2))
% 0.24/0.54 | ~ is_a_theorem(implies(X2,X3))
% 0.24/0.54 | is_a_theorem(implies(X1,X3)) ) ).
% 0.24/0.54
% 0.24/0.54 cnf(prove_cn_39,negated_conjecture,
% 0.24/0.54 ~ is_a_theorem(implies(not(not(a)),a)) ).
% 0.24/0.54
% 0.24/0.54 %--------------------------------------------------------------------------
% 0.24/0.54 %-------------------------------------------
% 0.24/0.54 % Proof found
% 0.24/0.54 % SZS status Theorem for theBenchmark
% 0.24/0.54 % SZS output start Proof
% 0.24/0.54 %ClaNum:6(EqnAxiom:0)
% 0.24/0.54 %VarNum:24(SingletonVarNum:12)
% 0.24/0.54 %MaxLitNum:3
% 0.24/0.54 %MaxfuncDepth:3
% 0.24/0.54 %SharedTerms:5
% 0.24/0.54 %goalClause: 4
% 0.24/0.54 %singleGoalClaCount:1
% 0.24/0.54 [4]~P1(f1(f3(f3(a2)),a2))
% 0.24/0.54 [1]P1(f1(x11,f1(x12,x11)))
% 0.24/0.54 [2]P1(f1(f1(f3(x21),f3(x22)),f1(x22,x21)))
% 0.24/0.54 [3]P1(f1(f1(x31,f1(x32,x33)),f1(f1(x31,x32),f1(x31,x33))))
% 0.24/0.54 [5]P1(x51)+~P1(x52)+~P1(f1(x52,x51))
% 0.24/0.54 [6]~P1(f1(x61,x63))+P1(f1(x61,x62))+~P1(f1(x63,x62))
% 0.24/0.54 %EqnAxiom
% 0.24/0.54
% 0.24/0.54 %-------------------------------------------
% 0.24/0.54 cnf(8,plain,
% 0.24/0.54 (P1(f1(x81,f1(x82,x81)))),
% 0.24/0.54 inference(rename_variables,[],[1])).
% 0.24/0.54 cnf(10,plain,
% 0.24/0.54 (P1(f1(f3(x101),f1(x101,x102)))),
% 0.24/0.54 inference(scs_inference,[],[4,2,1,8,5,6])).
% 0.24/0.54 cnf(14,plain,
% 0.24/0.54 (P1(f1(f3(x141),f1(x141,x142)))),
% 0.24/0.54 inference(rename_variables,[],[10])).
% 0.24/0.54 cnf(16,plain,
% 0.24/0.54 (P1(f1(f3(x161),f1(f1(x161,x162),f1(x161,x163))))),
% 0.24/0.54 inference(scs_inference,[],[4,10,14,3,5,6])).
% 0.24/0.54 cnf(23,plain,
% 0.24/0.54 (P1(f1(f3(f3(x231)),f1(x232,x231)))),
% 0.24/0.54 inference(scs_inference,[],[16,10,2,3,5,6])).
% 0.24/0.54 cnf(43,plain,
% 0.24/0.54 (P1(f1(f1(x431,x432),f1(x431,x431)))),
% 0.24/0.54 inference(scs_inference,[],[1,3,5])).
% 0.24/0.54 cnf(44,plain,
% 0.24/0.54 (P1(f1(f1(x441,f1(x442,x443)),f1(f1(x441,x442),f1(x441,x443))))),
% 0.24/0.54 inference(rename_variables,[],[3])).
% 0.24/0.54 cnf(46,plain,
% 0.24/0.54 (P1(f1(f1(x461,x462),f1(f1(x463,x461),f1(x463,x462))))),
% 0.24/0.54 inference(scs_inference,[],[1,3,44,5,6])).
% 0.24/0.54 cnf(51,plain,
% 0.24/0.54 (P1(f1(x511,x511))),
% 0.24/0.54 inference(scs_inference,[],[1,43,5])).
% 0.24/0.54 cnf(57,plain,
% 0.24/0.54 (P1(f1(f1(x571,x572),f1(x571,f1(x573,x572))))),
% 0.24/0.54 inference(scs_inference,[],[1,46,5])).
% 0.24/0.54 cnf(67,plain,
% 0.24/0.54 (P1(f1(f1(f3(x671),f3(x672)),f1(x673,f1(x672,x671))))),
% 0.24/0.54 inference(scs_inference,[],[2,57,5])).
% 0.24/0.54 cnf(74,plain,
% 0.24/0.54 (P1(f1(x741,f1(x742,x742)))),
% 0.24/0.54 inference(scs_inference,[],[67,51,5])).
% 0.24/0.54 cnf(85,plain,
% 0.24/0.54 (P1(f1(f1(f1(x851,x852),x851),f1(f1(x851,x852),x852)))),
% 0.24/0.54 inference(scs_inference,[],[2,51,3,6,5])).
% 0.24/0.54 cnf(88,plain,
% 0.24/0.54 (P1(f1(f1(f1(x881,x881),x882),x882))),
% 0.24/0.54 inference(scs_inference,[],[74,85,5])).
% 0.24/0.54 cnf(108,plain,
% 0.24/0.54 ($false),
% 0.24/0.54 inference(scs_inference,[],[3,88,4,23,6,5]),
% 0.24/0.54 ['proof']).
% 0.24/0.54 % SZS output end Proof
% 0.24/0.54 % Total time :0.051580s
%------------------------------------------------------------------------------