TSTP Solution File: LCL077-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n013.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:12:41 EDT 2022
% Result : Unsatisfiable 0.21s 0.38s
% Output : Proof 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(not(not(a)),implies(not(not(implies(not(a),not(a)))),not(not(a)))))
| ~ is_a_theorem(implies(implies(not(not(implies(not(a),not(a)))),not(not(a))),a))
| is_a_theorem(implies(not(not(a)),a)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g2,plain,
is_a_theorem(implies(not(not(a)),implies(not(not(implies(not(a),not(a)))),not(not(a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g3,plain,
( ~ is_a_theorem(implies(implies(not(not(implies(not(a),not(a)))),not(not(a))),implies(not(a),not(implies(not(a),not(a))))))
| ~ is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),a))
| is_a_theorem(implies(implies(not(not(implies(not(a),not(a)))),not(not(a))),a)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g4,plain,
is_a_theorem(implies(implies(not(not(implies(not(a),not(a)))),not(not(a))),implies(not(a),not(implies(not(a),not(a)))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g5,plain,
( ~ is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))))
| ~ is_a_theorem(implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),a)))
| is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),a)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g6,plain,
( ~ is_a_theorem(implies(not(a),implies(not(implies(not(a),not(a))),not(a))))
| ~ is_a_theorem(implies(implies(not(a),implies(not(implies(not(a),not(a))),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a)))))
| is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g7,plain,
is_a_theorem(implies(not(a),implies(not(implies(not(a),not(a))),not(a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g8,plain,
is_a_theorem(implies(implies(not(a),implies(not(implies(not(a),not(a))),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35)]) ).
cnf(g9,plain,
( ~ is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),implies(implies(not(a),not(a)),a)))
| ~ is_a_theorem(implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(implies(not(a),not(a)),a)),implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),a))))
| is_a_theorem(implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),a))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g10,plain,
is_a_theorem(implies(implies(not(a),not(implies(not(a),not(a)))),implies(implies(not(a),not(a)),a))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g11,plain,
is_a_theorem(implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(implies(not(a),not(a)),a)),implies(implies(implies(not(a),not(implies(not(a),not(a)))),implies(not(a),not(a))),implies(implies(not(a),not(implies(not(a),not(a)))),a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 10:58:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.38 % symbols: 6
% 0.21/0.38 % clauses: 6
% 0.21/0.38 % start clauses: 1
% 0.21/0.38 % iterative deepening steps: 589
% 0.21/0.38 % maximum path limit: 7
% 0.21/0.38 % literal attempts: 21539
% 0.21/0.38 % depth failures: 8304
% 0.21/0.38 % regularity failures: 229
% 0.21/0.38 % tautology failures: 14
% 0.21/0.38 % reductions: 0
% 0.21/0.38 % extensions: 21106
% 0.21/0.38 % SAT variables: 9299
% 0.21/0.38 % SAT clauses: 12502
% 0.21/0.38 % WalkSAT solutions: 12502
% 0.21/0.38 % CDCL solutions: 0
% 0.21/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.38 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------