TSTP Solution File: LCL066-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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:37 EDT 2022
% Result : Unsatisfiable 3.67s 0.79s
% Output : Proof 3.67s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(a,implies(not(a),a)))
| ~ is_a_theorem(implies(implies(a,implies(not(a),a)),implies(a,implies(not(a),b))))
| is_a_theorem(implies(a,implies(not(a),b))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g2,plain,
is_a_theorem(implies(a,implies(not(a),a))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g3,plain,
( ~ is_a_theorem(implies(a,implies(implies(not(a),a),implies(not(a),b))))
| ~ is_a_theorem(implies(implies(a,implies(implies(not(a),a),implies(not(a),b))),implies(implies(a,implies(not(a),a)),implies(a,implies(not(a),b)))))
| is_a_theorem(implies(implies(a,implies(not(a),a)),implies(a,implies(not(a),b)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g4,plain,
is_a_theorem(implies(implies(a,implies(implies(not(a),a),implies(not(a),b))),implies(implies(a,implies(not(a),a)),implies(a,implies(not(a),b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35)]) ).
cnf(g5,plain,
( ~ is_a_theorem(implies(implies(not(a),a),implies(not(a),b)))
| ~ is_a_theorem(implies(implies(implies(not(a),a),implies(not(a),b)),implies(a,implies(implies(not(a),a),implies(not(a),b)))))
| is_a_theorem(implies(a,implies(implies(not(a),a),implies(not(a),b)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g6,plain,
is_a_theorem(implies(implies(implies(not(a),a),implies(not(a),b)),implies(a,implies(implies(not(a),a),implies(not(a),b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g7,plain,
( ~ is_a_theorem(implies(not(a),implies(a,b)))
| ~ is_a_theorem(implies(implies(not(a),implies(a,b)),implies(implies(not(a),a),implies(not(a),b))))
| is_a_theorem(implies(implies(not(a),a),implies(not(a),b))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g8,plain,
is_a_theorem(implies(implies(not(a),implies(a,b)),implies(implies(not(a),a),implies(not(a),b)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35)]) ).
cnf(g9,plain,
( ~ is_a_theorem(implies(not(a),implies(not(b),not(a))))
| ~ is_a_theorem(implies(implies(not(a),implies(not(b),not(a))),implies(not(a),implies(a,b))))
| is_a_theorem(implies(not(a),implies(a,b))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g10,plain,
is_a_theorem(implies(not(a),implies(not(b),not(a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g11,plain,
( ~ is_a_theorem(implies(not(a),implies(implies(not(b),not(a)),implies(a,b))))
| ~ is_a_theorem(implies(implies(not(a),implies(implies(not(b),not(a)),implies(a,b))),implies(implies(not(a),implies(not(b),not(a))),implies(not(a),implies(a,b)))))
| is_a_theorem(implies(implies(not(a),implies(not(b),not(a))),implies(not(a),implies(a,b)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g12,plain,
( ~ is_a_theorem(implies(implies(not(b),not(a)),implies(a,b)))
| ~ is_a_theorem(implies(implies(implies(not(b),not(a)),implies(a,b)),implies(not(a),implies(implies(not(b),not(a)),implies(a,b)))))
| is_a_theorem(implies(not(a),implies(implies(not(b),not(a)),implies(a,b)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g13,plain,
is_a_theorem(implies(implies(not(b),not(a)),implies(a,b))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49)]) ).
cnf(g14,plain,
is_a_theorem(implies(implies(implies(not(b),not(a)),implies(a,b)),implies(not(a),implies(implies(not(b),not(a)),implies(a,b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18)]) ).
cnf(g15,plain,
is_a_theorem(implies(implies(not(a),implies(implies(not(b),not(a)),implies(a,b))),implies(implies(not(a),implies(not(b),not(a))),implies(not(a),implies(a,b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : satcop --statistics %s
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 2 14:05:20 EDT 2022
% 0.11/0.33 % CPUTime :
% 3.67/0.79 % symbols: 7
% 3.67/0.79 % clauses: 5
% 3.67/0.79 % start clauses: 1
% 3.67/0.79 % iterative deepening steps: 2492
% 3.67/0.79 % maximum path limit: 35
% 3.67/0.79 % literal attempts: 100487
% 3.67/0.79 % depth failures: 3649
% 3.67/0.79 % regularity failures: 4463
% 3.67/0.79 % tautology failures: 1000
% 3.67/0.79 % reductions: 0
% 3.67/0.79 % extensions: 98023
% 3.67/0.79 % SAT variables: 86510
% 3.67/0.79 % SAT clauses: 93727
% 3.67/0.79 % WalkSAT solutions: 93725
% 3.67/0.79 % CDCL solutions: 0
% 3.67/0.79 % SZS status Unsatisfiable for theBenchmark
% 3.67/0.79 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------