TSTP Solution File: LCL459+1 by SATCoP---0.1

View Problem - Process Solution

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

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

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

cnf(g1,plain,
    ( ~ is_a_theorem(implies(sK32,and(sK32,sK32)))
    | kn1 ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',kn1)]) ).

cnf(g2,plain,
    ( ~ and_3
    | is_a_theorem(implies(sK32,implies(sK32,and(sK32,sK32)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_3)]) ).

cnf(g3,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK32,implies(sK32,and(sK32,sK32))))
    | ~ is_a_theorem(implies(implies(sK32,implies(sK32,and(sK32,sK32))),implies(sK32,and(sK32,sK32))))
    | is_a_theorem(implies(sK32,and(sK32,sK32))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).

cnf(g4,plain,
    ( ~ implies_2
    | is_a_theorem(implies(implies(sK32,implies(sK32,and(sK32,sK32))),implies(sK32,and(sK32,sK32)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_2)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Sat Jul  2 16:43:00 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % symbols: 94
% 0.13/0.35  % clauses: 91
% 0.13/0.35  % start clauses: 1
% 0.13/0.35  % iterative deepening steps: 80
% 0.13/0.35  % maximum path limit: 4
% 0.13/0.35  % literal attempts: 1921
% 0.13/0.35  % depth failures: 1369
% 0.13/0.35  % regularity failures: 104
% 0.13/0.35  % tautology failures: 63
% 0.13/0.35  % reductions: 0
% 0.13/0.35  % extensions: 1895
% 0.13/0.35  % SAT variables: 1538
% 0.13/0.35  % SAT clauses: 1488
% 0.13/0.35  % WalkSAT solutions: 1488
% 0.13/0.35  % CDCL solutions: 0
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------