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

% Computer : n020.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:34 EDT 2022

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

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

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

cnf(g2,plain,
    r3,
    inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r3)]) ).

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

cnf(g4,plain,
    ( ~ r3
    | is_a_theorem(implies(or(sK5,not(sK4)),or(not(sK4),sK5))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r3)]) ).

cnf(g5,plain,
    ( ~ op_implies_or
    | sPE(implies(sK4,sK5),or(not(sK4),sK5)) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).

cnf(g6,plain,
    ( ~ sPE(implies(sK4,sK5),or(not(sK4),sK5))
    | sPE(or(not(sK4),sK5),implies(sK4,sK5)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g9,plain,
    op_implies_or,
    inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_implies_or)]) ).

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

cnf(g11,plain,
    ( ~ sPE(implies(not(and(not(sK5),not(not(sK4)))),or(not(sK4),sK5)),implies(implies(not(sK5),not(sK4)),implies(sK4,sK5)))
    | ~ is_a_theorem(implies(not(and(not(sK5),not(not(sK4)))),or(not(sK4),sK5)))
    | is_a_theorem(implies(implies(not(sK5),not(sK4)),implies(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g13,plain,
    sPE(or(not(sK4),sK5),or(not(sK4),sK5)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(implies(or(sK5,not(sK4)),or(not(sK4),sK5)),implies(not(and(not(sK5),not(not(sK4)))),or(not(sK4),sK5)))
    | ~ is_a_theorem(implies(or(sK5,not(sK4)),or(not(sK4),sK5)))
    | is_a_theorem(implies(not(and(not(sK5),not(not(sK4)))),or(not(sK4),sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(or(sK5,not(sK4)),not(and(not(sK5),not(not(sK4)))))
    | ~ sPE(or(not(sK4),sK5),or(not(sK4),sK5))
    | sPE(implies(or(sK5,not(sK4)),or(not(sK4),sK5)),implies(not(and(not(sK5),not(not(sK4)))),or(not(sK4),sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 01:00:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.40  % symbols: 94
% 0.19/0.40  % clauses: 83
% 0.19/0.40  % start clauses: 1
% 0.19/0.40  % iterative deepening steps: 494
% 0.19/0.40  % maximum path limit: 5
% 0.19/0.40  % literal attempts: 52010
% 0.19/0.40  % depth failures: 30995
% 0.19/0.40  % regularity failures: 3106
% 0.19/0.40  % tautology failures: 2322
% 0.19/0.40  % reductions: 0
% 0.19/0.40  % extensions: 51555
% 0.19/0.40  % SAT variables: 23315
% 0.19/0.40  % SAT clauses: 28084
% 0.19/0.40  % WalkSAT solutions: 28084
% 0.19/0.40  % CDCL solutions: 0
% 0.19/0.40  % SZS status Theorem for theBenchmark
% 0.19/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------