TSTP Solution File: NUM490+3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM490+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n014.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 14:01:16 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),sdtasdt0(xn,xm)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__)]) ).

cnf(g1,plain,
    ( ~ sPE(sdtasdt0(xn,xm),sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)))
    | sPE(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),sdtasdt0(xn,xm)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(sdtasdt0(xn,xm),sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1951)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : satcop --statistics %s
% 0.12/0.32  % Computer : n014.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jul  7 19:26:21 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.12/0.32  % symbols: 31
% 0.12/0.32  % clauses: 131
% 0.12/0.32  % start clauses: 2
% 0.12/0.32  % iterative deepening steps: 24
% 0.12/0.32  % maximum path limit: 1
% 0.12/0.32  % literal attempts: 1310
% 0.12/0.32  % depth failures: 1184
% 0.12/0.32  % regularity failures: 9
% 0.12/0.32  % tautology failures: 3
% 0.12/0.32  % reductions: 0
% 0.12/0.32  % extensions: 1309
% 0.12/0.32  % SAT variables: 899
% 0.12/0.32  % SAT clauses: 797
% 0.12/0.32  % WalkSAT solutions: 792
% 0.12/0.32  % CDCL solutions: 0
% 0.12/0.32  % SZS status Theorem for theBenchmark
% 0.12/0.32  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------