TSTP Solution File: LCL258-3 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL258-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n020.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:44 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL258-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 05:02:30 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 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.010000s
% 0.20/0.63 % Output :CNFRefutation 0.010000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : LCL258-3 : TPTP v8.1.2. Released v2.3.0.
% 0.20/0.63 % Domain : Logic Calculi (Propositional)
% 0.20/0.63 % Problem : Principia Mathematica 2.27
% 0.20/0.63 % Version : [WR27] axioms.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 0.20/0.63 % Source : [WR27]
% 0.20/0.63 % Names : Problem 2.27 [WR27]
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % Rating : 0.00 v7.0.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.0.0, 0.11 v5.5.0, 0.06 v5.4.0, 0.07 v5.3.0, 0.17 v5.2.0, 0.12 v5.1.0, 0.14 v4.1.0, 0.22 v4.0.1, 0.00 v3.3.0, 0.14 v3.2.0, 0.00 v2.3.0
% 0.20/0.63 % Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 3 RR)
% 0.20/0.63 % Number of literals : 12 ( 1 equ; 4 neg)
% 0.20/0.63 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.63 % Maximal term depth : 4 ( 2 avg)
% 0.20/0.63 % Number of predicates : 3 ( 2 usr; 0 prp; 1-2 aty)
% 0.20/0.63 % Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% 0.20/0.63 % Number of variables : 16 ( 1 sgn)
% 0.20/0.63 % SPC : CNF_UNS_RFO_SEQ_HRN
% 0.20/0.63
% 0.20/0.63 % Comments :
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %----Include axioms of propositional logic
% 0.20/0.63 include('Axioms/LCL004-0.ax').
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 cnf(prove_this,negated_conjecture,
% 0.20/0.63 ~ theorem(implies(p,implies(implies(p,q),q))) ).
% 0.20/0.63
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:8(EqnAxiom:0)
% 0.20/0.63 %VarNum:28(SingletonVarNum:14)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:5
% 0.20/0.63 %SharedTerms:8
% 0.20/0.63 %goalClause: 6
% 0.20/0.63 %singleGoalClaCount:1
% 0.20/0.63 [6]~P2(f2(f1(a3),f2(f1(f2(f1(a3),a4)),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)+~P2(f2(f1(x82),x81))
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(10,plain,
% 0.20/0.64 (P2(f2(f1(x101),f2(x102,x101)))),
% 0.20/0.64 inference(scs_inference,[],[1,7])).
% 0.20/0.64 cnf(20,plain,
% 0.20/0.64 (P2(f2(f1(f2(x201,x202)),f2(x202,x201)))),
% 0.20/0.64 inference(scs_inference,[],[3,7])).
% 0.20/0.64 cnf(24,plain,
% 0.20/0.64 (P2(f2(f1(f2(x241,f2(x242,x243))),f2(x242,f2(x241,x243))))),
% 0.20/0.64 inference(scs_inference,[],[4,7])).
% 0.20/0.64 cnf(28,plain,
% 0.20/0.64 (P2(f2(f1(f2(f1(x281),x282)),f2(f1(f2(x283,x281)),f2(x283,x282))))),
% 0.20/0.64 inference(scs_inference,[],[5,7])).
% 0.20/0.64 cnf(34,plain,
% 0.20/0.64 (~P2(f2(f1(f2(f1(a3),a4)),f2(f1(a3),a4)))),
% 0.20/0.64 inference(scs_inference,[],[24,6,8])).
% 0.20/0.64 cnf(40,plain,
% 0.20/0.64 (~P2(f2(f1(a4),a4))),
% 0.20/0.64 inference(scs_inference,[],[28,34,8])).
% 0.20/0.64 cnf(52,plain,
% 0.20/0.64 (~P2(f2(f1(f2(f1(f2(x521,x522)),f2(x522,x521))),f2(f1(a4),a4)))),
% 0.20/0.64 inference(scs_inference,[],[20,40,8])).
% 0.20/0.64 cnf(66,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[52,10,24,8]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.010000s
%------------------------------------------------------------------------------