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

% Computer : n029.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:15:23 EDT 2022

% Result   : Theorem 0.14s 0.40s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ cn2,
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2)]) ).

cnf(g1,plain,
    ( ~ is_a_theorem(implies(sK41,implies(not(sK41),sK42)))
    | cn2 ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',cn2)]) ).

cnf(g2,plain,
    sPE(sK41,sK41),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    or_1,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_or_1)]) ).

cnf(g4,plain,
    ( ~ sPE(implies(sK41,not(and(not(sK41),not(sK42)))),implies(sK41,implies(not(sK41),sK42)))
    | ~ is_a_theorem(implies(sK41,not(and(not(sK41),not(sK42)))))
    | is_a_theorem(implies(sK41,implies(not(sK41),sK42))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ op_implies_and
    | sPE(implies(not(sK41),sK42),not(and(not(sK41),not(sK42)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_and)]) ).

cnf(g6,plain,
    op_implies_and,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_op_implies_and)]) ).

cnf(g7,plain,
    ( ~ sPE(implies(sK41,implies(not(sK41),sK42)),implies(sK41,not(and(not(sK41),not(sK42)))))
    | sPE(implies(sK41,not(and(not(sK41),not(sK42)))),implies(sK41,implies(not(sK41),sK42))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(sK41,sK41)
    | ~ sPE(implies(not(sK41),sK42),not(and(not(sK41),not(sK42))))
    | sPE(implies(sK41,implies(not(sK41),sK42)),implies(sK41,not(and(not(sK41),not(sK42))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    op_or,
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or)]) ).

cnf(g10,plain,
    ( ~ sPE(implies(sK41,or(sK41,sK42)),implies(sK41,not(and(not(sK41),not(sK42)))))
    | ~ is_a_theorem(implies(sK41,or(sK41,sK42)))
    | is_a_theorem(implies(sK41,not(and(not(sK41),not(sK42))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ or_1
    | is_a_theorem(implies(sK41,or(sK41,sK42))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_1)]) ).

cnf(g12,plain,
    ( ~ sPE(sK41,sK41)
    | ~ sPE(or(sK41,sK42),not(and(not(sK41),not(sK42))))
    | sPE(implies(sK41,or(sK41,sK42)),implies(sK41,not(and(not(sK41),not(sK42))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ op_or
    | sPE(or(sK41,sK42),not(and(not(sK41),not(sK42)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_or)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL452+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14  % Command  : satcop --statistics %s
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul  4 23:48:27 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.40  % symbols: 95
% 0.14/0.40  % clauses: 91
% 0.14/0.40  % start clauses: 1
% 0.14/0.40  % iterative deepening steps: 539
% 0.14/0.40  % maximum path limit: 5
% 0.14/0.40  % literal attempts: 24639
% 0.14/0.40  % depth failures: 15246
% 0.14/0.40  % regularity failures: 1225
% 0.14/0.40  % tautology failures: 1652
% 0.14/0.40  % reductions: 0
% 0.14/0.40  % extensions: 24106
% 0.14/0.40  % SAT variables: 9183
% 0.14/0.40  % SAT clauses: 10621
% 0.14/0.40  % WalkSAT solutions: 10615
% 0.14/0.40  % CDCL solutions: 0
% 0.14/0.40  % SZS status Theorem for theBenchmark
% 0.14/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------