TSTP Solution File: LCL186-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL186-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 : n003.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:18 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL186-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.13/0.34 % Computer : n003.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 : Thu Aug 24 23:53:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : LCL186-1 : TPTP v8.1.2. Released v1.1.0.
% 0.20/0.63 % Domain : Logic Calculi (Propositional)
% 0.20/0.63 % Problem : Principia Mathematica 2.21
% 0.20/0.63 % Version : [WR27] axioms : Reduced & Augmented.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.20/0.63 % : [NSS63] Newell et al. (1963), Empirical Explorations with the
% 0.20/0.63 % : [ORo89] O'Rourke (1989), LT Revisited: Explanation-Based Learn
% 0.20/0.63 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 0.20/0.63 % Source : [SE94]
% 0.20/0.63 % Names : Problem 2.21 [WR27]
% 0.20/0.63
% 0.20/0.64 % Status : Unsatisfiable
% 0.20/0.64 % 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.0.0
% 0.20/0.64 % Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% 0.20/0.64 % Number of literals : 14 ( 0 equ; 6 neg)
% 0.20/0.64 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.64 % Maximal term depth : 5 ( 2 avg)
% 0.20/0.64 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty)
% 0.20/0.64 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 0.20/0.64 % Number of variables : 17 ( 1 sgn)
% 0.20/0.64 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.64
% 0.20/0.64 % Comments : Reduced to use only or and not, and includes a redundant rule
% 0.20/0.64 % of transitivity of implication, and a reduced rule of
% 0.20/0.64 % detachment.
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 %----Include axioms of propositional logic
% 0.20/0.64 include('Axioms/LCL003-0.ax').
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 cnf(prove_this,negated_conjecture,
% 0.20/0.64 ~ theorem(or(not(not(p)),or(not(p),q))) ).
% 0.20/0.64
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:9(EqnAxiom:0)
% 0.20/0.64 %VarNum:34(SingletonVarNum:17)
% 0.20/0.64 %MaxLitNum:3
% 0.20/0.64 %MaxfuncDepth:3
% 0.20/0.64 %SharedTerms:7
% 0.20/0.64 %goalClause: 6
% 0.20/0.64 %singleGoalClaCount:1
% 0.20/0.64 [6]~P2(f2(f1(f1(a3)),f2(f1(a3),a4)))
% 0.20/0.64 [2]P1(f2(f1(f2(x21,x21)),x21))
% 0.20/0.64 [1]P1(f2(f1(x11),f2(x12,x11)))
% 0.20/0.64 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 0.20/0.64 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 0.20/0.64 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 0.20/0.64 [7]~P1(x71)+P2(x71)
% 0.20/0.64 [8]P2(x81)+~P2(x82)+~P1(f2(f1(x82),x81))
% 0.20/0.64 [9]~P2(f2(f1(x93),x92))+P2(f2(f1(x91),x92))+~P1(f2(f1(x91),x93))
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(12,plain,
% 0.20/0.64 (P1(f2(f1(x121),f2(x122,x121)))),
% 0.20/0.64 inference(rename_variables,[],[1])).
% 0.20/0.64 cnf(14,plain,
% 0.20/0.64 (~P2(f2(f1(f2(x141,f1(a3))),f2(f1(a3),a4)))),
% 0.20/0.64 inference(scs_inference,[],[6,1,12,7,8,9])).
% 0.20/0.64 cnf(42,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[14,3,7]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------