%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n006.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:20 EDT 2022

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : Proof 0.12s
% 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/sandbox/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/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g2,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/sandbox/benchmark/theBenchmark.p',xgf)]) ).

cnf(g3,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/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g4,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/sandbox/benchmark/theBenchmark.p',xgf)]) ).

cnf(g5,plain,
    is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',xgf)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : LCL013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul  3 21:09:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % symbols: 7
% 0.12/0.34  % clauses: 3
% 0.12/0.34  % start clauses: 1
% 0.12/0.34  % iterative deepening steps: 53
% 0.12/0.34  % maximum path limit: 4
% 0.12/0.34  % literal attempts: 262
% 0.12/0.34  % depth failures: 69
% 0.12/0.34  % regularity failures: 0
% 0.12/0.34  % tautology failures: 0
% 0.12/0.34  % reductions: 0
% 0.12/0.34  % extensions: 211
% 0.12/0.34  % SAT variables: 211
% 0.12/0.34  % SAT clauses: 213
% 0.12/0.34  % WalkSAT solutions: 205
% 0.12/0.34  % CDCL solutions: 0
% 0.12/0.34  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.34  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------