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

View Problem - Process Solution

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

% Computer : n017.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 : Mon Jul 18 16:38:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    r1(sK13(sG)),
    inference(ground_cnf,[],[file('Axioms/NUM009+0.ax',axiom_4a)]) ).

cnf(g1,plain,
    ( ~ id(sK10(sG,sK13(sG)),sK10(sG,sK13(sG)))
    | ~ r1(sK13(sG))
    | ~ r2(sK13(sG),sK10(sG,sK13(sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneidone)]) ).

cnf(g2,plain,
    r2(sK13(sG),sK10(sG,sK13(sG))),
    inference(ground_cnf,[],[file('Axioms/NUM009+0.ax',axiom_2a)]) ).

cnf(g3,plain,
    id(sK10(sG,sK13(sG)),sK10(sG,sK13(sG))),
    inference(ground_cnf,[],[file('Axioms/NUM009+0.ax',axiom_5)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN069+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  2 10:03:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % symbols: 36
% 0.12/0.34  % clauses: 59
% 0.12/0.34  % start clauses: 1
% 0.12/0.34  % iterative deepening steps: 18
% 0.12/0.34  % maximum path limit: 1
% 0.12/0.34  % literal attempts: 91
% 0.12/0.34  % depth failures: 41
% 0.12/0.34  % regularity failures: 0
% 0.12/0.34  % tautology failures: 7
% 0.12/0.34  % reductions: 0
% 0.12/0.34  % extensions: 86
% 0.12/0.34  % SAT variables: 150
% 0.12/0.34  % SAT clauses: 140
% 0.12/0.34  % WalkSAT solutions: 136
% 0.12/0.34  % CDCL solutions: 0
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------