TSTP Solution File: LCL542+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n004.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:52 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ axiom_m2,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2)]) ).
cnf(g1,plain,
( ~ is_a_theorem(strict_implies(and(sK78,sK79),sK78))
| axiom_m2 ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m2)]) ).
cnf(g2,plain,
and_1,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_1)]) ).
cnf(g3,plain,
( ~ sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78))
| ~ is_a_theorem(necessarily(implies(and(sK78,sK79),sK78)))
| is_a_theorem(strict_implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78)))
| sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_strict_implies
| sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g6,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g7,plain,
necessitation,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_necessitation)]) ).
cnf(g8,plain,
( ~ is_a_theorem(implies(and(sK78,sK79),sK78))
| ~ necessitation
| is_a_theorem(necessarily(implies(and(sK78,sK79),sK78))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).
cnf(g9,plain,
( ~ and_1
| is_a_theorem(implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 16:36:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.39 % symbols: 165
% 0.19/0.39 % clauses: 160
% 0.19/0.39 % start clauses: 1
% 0.19/0.39 % iterative deepening steps: 372
% 0.19/0.39 % maximum path limit: 4
% 0.19/0.39 % literal attempts: 30840
% 0.19/0.39 % depth failures: 21442
% 0.19/0.39 % regularity failures: 1481
% 0.19/0.39 % tautology failures: 1007
% 0.19/0.39 % reductions: 36
% 0.19/0.39 % extensions: 30435
% 0.19/0.39 % SAT variables: 15353
% 0.19/0.39 % SAT clauses: 16487
% 0.19/0.39 % WalkSAT solutions: 16482
% 0.19/0.39 % CDCL solutions: 0
% 0.19/0.39 % SZS status Theorem for theBenchmark
% 0.19/0.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------