TSTP Solution File: LCL236-3 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL236-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 : 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:37 EDT 2023
% Result : Unsatisfiable 1.16s 1.23s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL236-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.13/0.34 % Computer : n008.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 : Fri Aug 25 02:12:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 1.16/1.23 %-------------------------------------------
% 1.16/1.23 % File :CSE---1.6
% 1.16/1.23 % Problem :theBenchmark
% 1.16/1.23 % Transform :cnf
% 1.16/1.23 % Format :tptp:raw
% 1.16/1.23 % Command :java -jar mcs_scs.jar %d %s
% 1.16/1.23
% 1.16/1.23 % Result :Theorem 0.620000s
% 1.16/1.23 % Output :CNFRefutation 0.620000s
% 1.16/1.23 %-------------------------------------------
% 1.16/1.23 %--------------------------------------------------------------------------
% 1.16/1.23 % File : LCL236-3 : TPTP v8.1.2. Released v2.3.0.
% 1.16/1.23 % Domain : Logic Calculi (Propositional)
% 1.16/1.23 % Problem : Principia Mathematica 3.14
% 1.16/1.23 % Version : [WR27] axioms.
% 1.16/1.23 % English :
% 1.16/1.23
% 1.16/1.23 % Refs : [WR27] Whitehead & Russell (1927), Principia Mathematica
% 1.16/1.23 % Source : [WR27]
% 1.16/1.23 % Names : Problem 3.14 [WR27]
% 1.16/1.23
% 1.16/1.23 % Status : Unsatisfiable
% 1.16/1.23 % Rating : 0.00 v7.0.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.0.0, 0.33 v5.5.0, 0.25 v5.4.0, 0.27 v5.3.0, 0.17 v5.2.0, 0.25 v5.1.0, 0.14 v4.1.0, 0.22 v4.0.1, 0.00 v3.4.0, 0.17 v3.3.0, 0.29 v3.2.0, 0.00 v2.3.0
% 1.16/1.23 % Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 3 RR)
% 1.16/1.23 % Number of literals : 13 ( 2 equ; 4 neg)
% 1.16/1.23 % Maximal clause size : 3 ( 1 avg)
% 1.16/1.23 % Maximal term depth : 4 ( 2 avg)
% 1.16/1.23 % Number of predicates : 3 ( 2 usr; 0 prp; 1-2 aty)
% 1.16/1.23 % Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% 1.16/1.23 % Number of variables : 18 ( 1 sgn)
% 1.16/1.23 % SPC : CNF_UNS_RFO_SEQ_HRN
% 1.16/1.23
% 1.16/1.23 % Comments :
% 1.16/1.23 %--------------------------------------------------------------------------
% 1.16/1.23 %----Include axioms of propositional logic
% 1.16/1.23 include('Axioms/LCL004-0.ax').
% 1.16/1.23 include('Axioms/LCL004-1.ax').
% 1.16/1.23 %--------------------------------------------------------------------------
% 1.16/1.23 cnf(prove_this,negated_conjecture,
% 1.16/1.23 ~ theorem(implies(or(not(p),not(q)),not(and(p,q)))) ).
% 1.16/1.23
% 1.16/1.23 %--------------------------------------------------------------------------
% 1.16/1.23 %-------------------------------------------
% 1.16/1.23 % Proof found
% 1.16/1.23 % SZS status Theorem for theBenchmark
% 1.16/1.24 % SZS output start Proof
% 1.16/1.24 %ClaNum:8(EqnAxiom:0)
% 1.16/1.24 %VarNum:28(SingletonVarNum:14)
% 1.16/1.24 %MaxLitNum:3
% 1.16/1.24 %MaxfuncDepth:5
% 1.16/1.24 %SharedTerms:9
% 1.16/1.24 %goalClause: 6
% 1.16/1.24 %singleGoalClaCount:1
% 1.16/1.24 [6]~P2(f2(f1(f2(f1(a3),f1(a4))),f1(f1(f2(f1(a3),f1(a4))))))
% 1.16/1.24 [2]P1(f2(f1(f2(x21,x21)),x21))
% 1.16/1.24 [1]P1(f2(f1(x11),f2(x12,x11)))
% 1.16/1.24 [3]P1(f2(f1(f2(x31,x32)),f2(x32,x31)))
% 1.16/1.24 [4]P1(f2(f1(f2(x41,f2(x42,x43))),f2(x42,f2(x41,x43))))
% 1.16/1.24 [5]P1(f2(f1(f2(f1(x51),x52)),f2(f1(f2(x53,x51)),f2(x53,x52))))
% 1.16/1.24 [7]~P1(x71)+P2(x71)
% 1.16/1.24 [8]P2(x81)+~P2(x82)+~P2(f2(f1(x82),x81))
% 1.16/1.24 %EqnAxiom
% 1.16/1.24
% 1.16/1.24 %-------------------------------------------
% 1.16/1.24 cnf(10,plain,
% 1.16/1.24 (P2(f2(f1(x101),f2(x102,x101)))),
% 1.16/1.24 inference(scs_inference,[],[1,7])).
% 1.16/1.24 cnf(25,plain,
% 1.16/1.24 (P2(f2(f1(f2(x251,x252)),f2(x252,x251)))),
% 1.16/1.24 inference(scs_inference,[],[3,7])).
% 1.16/1.24 cnf(35,plain,
% 1.16/1.24 (P2(f2(f1(f2(x351,f2(x352,x353))),f2(x352,f2(x351,x353))))),
% 1.16/1.24 inference(scs_inference,[],[4,7])).
% 1.16/1.24 cnf(39,plain,
% 1.16/1.24 (P2(f2(f1(f2(f1(x391),x392)),f2(f1(f2(x393,x391)),f2(x393,x392))))),
% 1.16/1.24 inference(scs_inference,[],[5,7])).
% 1.16/1.24 cnf(50,plain,
% 1.16/1.24 (~P2(f2(f1(f1(f2(f1(a3),f1(a4)))),f1(f2(f1(a3),f1(a4)))))),
% 1.16/1.24 inference(scs_inference,[],[25,6,8])).
% 1.16/1.24 cnf(160,plain,
% 1.16/1.24 (P2(f2(f1(f2(x1601,x1602)),f2(x1601,f2(x1603,x1602))))),
% 1.16/1.24 inference(scs_inference,[],[10,39,8])).
% 1.16/1.24 cnf(210,plain,
% 1.16/1.24 (P2(f2(f1(f2(x2101,f2(x2102,x2103))),f2(x2104,f2(x2102,f2(x2101,x2103)))))),
% 1.16/1.24 inference(scs_inference,[],[35,160,8])).
% 1.16/1.24 cnf(441,plain,
% 1.16/1.24 (P2(f2(x4411,f2(x4412,f2(f1(x4413),x4413))))),
% 1.16/1.24 inference(scs_inference,[],[10,210,8])).
% 1.16/1.24 cnf(454,plain,
% 1.16/1.24 (P2(f2(x4541,f2(f1(x4542),x4542)))),
% 1.16/1.24 inference(scs_inference,[],[10,441,8])).
% 1.16/1.24 cnf(461,plain,
% 1.16/1.24 ($false),
% 1.16/1.24 inference(scs_inference,[],[10,454,50,8]),
% 1.16/1.24 ['proof']).
% 1.16/1.24 % SZS output end Proof
% 1.16/1.24 % Total time :0.620000s
%------------------------------------------------------------------------------