%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n011.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:14:56 EDT 2022

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

cnf(g3,plain,
    is_a_theorem(implies(x,implies(not(x),x))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3)]) ).

cnf(g4,plain,
    is_a_theorem(implies(implies(not(x),x),x)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n011.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 : Sat Jul  2 23:06:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % symbols: 7
% 0.12/0.35  % clauses: 5
% 0.12/0.35  % start clauses: 1
% 0.12/0.35  % iterative deepening steps: 203
% 0.12/0.35  % maximum path limit: 6
% 0.12/0.35  % literal attempts: 1647
% 0.12/0.35  % depth failures: 271
% 0.12/0.35  % regularity failures: 20
% 0.12/0.35  % tautology failures: 0
% 0.12/0.35  % reductions: 0
% 0.12/0.35  % extensions: 1448
% 0.12/0.35  % SAT variables: 1111
% 0.12/0.35  % SAT clauses: 1150
% 0.12/0.35  % WalkSAT solutions: 1144
% 0.12/0.35  % CDCL solutions: 0
% 0.12/0.35  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------