%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n008.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:02 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.35s
% Output : Proof 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_um)]) ).
cnf(g1,plain,
( ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))))
| is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g2,plain,
( ~ is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))))
| ~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))))
| is_a_theorem(equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).
cnf(g3,plain,
is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xgf)]) ).
cnf(g4,plain,
is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xgf)]) ).
cnf(g5,plain,
is_a_theorem(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xgf)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.34 % Computer : n008.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Fri Sep 4 14:01:22 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % symbols: 7
% 0.09/0.35 % clauses: 3
% 0.09/0.35 % start clauses: 1
% 0.09/0.35 % iterative deepening steps: 40
% 0.09/0.35 % maximum path limit: 4
% 0.09/0.35 % literal attempts: 194
% 0.09/0.35 % depth failures: 52
% 0.09/0.35 % regularity failures: 0
% 0.09/0.35 % tautology failures: 0
% 0.09/0.35 % reductions: 0
% 0.09/0.35 % extensions: 156
% 0.09/0.35 % SAT variables: 162
% 0.09/0.35 % SAT clauses: 163
% 0.09/0.35 % WalkSAT solutions: 158
% 0.09/0.35 % CDCL solutions: 0
% 0.09/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------