TSTP Solution File: LCL076-3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL076-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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:40 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40)]) ).
cnf(g1,plain,
is_a_theorem(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35)]) ).
cnf(g2,plain,
is_a_theorem(implies(a,implies(a,a))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g3,plain,
is_a_theorem(implies(implies(not(not(not(a))),not(a)),implies(a,not(not(a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g4,plain,
( ~ is_a_theorem(implies(a,implies(a,a)))
| ~ is_a_theorem(implies(implies(a,implies(a,a)),implies(a,not(not(a)))))
| is_a_theorem(implies(a,not(not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g5,plain,
( ~ is_a_theorem(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))))
| ~ is_a_theorem(implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),not(a))))
| is_a_theorem(implies(not(not(not(a))),not(a))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g6,plain,
( ~ is_a_theorem(implies(implies(a,implies(a,a)),implies(not(not(not(a))),not(a))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),not(a)),implies(a,not(not(a)))))
| is_a_theorem(implies(implies(a,implies(a,a)),implies(a,not(not(a))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g7,plain,
( ~ is_a_theorem(implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a)))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(not(not(not(a))),not(a))))
| is_a_theorem(implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g8,plain,
( ~ is_a_theorem(implies(a,implies(a,a)))
| ~ is_a_theorem(implies(implies(a,implies(a,a)),implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a))))))
| is_a_theorem(implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g9,plain,
( ~ is_a_theorem(implies(implies(a,implies(a,a)),implies(not(not(not(a))),implies(a,implies(a,a)))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a))))))
| is_a_theorem(implies(implies(a,implies(a,a)),implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a)))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g10,plain,
is_a_theorem(implies(implies(a,implies(a,a)),implies(not(not(not(a))),implies(a,implies(a,a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g11,plain,
is_a_theorem(implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(implies(implies(a,implies(a,a)),implies(implies(a,a),implies(a,a))),implies(not(not(not(a))),implies(a,implies(a,a)))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g12,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(implies(a,implies(a,a)),not(a))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),implies(implies(a,implies(a,a)),not(a))),implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(not(not(not(a))),not(a)))))
| is_a_theorem(implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(not(not(not(a))),not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g13,plain,
is_a_theorem(implies(implies(not(not(not(a))),implies(implies(a,implies(a,a)),not(a))),implies(implies(not(not(not(a))),implies(a,implies(a,a))),implies(not(not(not(a))),not(a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35)]) ).
cnf(g14,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(not(not(a)),not(implies(a,implies(a,a))))))
| ~ is_a_theorem(implies(implies(not(not(a)),not(implies(a,implies(a,a)))),implies(implies(a,implies(a,a)),not(a))))
| is_a_theorem(implies(not(not(not(a))),implies(implies(a,implies(a,a)),not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g15,plain,
is_a_theorem(implies(implies(not(not(a)),not(implies(a,implies(a,a)))),implies(implies(a,implies(a,a)),not(a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g16,plain,
is_a_theorem(implies(implies(not(not(not(a))),not(a)),implies(implies(a,implies(a,a)),implies(not(not(not(a))),not(a))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g17,plain,
( ~ is_a_theorem(implies(not(not(not(a))),not(a)))
| ~ is_a_theorem(implies(implies(not(not(not(a))),not(a)),implies(implies(a,implies(a,a)),implies(not(not(not(a))),not(a)))))
| is_a_theorem(implies(implies(a,implies(a,a)),implies(not(not(not(a))),not(a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g18,plain,
is_a_theorem(implies(implies(not(not(implies(a,implies(a,a)))),not(not(not(a)))),implies(not(not(a)),not(implies(a,implies(a,a)))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g19,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(not(not(implies(a,implies(a,a)))),not(not(not(a))))))
| ~ is_a_theorem(implies(implies(not(not(implies(a,implies(a,a)))),not(not(not(a)))),implies(not(not(a)),not(implies(a,implies(a,a))))))
| is_a_theorem(implies(not(not(not(a))),implies(not(not(a)),not(implies(a,implies(a,a)))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity)]) ).
cnf(g20,plain,
is_a_theorem(implies(not(not(not(a))),implies(not(not(implies(a,implies(a,a)))),not(not(not(a)))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL076-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 01:49:25 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.51 % symbols: 6
% 0.20/0.51 % clauses: 6
% 0.20/0.51 % start clauses: 1
% 0.20/0.51 % iterative deepening steps: 1141
% 0.20/0.51 % maximum path limit: 16
% 0.20/0.51 % literal attempts: 65728
% 0.20/0.51 % depth failures: 21352
% 0.20/0.51 % regularity failures: 765
% 0.20/0.51 % tautology failures: 256
% 0.20/0.51 % reductions: 0
% 0.20/0.51 % extensions: 65283
% 0.20/0.51 % SAT variables: 35915
% 0.20/0.51 % SAT clauses: 47437
% 0.20/0.51 % WalkSAT solutions: 47436
% 0.20/0.51 % CDCL solutions: 0
% 0.20/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------