↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:19:30 AM UTC 2026

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

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

cnf(g1,plain,
    ( ~ less(v0,v600)
    | ~ leq(v600,v600)
    | in_lopen(v600,v0,v600) ),
    inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',in_lopen)]) ).

cnf(g2,plain,
    sPE(v600,v600),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    less(v0,v600),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600)]) ).

cnf(g4,plain,
    ( ~ sPE(v600,v600)
    | leq(v600,v600) ),
    inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',leq_def)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep  7 14:20:56 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.14/0.37  % symbols: 23
% 0.14/0.37  % clauses: 73
% 0.14/0.37  % start clauses: 1
% 0.14/0.37  % iterative deepening steps: 38
% 0.14/0.37  % maximum path limit: 2
% 0.14/0.37  % literal attempts: 484
% 0.14/0.37  % depth failures: 362
% 0.14/0.37  % regularity failures: 5
% 0.14/0.37  % tautology failures: 13
% 0.14/0.37  % reductions: 0
% 0.14/0.37  % extensions: 450
% 0.14/0.37  % SAT variables: 197
% 0.14/0.37  % SAT clauses: 284
% 0.14/0.37  % WalkSAT solutions: 277
% 0.14/0.37  % CDCL solutions: 0
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------