TSTP Solution File: LCL213-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL213-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n032.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:29 EDT 2023
% Result : Unsatisfiable 4.48s 4.52s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL213-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri Aug 25 05:15:12 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.52 start to proof:theBenchmark
% 4.48/4.51 %-------------------------------------------
% 4.48/4.51 % File :CSE---1.6
% 4.48/4.51 % Problem :theBenchmark
% 4.48/4.51 % Transform :cnf
% 4.48/4.51 % Format :tptp:raw
% 4.48/4.51 % Command :java -jar mcs_scs.jar %d %s
% 4.48/4.51
% 4.48/4.51 % Result :Theorem 3.950000s
% 4.48/4.52 % Output :CNFRefutation 3.950000s
% 4.48/4.52 %-------------------------------------------
% 4.48/4.52 %--------------------------------------------------------------------------
% 4.48/4.52 % File : LCL213-1 : TPTP v8.1.2. Released v1.1.0.
% 4.48/4.52 % Domain : Logic Calculi (Propositional)
% 4.48/4.52 % Problem : Principia Mathematica 2.61
% 4.48/4.52 % Version : [WR27] axioms : Reduced & Augmented.
% 4.48/4.52 % English :
% 4.48/4.52
% 4.48/4.52 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 4.48/4.52 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 4.48/4.52 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 4.48/4.52 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 4.48/4.52 % Source : [SE94]
% 4.48/4.52 % Names : Problem 2.61 [WR27]
% 4.48/4.52
% 4.48/4.52 % Status : Unsatisfiable
% 4.48/4.52 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.11 v5.3.0, 0.20 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.1.0, 0.13 v2.0.0
% 4.48/4.52 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 4.48/4.52 % Number of literals : 14 ( 0 equ; 6 neg)
% 4.48/4.52 % Maximal clause size : 3 ( 1 avg)
% 4.48/4.52 % Maximal term depth : 7 ( 2 avg)
% 4.48/4.52 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 4.48/4.52 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 4.48/4.52 % Number of variables : 17 ( 1 sgn)
% 4.48/4.52 % SPC : CNF_UNS_RFO_NEQ_HRN
% 4.48/4.52
% 4.48/4.52 % Comments : Reduced to use only or and not, and includes a redundant rule
% 4.48/4.52 % of transitivity of implication, and a reduced rule of
% 4.48/4.52 % detachment.
% 4.48/4.52 %--------------------------------------------------------------------------
% 4.48/4.52 %----Include axioms of propositional logic
% 4.48/4.52 include('Axioms/LCL003-0.ax').
% 4.48/4.52 %--------------------------------------------------------------------------
% 4.48/4.52 cnf(prove_this,negated_conjecture,
% 4.48/4.52 ~ theorem(or(not(or(not(p),q)),or(not(or(not(not(p)),q)),q))) ).
% 4.48/4.52
% 4.48/4.52 %--------------------------------------------------------------------------
% 4.48/4.52 %-------------------------------------------
% 4.48/4.52 % Proof found
% 4.48/4.52 % SZS status Theorem for theBenchmark
% 4.48/4.52 % SZS output start Proof
% 4.48/4.52 %ClaNum:9(EqnAxiom:0)
% 4.48/4.52 %VarNum:34(SingletonVarNum:17)
% 4.48/4.52 %MaxLitNum:3
% 4.48/4.52 %MaxfuncDepth:6
% 4.48/4.52 %SharedTerms:11
% 4.48/4.52 %goalClause: 6
% 4.48/4.52 %singleGoalClaCount:1
% 4.48/4.52 [6]~P2(f2(f1(f2(f1(a3),a4)),f2(f1(f2(f1(f1(a3)),a4)),a4)))
% 4.48/4.52 [2]P1(f2(f1(f2(x21,x21)),x21))
% 4.48/4.52 [1]P1(f2(f1(x11),f2(x12,x11)))
% 4.48/4.52 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 4.48/4.52 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 4.48/4.52 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 4.48/4.52 [7]~P1(x71)+P2(x71)
% 4.48/4.52 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 4.48/4.52 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 4.48/4.52 %EqnAxiom
% 4.48/4.52
% 4.48/4.52 %-------------------------------------------
% 4.48/4.53 cnf(11,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f1(a3)),a4)),a4))),
% 4.48/4.53 inference(scs_inference,[],[6,1,7,8])).
% 4.48/4.53 cnf(14,plain,
% 4.48/4.53 (~P2(f2(f1(x141),x142))+P2(f2(f1(f2(x141,x141)),x142))),
% 4.48/4.53 inference(scs_inference,[],[6,1,2,7,8,9])).
% 4.48/4.53 cnf(16,plain,
% 4.48/4.53 (P2(f2(f1(f2(x161,x162)),f2(x162,x161)))),
% 4.48/4.53 inference(scs_inference,[],[3,7])).
% 4.48/4.53 cnf(47,plain,
% 4.48/4.53 (P2(f2(f1(f2(x471,x471)),x471))),
% 4.48/4.53 inference(scs_inference,[],[2,7])).
% 4.48/4.53 cnf(50,plain,
% 4.48/4.53 (P1(f2(f1(f2(f1(x501),x502)),f2(f1(f2(x503,x501)),f2(x503,x502))))),
% 4.48/4.53 inference(rename_variables,[],[5])).
% 4.48/4.53 cnf(52,plain,
% 4.48/4.53 (P2(f2(f1(f2(x521,f2(x522,x523))),f2(x521,f2(x523,x522))))),
% 4.48/4.53 inference(scs_inference,[],[2,5,50,16,11,7,9,8])).
% 4.48/4.53 cnf(84,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f1(a3)),a4)),f2(f1(f2(f1(a3),a4)),a4)))),
% 4.48/4.53 inference(scs_inference,[],[4,5,6,7,8])).
% 4.48/4.53 cnf(181,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f2(x1811,f1(a3))),f2(x1811,a4))),f2(f1(f2(f1(a3),a4)),a4)))),
% 4.48/4.53 inference(scs_inference,[],[84,5,9])).
% 4.48/4.53 cnf(202,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f2(x2021,a3)),f2(x2021,a4))),f2(f1(f2(f1(f1(a3)),a4)),a4)))),
% 4.48/4.53 inference(scs_inference,[],[6,5,9])).
% 4.48/4.53 cnf(205,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(a3),a4)),f2(f1(f2(f1(f2(x2051,f1(a3))),f2(x2051,a4))),a4)))),
% 4.48/4.53 inference(scs_inference,[],[181,6,4,5,9,8])).
% 4.48/4.53 cnf(219,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f2(x2191,a3)),f2(x2191,a4))),f2(f1(f2(f1(f2(x2192,f1(a3))),f2(x2192,a4))),a4)))),
% 4.48/4.53 inference(scs_inference,[],[205,5,9])).
% 4.48/4.53 cnf(222,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f1(a3)),a4)),f2(f1(f2(f1(f2(x2221,a3)),f2(x2221,a4))),a4)))),
% 4.48/4.53 inference(scs_inference,[],[202,205,4,5,9,8])).
% 4.48/4.53 cnf(230,plain,
% 4.48/4.53 (P2(f2(f1(f2(f2(x2301,x2302),x2303)),f2(x2303,f2(x2302,x2301))))),
% 4.48/4.53 inference(scs_inference,[],[52,3,9])).
% 4.48/4.53 cnf(242,plain,
% 4.48/4.53 (P1(f2(f1(f2(f1(x2421),x2422)),f2(f1(f2(x2423,x2421)),f2(x2423,x2422))))),
% 4.48/4.53 inference(rename_variables,[],[5])).
% 4.48/4.53 cnf(244,plain,
% 4.48/4.53 (P2(f2(f1(f2(x2441,f2(x2442,f2(x2443,x2444)))),f2(x2441,f2(x2442,f2(x2444,x2443)))))),
% 4.48/4.53 inference(scs_inference,[],[52,222,5,242,9,8])).
% 4.48/4.53 cnf(673,plain,
% 4.48/4.53 (P2(f2(f1(f2(f2(x6731,f2(x6732,f2(x6733,x6734))),f2(x6731,f2(x6732,f2(x6733,x6734))))),f2(x6731,f2(x6732,f2(x6734,x6733)))))),
% 4.48/4.53 inference(scs_inference,[],[219,230,244,2,7,9,14])).
% 4.48/4.53 cnf(683,plain,
% 4.48/4.53 (~P2(f2(f1(f2(a4,f1(a3))),f2(f1(f2(f1(f2(x6831,f1(a3))),f2(x6831,a4))),a4)))),
% 4.48/4.53 inference(scs_inference,[],[205,3,9])).
% 4.48/4.53 cnf(1906,plain,
% 4.48/4.53 (~P2(f2(f1(f2(f1(f2(x19061,f1(a3))),f2(x19061,a4))),f2(f1(f2(a4,f1(a3))),a4)))),
% 4.48/4.53 inference(scs_inference,[],[683,1,4,9,8])).
% 4.48/4.53 cnf(1934,plain,
% 4.48/4.53 ($false),
% 4.48/4.53 inference(scs_inference,[],[673,1906,47,4,5,9,8]),
% 4.48/4.53 ['proof']).
% 4.48/4.53 % SZS output end Proof
% 4.48/4.53 % Total time :3.950000s
%------------------------------------------------------------------------------