%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL456+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:25 EDT 2022

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

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

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

cnf(g2,plain,
    modus_ponens,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).

cnf(g3,plain,
    ( ~ or_2
    | is_a_theorem(implies(sK47,or(sK48,sK47))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_2)]) ).

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

cnf(g5,plain,
    or_2,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_or_2)]) ).

cnf(g6,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK48,or(sK48,sK47)))
    | ~ is_a_theorem(implies(implies(sK48,or(sK48,sK47)),implies(or(sK47,sK48),or(sK48,sK47))))
    | is_a_theorem(implies(or(sK47,sK48),or(sK48,sK47))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).

cnf(g7,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK47,or(sK48,sK47)))
    | ~ is_a_theorem(implies(implies(sK47,or(sK48,sK47)),implies(implies(sK48,or(sK48,sK47)),implies(or(sK47,sK48),or(sK48,sK47)))))
    | is_a_theorem(implies(implies(sK48,or(sK48,sK47)),implies(or(sK47,sK48),or(sK48,sK47)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).

cnf(g8,plain,
    ( ~ or_3
    | is_a_theorem(implies(implies(sK47,or(sK48,sK47)),implies(implies(sK48,or(sK48,sK47)),implies(or(sK47,sK48),or(sK48,sK47))))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_3)]) ).

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

cnf(g10,plain,
    or_3,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_or_3)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % 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 : Sun Jul  3 19:12:44 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.41  % symbols: 94
% 0.20/0.41  % clauses: 91
% 0.20/0.41  % start clauses: 1
% 0.20/0.41  % iterative deepening steps: 512
% 0.20/0.41  % maximum path limit: 5
% 0.20/0.41  % literal attempts: 29711
% 0.20/0.41  % depth failures: 18030
% 0.20/0.41  % regularity failures: 1482
% 0.20/0.41  % tautology failures: 1926
% 0.20/0.41  % reductions: 0
% 0.20/0.41  % extensions: 29230
% 0.20/0.41  % SAT variables: 13534
% 0.20/0.41  % SAT clauses: 16230
% 0.20/0.41  % WalkSAT solutions: 16231
% 0.20/0.41  % CDCL solutions: 0
% 0.20/0.41  % SZS status Theorem for theBenchmark
% 0.20/0.41  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------