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

% Computer : n013.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:30 EDT 2022

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

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

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

cnf(g2,plain,
    cn2,
    inference(ground_cnf,[],[file('Axioms/LCL006+3.ax',luka_cn2)]) ).

cnf(g3,plain,
    sPE(sK19,sK19),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    op_implies_and,
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and)]) ).

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

cnf(g6,plain,
    ( ~ sPE(implies(sK19,not(and(not(sK19),not(sK20)))),implies(sK19,or(sK19,sK20)))
    | ~ is_a_theorem(implies(sK19,not(and(not(sK19),not(sK20)))))
    | is_a_theorem(implies(sK19,or(sK19,sK20))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(implies(sK19,or(sK19,sK20)),implies(sK19,not(and(not(sK19),not(sK20)))))
    | sPE(implies(sK19,not(and(not(sK19),not(sK20)))),implies(sK19,or(sK19,sK20))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(sK19,sK19)
    | ~ sPE(or(sK19,sK20),not(and(not(sK19),not(sK20))))
    | sPE(implies(sK19,or(sK19,sK20)),implies(sK19,not(and(not(sK19),not(sK20))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g11,plain,
    ( ~ sPE(sK19,sK19)
    | ~ sPE(implies(not(sK19),sK20),not(and(not(sK19),not(sK20))))
    | sPE(implies(sK19,implies(not(sK19),sK20)),implies(sK19,not(and(not(sK19),not(sK20))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : LCL469+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14  % Command  : satcop --statistics %s
% 0.14/0.35  % Computer : n013.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 02:02:44 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.40  % symbols: 95
% 0.20/0.40  % clauses: 81
% 0.20/0.40  % start clauses: 1
% 0.20/0.40  % iterative deepening steps: 289
% 0.20/0.40  % maximum path limit: 5
% 0.20/0.40  % literal attempts: 21748
% 0.20/0.40  % depth failures: 14002
% 0.20/0.40  % regularity failures: 1013
% 0.20/0.40  % tautology failures: 969
% 0.20/0.40  % reductions: 3
% 0.20/0.40  % extensions: 21465
% 0.20/0.40  % SAT variables: 10373
% 0.20/0.40  % SAT clauses: 11936
% 0.20/0.40  % WalkSAT solutions: 11933
% 0.20/0.40  % CDCL solutions: 0
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------