TSTP Solution File: LCL195-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL195-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 : n008.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:22 EDT 2023
% Result : Unsatisfiable 6.31s 6.39s
% Output : CNFRefutation 6.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL195-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.18/0.35 % Computer : n008.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Fri Aug 25 06:15:47 EDT 2023
% 0.18/0.35 % CPUTime :
% 0.21/0.58 start to proof:theBenchmark
% 6.31/6.38 %-------------------------------------------
% 6.31/6.38 % File :CSE---1.6
% 6.31/6.38 % Problem :theBenchmark
% 6.31/6.38 % Transform :cnf
% 6.31/6.38 % Format :tptp:raw
% 6.31/6.38 % Command :java -jar mcs_scs.jar %d %s
% 6.31/6.38
% 6.31/6.38 % Result :Theorem 5.740000s
% 6.31/6.38 % Output :CNFRefutation 5.740000s
% 6.31/6.38 %-------------------------------------------
% 6.31/6.39 %--------------------------------------------------------------------------
% 6.31/6.39 % File : LCL195-1 : TPTP v8.1.2. Released v1.1.0.
% 6.31/6.39 % Domain : Logic Calculi (Propositional)
% 6.31/6.39 % Problem : Principia Mathematica 2.38
% 6.31/6.39 % Version : [WR27] axioms : Reduced & Augmented.
% 6.31/6.39 % English :
% 6.31/6.39
% 6.31/6.39 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 6.31/6.39 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 6.31/6.39 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 6.31/6.39 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 6.31/6.39 % Source : [SE94]
% 6.31/6.39 % Names : Problem 2.38 [WR27]
% 6.31/6.39
% 6.31/6.39 % Status : Unsatisfiable
% 6.31/6.39 % Rating : 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
% 6.31/6.39 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 6.31/6.39 % Number of literals : 14 ( 0 equ; 6 neg)
% 6.31/6.39 % Maximal clause size : 3 ( 1 avg)
% 6.31/6.39 % Maximal term depth : 5 ( 2 avg)
% 6.31/6.39 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 6.31/6.39 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% 6.31/6.39 % Number of variables : 17 ( 1 sgn)
% 6.31/6.39 % SPC : CNF_UNS_RFO_NEQ_HRN
% 6.31/6.39
% 6.31/6.39 % Comments : Reduced to use only or and not, and includes a redundant rule
% 6.31/6.39 % of transitivity of implication, and a reduced rule of
% 6.31/6.39 % detachment.
% 6.31/6.39 %--------------------------------------------------------------------------
% 6.31/6.39 %----Include axioms of propositional logic
% 6.31/6.39 include('Axioms/LCL003-0.ax').
% 6.31/6.39 %--------------------------------------------------------------------------
% 6.31/6.39 cnf(prove_this,negated_conjecture,
% 6.31/6.39 ~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))) ).
% 6.31/6.39
% 6.31/6.39 %--------------------------------------------------------------------------
% 6.31/6.39 %-------------------------------------------
% 6.31/6.39 % Proof found
% 6.31/6.39 % SZS status Theorem for theBenchmark
% 6.31/6.39 % SZS output start Proof
% 6.31/6.39 %ClaNum:9(EqnAxiom:0)
% 6.31/6.39 %VarNum:34(SingletonVarNum:17)
% 6.31/6.39 %MaxLitNum:3
% 6.31/6.39 %MaxfuncDepth:3
% 6.31/6.39 %SharedTerms:12
% 6.31/6.39 %goalClause: 6
% 6.31/6.39 %singleGoalClaCount:1
% 6.31/6.39 [6]~P2(f2(f1(f2(f1(a3),a5)),f2(f1(f2(a3,a4)),f2(a5,a4))))
% 6.31/6.39 [2]P1(f2(f1(f2(x21,x21)),x21))
% 6.31/6.39 [1]P1(f2(f1(x11),f2(x12,x11)))
% 6.31/6.39 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 6.31/6.39 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 6.31/6.39 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 6.31/6.39 [7]~P1(x71)+P2(x71)
% 6.31/6.39 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 6.31/6.39 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 6.31/6.39 %EqnAxiom
% 6.31/6.39
% 6.31/6.39 %-------------------------------------------
% 6.31/6.40 cnf(11,plain,
% 6.31/6.40 (~P2(f2(f1(f2(a3,a4)),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[6,1,7,8])).
% 6.31/6.40 cnf(12,plain,
% 6.31/6.40 (P1(f2(f1(x121),f2(x122,x121)))),
% 6.31/6.40 inference(rename_variables,[],[1])).
% 6.31/6.40 cnf(14,plain,
% 6.31/6.40 (~P2(f2(f1(f2(x141,f2(a3,a4))),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[6,1,12,7,8,9])).
% 6.31/6.40 cnf(34,plain,
% 6.31/6.40 (P2(f2(f1(x341),f2(x342,x341)))),
% 6.31/6.40 inference(scs_inference,[],[1,7])).
% 6.31/6.40 cnf(39,plain,
% 6.31/6.40 (~P2(f2(f1(f2(a3,f2(x391,a4))),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[1,4,11,14,7,8,9])).
% 6.31/6.40 cnf(67,plain,
% 6.31/6.40 (P2(f2(f1(f2(x671,x672)),f2(x672,x671)))),
% 6.31/6.40 inference(scs_inference,[],[3,7])).
% 6.31/6.40 cnf(98,plain,
% 6.31/6.40 (~P2(f2(f1(f2(a4,a3)),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[11,4,3,8,9])).
% 6.31/6.40 cnf(125,plain,
% 6.31/6.40 (P2(f2(f1(f2(x1251,x1251)),f2(x1252,x1251)))),
% 6.31/6.40 inference(scs_inference,[],[34,2,9])).
% 6.31/6.40 cnf(176,plain,
% 6.31/6.40 (P2(f2(f1(f2(f2(x1761,x1761),f2(x1761,x1761))),f2(x1762,x1761)))),
% 6.31/6.40 inference(scs_inference,[],[125,5,2,8,9])).
% 6.31/6.40 cnf(194,plain,
% 6.31/6.40 (P2(f2(f1(f2(x1941,f2(x1942,x1943))),f2(x1941,f2(x1943,x1942))))),
% 6.31/6.40 inference(scs_inference,[],[39,67,176,5,2,9,7,8])).
% 6.31/6.40 cnf(260,plain,
% 6.31/6.40 (~P2(f2(f1(f2(x2601,f2(a4,a3))),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[98,125,1,8,9])).
% 6.31/6.40 cnf(573,plain,
% 6.31/6.40 (~P2(f2(f1(f2(f1(f2(x5731,a3)),f2(x5731,a5))),f2(f1(f2(a3,a4)),f2(a5,a4))))),
% 6.31/6.40 inference(scs_inference,[],[6,5,9])).
% 6.31/6.40 cnf(658,plain,
% 6.31/6.40 (~P2(f2(f1(f2(f2(a4,a3),x6581)),f2(a5,a4)))),
% 6.31/6.40 inference(scs_inference,[],[260,3,9])).
% 6.31/6.40 cnf(1206,plain,
% 6.31/6.40 (~P2(f2(f1(f2(a3,a4)),f2(f1(f2(f1(f2(x12061,a3)),f2(x12061,a5))),f2(a5,a4))))),
% 6.31/6.40 inference(scs_inference,[],[573,4,8])).
% 6.31/6.40 cnf(1363,plain,
% 6.31/6.40 (P1(f2(f1(f2(x13631,x13632)),f2(x13632,x13631)))),
% 6.31/6.40 inference(rename_variables,[],[3])).
% 6.31/6.40 cnf(1365,plain,
% 6.31/6.40 (~P2(f2(f1(f2(a4,a3)),f2(f1(f2(f1(f2(x13651,a3)),f2(x13651,a5))),f2(a5,a4))))),
% 6.31/6.40 inference(scs_inference,[],[658,1206,3,1363,8,9])).
% 6.31/6.40 cnf(2346,plain,
% 6.31/6.40 ($false),
% 6.31/6.40 inference(scs_inference,[],[1365,194,4,8]),
% 6.31/6.40 ['proof']).
% 6.31/6.40 % SZS output end Proof
% 6.31/6.40 % Total time :5.740000s
%------------------------------------------------------------------------------