TSTP Solution File: LCL216-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL216-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n011.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:30 EDT 2023
% Result : Unsatisfiable 0.50s 0.76s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : LCL216-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Aug 25 07:20:23 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.57 start to proof:theBenchmark
% 0.50/0.75 %-------------------------------------------
% 0.50/0.75 % File :CSE---1.6
% 0.50/0.75 % Problem :theBenchmark
% 0.50/0.75 % Transform :cnf
% 0.50/0.75 % Format :tptp:raw
% 0.50/0.75 % Command :java -jar mcs_scs.jar %d %s
% 0.50/0.75
% 0.50/0.75 % Result :Theorem 0.130000s
% 0.50/0.75 % Output :CNFRefutation 0.130000s
% 0.50/0.75 %-------------------------------------------
% 0.50/0.76 %--------------------------------------------------------------------------
% 0.50/0.76 % File : LCL216-1 : TPTP v8.1.2. Released v1.1.0.
% 0.50/0.76 % Domain : Logic Calculi (Propositional)
% 0.50/0.76 % Problem : Principia Mathematica 2.64
% 0.50/0.76 % Version : [WR27] axioms : Reduced & Augmented.
% 0.50/0.76 % English :
% 0.50/0.76
% 0.50/0.76 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.50/0.76 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 0.50/0.76 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 0.50/0.76 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 0.50/0.76 % Source : [SE94]
% 0.50/0.76 % Names : Problem 2.64 [WR27]
% 0.50/0.76
% 0.50/0.76 % Status : Unsatisfiable
% 0.50/0.76 % 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.2.1, 0.22 v2.1.0, 0.38 v2.0.0
% 0.50/0.76 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 0.50/0.76 % Number of literals : 14 ( 0 equ; 6 neg)
% 0.50/0.76 % Maximal clause size : 3 ( 1 avg)
% 0.50/0.76 % Maximal term depth : 6 ( 2 avg)
% 0.50/0.76 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 0.50/0.76 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 0.50/0.76 % Number of variables : 17 ( 1 sgn)
% 0.50/0.76 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.50/0.76
% 0.50/0.76 % Comments : Reduced to use only or and not, and includes a redundant rule
% 0.50/0.76 % of transitivity of implication, and a reduced rule of
% 0.50/0.76 % detachment.
% 0.50/0.76 %--------------------------------------------------------------------------
% 0.50/0.76 %----Include axioms of propositional logic
% 0.50/0.76 include('Axioms/LCL003-0.ax').
% 0.50/0.76 %--------------------------------------------------------------------------
% 0.50/0.76 cnf(prove_this,negated_conjecture,
% 0.50/0.76 ~ theorem(or(not(or(p,q)),or(not(or(p,not(q))),p))) ).
% 0.50/0.76
% 0.50/0.76 %--------------------------------------------------------------------------
% 0.50/0.76 %-------------------------------------------
% 0.50/0.76 % Proof found
% 0.50/0.76 % SZS status Theorem for theBenchmark
% 0.50/0.76 % SZS output start Proof
% 0.50/0.76 %ClaNum:9(EqnAxiom:0)
% 0.50/0.76 %VarNum:34(SingletonVarNum:17)
% 0.50/0.76 %MaxLitNum:3
% 0.50/0.76 %MaxfuncDepth:5
% 0.50/0.76 %SharedTerms:9
% 0.50/0.76 %goalClause: 6
% 0.50/0.76 %singleGoalClaCount:1
% 0.50/0.76 [6]~P2(f2(f1(f2(a3,a4)),f2(f1(f2(a3,f1(a4))),a3)))
% 0.50/0.76 [2]P1(f2(f1(f2(x21,x21)),x21))
% 0.50/0.76 [1]P1(f2(f1(x11),f2(x12,x11)))
% 0.50/0.76 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 0.50/0.76 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 0.50/0.76 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 0.50/0.76 [7]~P1(x71)+P2(x71)
% 0.50/0.76 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 0.50/0.76 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 0.50/0.76 %EqnAxiom
% 0.50/0.76
% 0.50/0.76 %-------------------------------------------
% 0.50/0.77 cnf(11,plain,
% 0.50/0.77 (~P2(f2(f1(f2(a3,f1(a4))),a3))),
% 0.50/0.77 inference(scs_inference,[],[6,1,7,8])).
% 0.50/0.77 cnf(37,plain,
% 0.50/0.77 (P2(f2(f1(f2(x371,x371)),x371))),
% 0.50/0.77 inference(scs_inference,[],[2,7])).
% 0.50/0.77 cnf(49,plain,
% 0.50/0.77 (P2(f2(f1(f2(x491,f2(x492,x493))),f2(x492,f2(x491,x493))))),
% 0.50/0.77 inference(scs_inference,[],[4,7])).
% 0.50/0.77 cnf(57,plain,
% 0.50/0.77 (~P2(f2(f1(f2(a3,f1(a4))),f2(f1(f2(a3,a4)),a3)))),
% 0.50/0.77 inference(scs_inference,[],[4,6,8])).
% 0.50/0.77 cnf(88,plain,
% 0.50/0.77 (~P2(a3)),
% 0.50/0.77 inference(scs_inference,[],[11,1,8])).
% 0.50/0.77 cnf(116,plain,
% 0.50/0.77 (~P2(f2(a3,a3))),
% 0.50/0.77 inference(scs_inference,[],[88,2,8])).
% 0.50/0.77 cnf(171,plain,
% 0.50/0.77 (P2(f2(f1(f2(x1711,f2(x1712,x1712))),f2(x1711,x1712)))),
% 0.50/0.77 inference(scs_inference,[],[37,5,8])).
% 0.50/0.77 cnf(210,plain,
% 0.50/0.77 (~P2(f2(f1(f2(f1(a4),a3)),f2(f1(f2(a3,a4)),a3)))),
% 0.50/0.77 inference(scs_inference,[],[49,57,5,3,8,9])).
% 0.50/0.77 cnf(222,plain,
% 0.50/0.77 ($false),
% 0.50/0.77 inference(scs_inference,[],[210,171,116,2,5,8,9]),
% 0.50/0.77 ['proof']).
% 0.50/0.77 % SZS output end Proof
% 0.50/0.77 % Total time :0.130000s
%------------------------------------------------------------------------------