%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL398-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:03:44 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : Proof 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ is_a_theorem(implies(not(implies(x,x)),y)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_64)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(x,x))
| ~ is_a_theorem(implies(implies(x,x),implies(not(implies(x,x)),y)))
| is_a_theorem(implies(not(implies(x,x)),y)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g2,plain,
is_a_theorem(implies(implies(x,x),implies(not(implies(x,x)),y))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3)]) ).
cnf(g3,plain,
is_a_theorem(implies(x,implies(not(x),x))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3)]) ).
cnf(g4,plain,
is_a_theorem(implies(implies(not(x),x),x)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2)]) ).
cnf(g5,plain,
( ~ is_a_theorem(implies(x,implies(not(x),x)))
| ~ is_a_theorem(implies(implies(x,implies(not(x),x)),implies(implies(implies(not(x),x),x),implies(x,x))))
| is_a_theorem(implies(implies(implies(not(x),x),x),implies(x,x))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g6,plain,
is_a_theorem(implies(implies(x,implies(not(x),x)),implies(implies(implies(not(x),x),x),implies(x,x)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1)]) ).
cnf(g7,plain,
( ~ is_a_theorem(implies(implies(not(x),x),x))
| ~ is_a_theorem(implies(implies(implies(not(x),x),x),implies(x,x)))
| is_a_theorem(implies(x,x)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL398-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 4 17:47:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % symbols: 7
% 0.09/0.37 % clauses: 5
% 0.09/0.37 % start clauses: 1
% 0.09/0.37 % iterative deepening steps: 180
% 0.09/0.37 % maximum path limit: 5
% 0.09/0.37 % literal attempts: 1276
% 0.09/0.37 % depth failures: 228
% 0.09/0.37 % regularity failures: 16
% 0.09/0.37 % tautology failures: 0
% 0.09/0.37 % reductions: 0
% 0.09/0.37 % extensions: 1103
% 0.09/0.37 % SAT variables: 880
% 0.09/0.37 % SAT clauses: 903
% 0.09/0.37 % WalkSAT solutions: 899
% 0.09/0.37 % CDCL solutions: 0
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------