TSTP Solution File: LCL531+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% 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 : 600s
% DateTime : Sun Jul 17 14:15:48 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ axiom_m4,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4)]) ).
cnf(g1,plain,
( ~ is_a_theorem(strict_implies(sK83,and(sK83,sK83)))
| axiom_m4 ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m4)]) ).
cnf(g2,plain,
( ~ sPE(necessarily(implies(sK83,and(sK83,sK83))),strict_implies(sK83,and(sK83,sK83)))
| ~ is_a_theorem(necessarily(implies(sK83,and(sK83,sK83))))
| is_a_theorem(strict_implies(sK83,and(sK83,sK83))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(strict_implies(sK83,and(sK83,sK83)),necessarily(implies(sK83,and(sK83,sK83))))
| sPE(necessarily(implies(sK83,and(sK83,sK83))),strict_implies(sK83,and(sK83,sK83))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ op_strict_implies
| sPE(strict_implies(sK83,and(sK83,sK83)),necessarily(implies(sK83,and(sK83,sK83)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g5,plain,
implies_2,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_implies_2)]) ).
cnf(g6,plain,
and_3,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_3)]) ).
cnf(g7,plain,
necessitation,
inference(ground_cnf,[],[file('Axioms/LCL007+2.ax',km5_necessitation)]) ).
cnf(g8,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).
cnf(g9,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g10,plain,
( ~ is_a_theorem(implies(sK83,and(sK83,sK83)))
| ~ necessitation
| is_a_theorem(necessarily(implies(sK83,and(sK83,sK83)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).
cnf(g11,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK83,implies(sK83,and(sK83,sK83))))
| ~ is_a_theorem(implies(implies(sK83,implies(sK83,and(sK83,sK83))),implies(sK83,and(sK83,sK83))))
| is_a_theorem(implies(sK83,and(sK83,sK83))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g12,plain,
( ~ implies_2
| is_a_theorem(implies(implies(sK83,implies(sK83,and(sK83,sK83))),implies(sK83,and(sK83,sK83)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_2)]) ).
cnf(g13,plain,
( ~ and_3
| is_a_theorem(implies(sK83,implies(sK83,and(sK83,sK83)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 18:32:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.50 % symbols: 165
% 0.21/0.50 % clauses: 159
% 0.21/0.50 % start clauses: 1
% 0.21/0.50 % iterative deepening steps: 1040
% 0.21/0.50 % maximum path limit: 5
% 0.21/0.50 % literal attempts: 100873
% 0.21/0.50 % depth failures: 68836
% 0.21/0.50 % regularity failures: 3643
% 0.21/0.50 % tautology failures: 3626
% 0.21/0.50 % reductions: 16
% 0.21/0.50 % extensions: 99886
% 0.21/0.50 % SAT variables: 36114
% 0.21/0.50 % SAT clauses: 39797
% 0.21/0.50 % WalkSAT solutions: 39797
% 0.21/0.50 % CDCL solutions: 0
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------