TSTP Solution File: LCL238-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL238-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 06:48:38 EDT 2023
% Result : Unsatisfiable 0.20s 0.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL238-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 07:22:15 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 % File :CSE---1.6
% 0.20/0.68 % Problem :theBenchmark
% 0.20/0.68 % Transform :cnf
% 0.20/0.68 % Format :tptp:raw
% 0.20/0.68 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.68
% 0.20/0.68 % Result :Theorem 0.070000s
% 0.20/0.68 % Output :CNFRefutation 0.070000s
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 %--------------------------------------------------------------------------
% 0.20/0.68 % File : LCL238-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.20/0.68 % Domain : Logic Calculi (Propositional)
% 0.20/0.68 % Problem : Principia Mathematica 3.22
% 0.20/0.68 % Version : [WR27] axioms : Reduced & Augmented.
% 0.20/0.68 % English :
% 0.20/0.68
% 0.20/0.68 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.20/0.68 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 0.20/0.68 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 0.20/0.68 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 0.20/0.68 % Source : [SE94]
% 0.20/0.68 % Names : Problem 3.22 [WR27]
% 0.20/0.68
% 0.20/0.68 % Status : Unsatisfiable
% 0.20/0.68 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.00 v2.3.0
% 0.20/0.68 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 0.20/0.68 % Number of literals : 14 ( 0 equ; 6 neg)
% 0.20/0.68 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.68 % Maximal term depth : 6 ( 2 avg)
% 0.20/0.68 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 0.20/0.68 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 0.20/0.68 % Number of variables : 17 ( 1 sgn)
% 0.20/0.68 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.68
% 0.20/0.68 % Comments : Reduced to use only or and not, and includes a redundant rule
% 0.20/0.68 % of transitivity of implication, and a reduced rule of
% 0.20/0.68 % detachment.
% 0.20/0.68 % Bugfixes : v2.3.0 - Function and/2 removed from prove_this
% 0.20/0.68 %--------------------------------------------------------------------------
% 0.20/0.68 %----Include axioms of propositional logic
% 0.20/0.68 include('Axioms/LCL003-0.ax').
% 0.20/0.68 %--------------------------------------------------------------------------
% 0.20/0.68 cnf(prove_this,negated_conjecture,
% 0.20/0.68 ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))) ).
% 0.20/0.68
% 0.20/0.68 %--------------------------------------------------------------------------
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 % Proof found
% 0.20/0.68 % SZS status Theorem for theBenchmark
% 0.20/0.68 % SZS output start Proof
% 0.20/0.68 %ClaNum:9(EqnAxiom:0)
% 0.20/0.68 %VarNum:34(SingletonVarNum:17)
% 0.20/0.68 %MaxLitNum:3
% 0.20/0.68 %MaxfuncDepth:4
% 0.20/0.68 %SharedTerms:11
% 0.20/0.68 %goalClause: 6
% 0.20/0.68 %singleGoalClaCount:1
% 0.20/0.68 [6]~P2(f2(f1(f1(f2(f1(a3),f1(a4)))),f1(f2(f1(a4),f1(a3)))))
% 0.20/0.68 [2]P1(f2(f1(f2(x21,x21)),x21))
% 0.20/0.68 [1]P1(f2(f1(x11),f2(x12,x11)))
% 0.20/0.68 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 0.20/0.68 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 0.20/0.68 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 0.20/0.68 [7]~P1(x71)+P2(x71)
% 0.20/0.68 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 0.20/0.68 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 0.20/0.69 %EqnAxiom
% 0.20/0.69
% 0.20/0.69 %-------------------------------------------
% 0.20/0.69 cnf(11,plain,
% 0.20/0.69 (~P2(f1(f2(f1(a4),f1(a3))))),
% 0.20/0.69 inference(scs_inference,[],[6,1,7,8])).
% 0.20/0.69 cnf(16,plain,
% 0.20/0.69 (P2(f2(f1(f2(x161,x162)),f2(x162,x161)))),
% 0.20/0.69 inference(scs_inference,[],[3,7])).
% 0.20/0.69 cnf(49,plain,
% 0.20/0.69 (~P2(f2(f1(f2(f1(a4),f1(a3))),f1(f1(f2(f1(a3),f1(a4))))))),
% 0.20/0.69 inference(scs_inference,[],[3,6,8])).
% 0.20/0.69 cnf(58,plain,
% 0.20/0.69 (~P2(f2(f1(f2(f1(a3),f1(a4))),f1(f1(f2(f1(a3),f1(a4))))))),
% 0.20/0.69 inference(scs_inference,[],[3,49,9])).
% 0.20/0.69 cnf(77,plain,
% 0.20/0.69 (~P2(f2(f1(f2(f1(a4),f1(a3))),f1(f2(f1(a4),f1(a3)))))),
% 0.20/0.69 inference(scs_inference,[],[4,16,11,2,9,8])).
% 0.20/0.69 cnf(181,plain,
% 0.20/0.69 (~P2(f2(f1(f2(f1(a3),f1(a4))),f1(f2(f1(a4),f1(a3)))))),
% 0.20/0.69 inference(scs_inference,[],[77,3,9])).
% 0.20/0.69 cnf(189,plain,
% 0.20/0.69 (P2(f2(f1(x1891),x1891))),
% 0.20/0.69 inference(scs_inference,[],[2,1,7,9])).
% 0.20/0.69 cnf(204,plain,
% 0.20/0.69 ($false),
% 0.20/0.69 inference(scs_inference,[],[58,189,181,5,3,9,7,8]),
% 0.20/0.69 ['proof']).
% 0.20/0.69 % SZS output end Proof
% 0.20/0.69 % Total time :0.070000s
%------------------------------------------------------------------------------