TSTP Solution File: LCL206-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL206-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 : n015.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:26 EDT 2023
% Result : Unsatisfiable 62.48s 62.57s
% Output : CNFRefutation 62.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL206-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 06:38:21 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.54 start to proof:theBenchmark
% 62.48/62.55 %-------------------------------------------
% 62.48/62.55 % File :CSE---1.6
% 62.48/62.55 % Problem :theBenchmark
% 62.48/62.55 % Transform :cnf
% 62.48/62.55 % Format :tptp:raw
% 62.48/62.55 % Command :java -jar mcs_scs.jar %d %s
% 62.48/62.55
% 62.48/62.55 % Result :Theorem 61.930000s
% 62.48/62.55 % Output :CNFRefutation 61.930000s
% 62.48/62.55 %-------------------------------------------
% 62.48/62.56 %--------------------------------------------------------------------------
% 62.48/62.56 % File : LCL206-1 : TPTP v8.1.2. Released v1.1.0.
% 62.48/62.56 % Domain : Logic Calculi (Propositional)
% 62.48/62.56 % Problem : Principia Mathematica 2.52
% 62.48/62.56 % Version : [WR27] axioms : Reduced & Augmented.
% 62.48/62.56 % English :
% 62.48/62.56
% 62.48/62.56 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 62.48/62.56 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 62.48/62.56 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 62.48/62.56 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 62.48/62.56 % Source : [SE94]
% 62.48/62.56 % Names : Problem 2.52 [WR27]
% 62.48/62.56
% 62.48/62.56 % Status : Unsatisfiable
% 62.48/62.56 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.17 v5.3.0, 0.15 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.0.0
% 62.48/62.56 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 62.48/62.56 % Number of literals : 14 ( 0 equ; 6 neg)
% 62.48/62.56 % Maximal clause size : 3 ( 1 avg)
% 62.48/62.56 % Maximal term depth : 6 ( 2 avg)
% 62.48/62.56 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 62.48/62.56 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 62.48/62.56 % Number of variables : 17 ( 1 sgn)
% 62.48/62.56 % SPC : CNF_UNS_RFO_NEQ_HRN
% 62.48/62.56
% 62.48/62.56 % Comments : Reduced to use only or and not, and includes a redundant rule
% 62.48/62.56 % of transitivity of implication, and a reduced rule of
% 62.48/62.56 % detachment.
% 62.48/62.56 %--------------------------------------------------------------------------
% 62.48/62.56 %----Include axioms of propositional logic
% 62.48/62.57 include('Axioms/LCL003-0.ax').
% 62.48/62.57 %--------------------------------------------------------------------------
% 62.48/62.57 cnf(prove_this,negated_conjecture,
% 62.48/62.57 ~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(q)))) ).
% 62.48/62.57
% 62.48/62.57 %--------------------------------------------------------------------------
% 62.48/62.57 %-------------------------------------------
% 62.48/62.57 % Proof found
% 62.48/62.57 % SZS status Theorem for theBenchmark
% 62.48/62.57 % SZS output start Proof
% 62.48/62.57 %ClaNum:9(EqnAxiom:0)
% 62.48/62.57 %VarNum:34(SingletonVarNum:17)
% 62.48/62.57 %MaxLitNum:3
% 62.48/62.57 %MaxfuncDepth:3
% 62.48/62.57 %SharedTerms:11
% 62.48/62.57 %goalClause: 6
% 62.48/62.57 %singleGoalClaCount:1
% 62.48/62.57 [6]~P2(f2(f1(f1(f2(f1(a3),a4))),f2(f1(f1(a3)),f1(a4))))
% 62.48/62.57 [2]P1(f2(f1(f2(x21,x21)),x21))
% 62.48/62.57 [1]P1(f2(f1(x11),f2(x12,x11)))
% 62.48/62.57 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 62.48/62.57 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 62.48/62.57 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 62.48/62.57 [7]~P1(x71)+P2(x71)
% 62.48/62.57 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 62.48/62.57 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 62.48/62.57 %EqnAxiom
% 62.48/62.57
% 62.48/62.57 %-------------------------------------------
% 62.48/62.58 cnf(12,plain,
% 62.48/62.58 (P1(f2(f1(x121),f2(x122,x121)))),
% 62.48/62.58 inference(rename_variables,[],[1])).
% 62.48/62.58 cnf(14,plain,
% 62.48/62.58 (~P2(f2(f1(f2(x141,f1(a3))),f1(a4)))),
% 62.48/62.58 inference(scs_inference,[],[6,1,12,7,8,9])).
% 62.48/62.58 cnf(17,plain,
% 62.48/62.58 (~P2(f2(f1(f2(f1(a3),x171)),f1(a4)))),
% 62.48/62.58 inference(scs_inference,[],[3,14,9])).
% 62.48/62.58 cnf(20,plain,
% 62.48/62.58 (P2(f2(f1(f2(x201,x201)),x201))),
% 62.48/62.58 inference(scs_inference,[],[2,3,14,9,7])).
% 62.48/62.58 cnf(25,plain,
% 62.48/62.58 (P1(f2(f1(x251),f2(x252,x251)))),
% 62.48/62.58 inference(rename_variables,[],[1])).
% 62.48/62.58 cnf(27,plain,
% 62.48/62.58 (P2(f2(f1(x271),x271))),
% 62.48/62.58 inference(scs_inference,[],[1,25,20,8,9])).
% 62.48/62.58 cnf(84,plain,
% 62.48/62.58 (~P2(f2(f1(f1(a3)),f2(f1(f1(f2(f1(a3),a4))),f1(a4))))),
% 62.48/62.58 inference(scs_inference,[],[4,6,8])).
% 62.48/62.58 cnf(118,plain,
% 62.48/62.58 (~P2(f2(f1(f2(x1181,f2(x1182,f1(a3)))),f1(a4)))),
% 62.48/62.58 inference(scs_inference,[],[14,1,9])).
% 62.48/62.58 cnf(141,plain,
% 62.48/62.58 (P2(f2(x1411,f1(x1411)))),
% 62.48/62.58 inference(scs_inference,[],[17,27,3,5,9,8])).
% 62.48/62.58 cnf(308,plain,
% 62.48/62.58 (~P2(f2(f1(f1(f2(f1(a3),a4))),f1(a4)))),
% 62.48/62.58 inference(scs_inference,[],[84,118,1,3,9,8])).
% 62.48/62.58 cnf(823,plain,
% 62.48/62.58 (~P2(f2(f1(a4),f1(f1(f2(f1(a3),a4)))))),
% 62.48/62.58 inference(scs_inference,[],[308,3,8])).
% 62.48/62.58 cnf(5978,plain,
% 62.48/62.58 ($false),
% 62.48/62.58 inference(scs_inference,[],[1,141,823,9]),
% 62.48/62.58 ['proof']).
% 62.48/62.59 % SZS output end Proof
% 62.48/62.59 % Total time :61.930000s
%------------------------------------------------------------------------------