TSTP Solution File: LCL536+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL536+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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:50 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ axiom_m10,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m10_axiom_m10)]) ).
cnf(g1,plain,
( ~ is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93))))
| axiom_m10 ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m10)]) ).
cnf(g2,plain,
( ~ sPE(necessarily(implies(possibly(sK93),necessarily(possibly(sK93)))),strict_implies(possibly(sK93),necessarily(possibly(sK93))))
| ~ is_a_theorem(necessarily(implies(possibly(sK93),necessarily(possibly(sK93)))))
| is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(strict_implies(possibly(sK93),necessarily(possibly(sK93))),necessarily(implies(possibly(sK93),necessarily(possibly(sK93)))))
| sPE(necessarily(implies(possibly(sK93),necessarily(possibly(sK93)))),strict_implies(possibly(sK93),necessarily(possibly(sK93)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ op_strict_implies
| sPE(strict_implies(possibly(sK93),necessarily(possibly(sK93))),necessarily(implies(possibly(sK93),necessarily(possibly(sK93))))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g5,plain,
necessitation,
inference(ground_cnf,[],[file('Axioms/LCL007+2.ax',km5_necessitation)]) ).
cnf(g6,plain,
axiom_5,
inference(ground_cnf,[],[file('Axioms/LCL007+2.ax',km5_axiom_5)]) ).
cnf(g7,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g8,plain,
( ~ is_a_theorem(implies(possibly(sK93),necessarily(possibly(sK93))))
| ~ necessitation
| is_a_theorem(necessarily(implies(possibly(sK93),necessarily(possibly(sK93))))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).
cnf(g9,plain,
( ~ axiom_5
| is_a_theorem(implies(possibly(sK93),necessarily(possibly(sK93)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_5)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL536+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n025.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 : Mon Jul 4 15:41:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.39 % symbols: 165
% 0.12/0.39 % clauses: 159
% 0.12/0.39 % start clauses: 1
% 0.12/0.39 % iterative deepening steps: 694
% 0.12/0.39 % maximum path limit: 4
% 0.12/0.39 % literal attempts: 62525
% 0.12/0.39 % depth failures: 43382
% 0.12/0.39 % regularity failures: 2015
% 0.12/0.39 % tautology failures: 2138
% 0.12/0.39 % reductions: 3
% 0.12/0.39 % extensions: 61862
% 0.12/0.39 % SAT variables: 25062
% 0.12/0.39 % SAT clauses: 27258
% 0.12/0.39 % WalkSAT solutions: 27257
% 0.12/0.39 % CDCL solutions: 0
% 0.12/0.39 % SZS status Theorem for theBenchmark
% 0.12/0.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------