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

View Problem - Process Solution

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

% Computer : n011.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:37 EDT 2022

% Result   : Theorem 0.19s 0.43s
% Output   : Proof 0.19s
% 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,
    modus_ponens,
    inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_modus_ponens)]) ).

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

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

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

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

cnf(g7,plain,
    r2,
    inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r2)]) ).

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

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

cnf(g10,plain,
    r5,
    inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r5)]) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL490+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 03:30:51 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.43  % symbols: 94
% 0.19/0.43  % clauses: 83
% 0.19/0.43  % start clauses: 1
% 0.19/0.43  % iterative deepening steps: 445
% 0.19/0.43  % maximum path limit: 5
% 0.19/0.43  % literal attempts: 46021
% 0.19/0.43  % depth failures: 27522
% 0.19/0.43  % regularity failures: 2720
% 0.19/0.43  % tautology failures: 2440
% 0.19/0.43  % reductions: 0
% 0.19/0.43  % extensions: 45594
% 0.19/0.43  % SAT variables: 19333
% 0.19/0.43  % SAT clauses: 23571
% 0.19/0.43  % WalkSAT solutions: 23565
% 0.19/0.43  % CDCL solutions: 0
% 0.19/0.43  % SZS status Theorem for theBenchmark
% 0.19/0.43  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------