%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : LCL398-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:19:06 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.47s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL398-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.35 % Computer : n010.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 17:53:23 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.14/0.47 start to proof:theBenchmark
% 0.14/0.47 %-------------------------------------------
% 0.14/0.47 % File :CSE---1.7
% 0.14/0.47 % Problem :theBenchmark
% 0.14/0.47 % Transform :cnf
% 0.14/0.47 % Format :tptp:raw
% 0.14/0.47 % Command :java -jar mcs_scs.jar %d %s
% 0.14/0.47
% 0.14/0.47 % Result :Theorem 0.004590s
% 0.14/0.47 % Output :CNFRefutation 0.004590s
% 0.14/0.47 %-------------------------------------------
% 0.14/0.47 %--------------------------------------------------------------------------
% 0.14/0.47 % File : LCL398-1 : TPTP v9.3.1. Released v2.3.0.
% 0.14/0.47 % Domain : Logic Calculi (Implication/Negation 2 valued sentential)
% 0.14/0.47 % Problem : CN-64 depends on the Lukasiewicz system
% 0.14/0.47 % Version : [McC92] axioms.
% 0.14/0.47 % English : An axiomatisation of the Implication/Negation 2 valued
% 0.14/0.47 % sentential calculus is {CN-1,CN-2,CN-3} by Lukasiewicz.
% 0.14/0.47 % Show that CN-64 depends on the Lukasiewicz system.
% 0.14/0.47
% 0.14/0.47 % Refs : [Wos96] Wos (1996), Combining Resonance with Heat
% 0.14/0.47 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 0.14/0.47 % Source : [Wos96]
% 0.14/0.47 % Names : thesis_64 [Wos96]
% 0.14/0.47
% 0.14/0.47 % Status : Unsatisfiable
% 0.14/0.47 % Rating : 0.00 v5.5.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.3.0
% 0.14/0.47 % Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 2 RR)
% 0.14/0.47 % Number of literals : 7 ( 0 equ; 3 neg)
% 0.14/0.47 % Maximal clause size : 3 ( 1 avg)
% 0.14/0.47 % Maximal term depth : 4 ( 2 avg)
% 0.14/0.47 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 0.14/0.47 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 0.14/0.47 % Number of variables : 8 ( 1 sgn)
% 0.14/0.47 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.14/0.47
% 0.14/0.47 % Comments :
% 0.14/0.47 %--------------------------------------------------------------------------
% 0.14/0.47 cnf(condensed_detachment,axiom,
% 0.14/0.47 ( ~ is_a_theorem(implies(X,Y))
% 0.14/0.47 | ~ is_a_theorem(X)
% 0.14/0.47 | is_a_theorem(Y) ) ).
% 0.14/0.47
% 0.14/0.47 cnf(cn_1,axiom,
% 0.14/0.47 is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ).
% 0.14/0.47
% 0.14/0.47 cnf(cn_2,axiom,
% 0.14/0.47 is_a_theorem(implies(implies(not(X),X),X)) ).
% 0.14/0.47
% 0.14/0.47 cnf(cn_3,axiom,
% 0.14/0.47 is_a_theorem(implies(X,implies(not(X),Y))) ).
% 0.14/0.47
% 0.14/0.47 cnf(prove_cn_64,negated_conjecture,
% 0.14/0.47 ~ is_a_theorem(implies(not(implies(x,x)),y)) ).
% 0.14/0.47
% 0.14/0.47 %--------------------------------------------------------------------------
% 0.14/0.47 %-------------------------------------------
% 0.14/0.47 % Proof found
% 0.14/0.47 % SZS status Theorem for theBenchmark
% 0.14/0.47 % SZS output start Proof
% 0.14/0.47 %ClaNum:5(EqnAxiom:0)
% 0.14/0.47 %VarNum:16(SingletonVarNum:8)
% 0.14/0.47 %MaxLitNum:3
% 0.14/0.47 %MaxfuncDepth:3
% 0.14/0.47 %SharedTerms:6
% 0.14/0.47 %goalClause: 4
% 0.14/0.48 %singleGoalClaCount:1
% 0.14/0.48 [4]~P1(f2(f1(f2(a3,a3)),a4))
% 0.14/0.48 [2]P1(f2(f2(f1(x21),x21),x21))
% 0.14/0.48 [1]P1(f2(x11,f2(f1(x11),x12)))
% 0.14/0.48 [3]P1(f2(f2(x31,x32),f2(f2(x32,x33),f2(x31,x33))))
% 0.14/0.48 [5]P1(x51)+~P1(x52)+~P1(f2(x52,x51))
% 0.14/0.48 %EqnAxiom
% 0.14/0.48
% 0.14/0.48 %-------------------------------------------
% 0.14/0.48 cnf(6,plain,
% 0.14/0.48 (~P1(f2(a3,a3))),
% 0.14/0.48 inference(scs_inference,[],[4,1,5])).
% 0.14/0.48 cnf(9,plain,
% 0.14/0.48 (P1(f2(f2(f2(f1(x91),x92),x93),f2(x91,x93)))),
% 0.14/0.48 inference(scs_inference,[],[1,3,5])).
% 0.14/0.48 cnf(12,plain,
% 0.14/0.48 ($false),
% 0.14/0.48 inference(scs_inference,[],[6,9,2,5]),
% 0.14/0.48 ['proof']).
% 0.14/0.48 % SZS output end Proof
% 0.14/0.48 % Total time :0.004590s
%------------------------------------------------------------------------------