TSTP Solution File: LCL539+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL539+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:51 EDT 2022
% Result : Theorem 9.65s 1.60s
% Output : Proof 9.65s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ substitution_strict_equiv,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv)]) ).
cnf(g1,plain,
( is_a_theorem(strict_equiv(sK60,sK61))
| substitution_strict_equiv ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',substitution_strict_equiv)]) ).
cnf(g2,plain,
( ~ sPE(sK60,sK61)
| substitution_strict_equiv ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',substitution_strict_equiv)]) ).
cnf(g3,plain,
( ~ is_a_theorem(equiv(sK60,sK61))
| ~ substitution_of_equivalents
| sPE(sK60,sK61) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',substitution_of_equivalents)]) ).
cnf(g4,plain,
( ~ sPE(strict_equiv(sK60,sK61),and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)))
| ~ is_a_theorem(strict_equiv(sK60,sK61))
| is_a_theorem(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_strict_equiv
| sPE(strict_equiv(sK60,sK61),and(strict_implies(sK60,sK61),strict_implies(sK61,sK60))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_equiv)]) ).
cnf(g6,plain,
op_strict_equiv,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv)]) ).
cnf(g7,plain,
( ~ modus_ponens
| ~ is_a_theorem(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)))
| ~ is_a_theorem(implies(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)),strict_implies(sK61,sK60)))
| is_a_theorem(strict_implies(sK61,sK60)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g8,plain,
( ~ and_2
| is_a_theorem(implies(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)),strict_implies(sK61,sK60))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_2)]) ).
cnf(g9,plain,
( ~ modus_ponens
| ~ is_a_theorem(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)))
| ~ is_a_theorem(implies(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)),strict_implies(sK60,sK61)))
| is_a_theorem(strict_implies(sK60,sK61)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g10,plain,
( ~ and_1
| is_a_theorem(implies(and(strict_implies(sK60,sK61),strict_implies(sK61,sK60)),strict_implies(sK60,sK61))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_1)]) ).
cnf(g11,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).
cnf(g12,plain,
axiom_M,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_axiom_M)]) ).
cnf(g13,plain,
( ~ op_strict_implies
| sPE(strict_implies(sK60,sK61),necessarily(implies(sK60,sK61))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g14,plain,
and_2,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_2)]) ).
cnf(g15,plain,
( ~ sPE(strict_implies(sK61,sK60),necessarily(implies(sK61,sK60)))
| ~ is_a_theorem(strict_implies(sK61,sK60))
| is_a_theorem(necessarily(implies(sK61,sK60))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ op_strict_implies
| sPE(strict_implies(sK61,sK60),necessarily(implies(sK61,sK60))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g17,plain,
equivalence_3,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_equivalence_3)]) ).
cnf(g18,plain,
and_1,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_1)]) ).
cnf(g19,plain,
( ~ sPE(strict_implies(sK60,sK61),necessarily(implies(sK60,sK61)))
| ~ is_a_theorem(strict_implies(sK60,sK61))
| is_a_theorem(necessarily(implies(sK60,sK61))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
substitution_of_equivalents,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',substitution_of_equivalents)]) ).
cnf(g21,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK61,sK60))
| ~ is_a_theorem(implies(implies(sK61,sK60),equiv(sK60,sK61)))
| is_a_theorem(equiv(sK60,sK61)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g22,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK60,sK61))
| ~ is_a_theorem(implies(implies(sK60,sK61),implies(implies(sK61,sK60),equiv(sK60,sK61))))
| is_a_theorem(implies(implies(sK61,sK60),equiv(sK60,sK61))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g23,plain,
( ~ equivalence_3
| is_a_theorem(implies(implies(sK60,sK61),implies(implies(sK61,sK60),equiv(sK60,sK61)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',equivalence_3)]) ).
cnf(g24,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g25,plain,
( ~ modus_ponens
| ~ is_a_theorem(necessarily(implies(sK61,sK60)))
| ~ is_a_theorem(implies(necessarily(implies(sK61,sK60)),implies(sK61,sK60)))
| is_a_theorem(implies(sK61,sK60)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g26,plain,
( ~ axiom_M
| is_a_theorem(implies(necessarily(implies(sK61,sK60)),implies(sK61,sK60))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_M)]) ).
cnf(g27,plain,
( ~ modus_ponens
| ~ is_a_theorem(necessarily(implies(sK60,sK61)))
| ~ is_a_theorem(implies(necessarily(implies(sK60,sK61)),implies(sK60,sK61)))
| is_a_theorem(implies(sK60,sK61)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g28,plain,
( ~ axiom_M
| is_a_theorem(implies(necessarily(implies(sK60,sK61)),implies(sK60,sK61))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_M)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL539+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n019.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 : 600
% 0.13/0.34 % DateTime : Mon Jul 4 00:25:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 9.65/1.60 % symbols: 165
% 9.65/1.60 % clauses: 160
% 9.65/1.60 % start clauses: 1
% 9.65/1.60 % iterative deepening steps: 2408
% 9.65/1.60 % maximum path limit: 6
% 9.65/1.60 % literal attempts: 2802191
% 9.65/1.60 % depth failures: 1690948
% 9.65/1.60 % regularity failures: 246600
% 9.65/1.60 % tautology failures: 100950
% 9.65/1.60 % reductions: 223174
% 9.65/1.60 % extensions: 2576901
% 9.65/1.60 % SAT variables: 356226
% 9.65/1.60 % SAT clauses: 406209
% 9.65/1.60 % WalkSAT solutions: 406199
% 9.65/1.60 % CDCL solutions: 9
% 9.65/1.60 % SZS status Theorem for theBenchmark
% 9.65/1.60 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------