%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : LCL195-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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:46 AM UTC 2026
% Result : Unsatisfiable 0.90s 1.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL195-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.07/0.35 % Computer : n014.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 4 16:55:12 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.26/0.51 start to proof:theBenchmark
% 0.76/1.02 %-------------------------------------------
% 0.76/1.02 % File :CSE---1.7
% 0.76/1.02 % Problem :theBenchmark
% 0.76/1.02 % Transform :cnf
% 0.76/1.02 % Format :tptp:raw
% 0.76/1.02 % Command :java -jar mcs_scs.jar %d %s
% 0.76/1.02
% 0.76/1.02 % Result :Theorem 0.530260s
% 0.76/1.02 % Output :CNFRefutation 0.530260s
% 0.76/1.02 %-------------------------------------------
% 0.76/1.03 %--------------------------------------------------------------------------
% 0.76/1.03 % File : LCL195-1 : TPTP v9.3.1. Released v1.1.0.
% 0.76/1.03 % Domain : Logic Calculi (Propositional)
% 0.76/1.03 % Problem : Principia Mathematica 2.38
% 0.76/1.03 % Version : [WR27] axioms : Reduced & Augmented.
% 0.76/1.03 % English :
% 0.76/1.03
% 0.76/1.03 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.76/1.03 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 0.76/1.03 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 0.76/1.03 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 0.76/1.03 % Source : [SE94]
% 0.76/1.03 % Names : Problem 2.38 [WR27]
% 0.76/1.03
% 0.76/1.03 % Status : Unsatisfiable
% 0.76/1.03 % Rating : 0.00 v9.3.0, 0.12 v9.1.0, 0.13 v9.0.0, 0.09 v8.2.0, 0.00 v6.1.0, 0.07 v6.0.0, 0.11 v5.5.0, 0.12 v5.4.0, 0.22 v5.3.0, 0.35 v5.2.0, 0.15 v5.1.0, 0.12 v5.0.0, 0.13 v4.0.1, 0.00 v3.1.0, 0.17 v2.7.0, 0.12 v2.6.0, 0.00 v2.5.0, 0.14 v2.4.0, 0.29 v2.3.0, 0.29 v2.2.1, 0.56 v2.1.0, 0.63 v2.0.0
% 0.76/1.03 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 0.76/1.03 % Number of literals : 14 ( 0 equ; 6 neg)
% 0.76/1.03 % Maximal clause size : 3 ( 1 avg)
% 0.76/1.03 % Maximal term depth : 5 ( 2 avg)
% 0.76/1.03 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 0.76/1.03 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% 0.76/1.03 % Number of variables : 17 ( 1 sgn)
% 0.76/1.03 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.76/1.03
% 0.76/1.03 % Comments : Reduced to use only or and not, and includes a redundant rule
% 0.76/1.03 % of transitivity of implication, and a reduced rule of
% 0.76/1.03 % detachment.
% 0.76/1.03 %--------------------------------------------------------------------------
% 0.76/1.03 %----Include axioms of propositional logic
% 0.90/1.03 include('Axioms/LCL003-0.ax').
% 0.90/1.03 %--------------------------------------------------------------------------
% 0.90/1.03 cnf(prove_this,negated_conjecture,
% 0.90/1.03 ~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))) ).
% 0.90/1.03
% 0.90/1.03 %--------------------------------------------------------------------------
% 0.90/1.03 %-------------------------------------------
% 0.90/1.03 % Proof found
% 0.90/1.03 % SZS status Theorem for theBenchmark
% 0.90/1.03 % SZS output start Proof
% 0.90/1.03 %ClaNum:9(EqnAxiom:0)
% 0.90/1.03 %VarNum:34(SingletonVarNum:17)
% 0.90/1.03 %MaxLitNum:3
% 0.90/1.03 %MaxfuncDepth:3
% 0.90/1.03 %SharedTerms:12
% 0.90/1.03 %goalClause: 6
% 0.90/1.03 %singleGoalClaCount:1
% 0.90/1.03 [6]~P2(f2(f1(f2(f1(a3),a5)),f2(f1(f2(a3,a4)),f2(a5,a4))))
% 0.90/1.03 [2]P1(f2(f1(f2(x21,x21)),x21))
% 0.90/1.03 [1]P1(f2(f1(x11),f2(x12,x11)))
% 0.90/1.03 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 0.90/1.03 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 0.90/1.03 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 0.90/1.03 [7]~P1(x71)+P2(x71)
% 0.90/1.03 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 0.90/1.03 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 0.90/1.03 %EqnAxiom
% 0.90/1.03
% 0.90/1.03 %-------------------------------------------
% 0.90/1.03 cnf(27,plain,
% 0.90/1.03 (P2(f2(f1(f2(x271,x272)),f2(x271,x273)))+~P2(f2(f1(x272),x273))),
% 0.90/1.03 inference(scs_inference,[],[6,5,7,8])).
% 0.90/1.03 cnf(1547,plain,
% 0.90/1.03 (P2(f2(f1(f2(x15471,f2(x15472,x15473))),f2(x15471,f2(x15473,x15472))))),
% 0.90/1.03 inference(scs_inference,[],[3,27,7])).
% 0.90/1.03 cnf(1550,plain,
% 0.90/1.03 (P2(f2(x15501,f2(f1(f2(x15501,f2(x15502,x15503))),f2(x15503,x15502))))),
% 0.90/1.03 inference(scs_inference,[],[6,1547,4,7,8])).
% 0.90/1.03 cnf(1558,plain,
% 0.90/1.03 (P2(f2(f1(f2(x15581,x15582)),f2(f1(f2(f1(f2(x15582,x15581)),f2(x15583,x15584))),f2(x15584,x15583))))),
% 0.90/1.03 inference(scs_inference,[],[3,6,1550,7,9])).
% 0.90/1.03 cnf(1563,plain,
% 0.90/1.03 (P2(f2(f1(f2(f1(f2(x15631,x15632)),f2(x15633,x15634))),f2(f1(f2(x15632,x15631)),f2(x15634,x15633))))),
% 0.90/1.03 inference(scs_inference,[],[6,1558,4,7,8])).
% 0.90/1.03 cnf(1571,plain,
% 0.90/1.03 ($false),
% 0.90/1.03 inference(scs_inference,[],[6,5,1563,7,9]),
% 0.90/1.03 ['proof']).
% 0.90/1.03 % SZS output end Proof
% 0.90/1.03 % Total time :0.530260s
%------------------------------------------------------------------------------