↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n018.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:29 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( ~ leq(ninf,nsup)
    | ~ leq(ninf,ninf)
    | ~ completion_compatible(ninf,ninf,nsup) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown_sound_compatible)]) ).

cnf(g1,plain,
    ( ~ leq(ninf,nsup)
    | ~ leq(ninf,ninf)
    | completion_compatible(ninf,ninf,nsup) ),
    inference(ground_cnf,[],[file('Axioms/MGT002+4.ax',completion_compat)]) ).

cnf(g2,plain,
    leq(ninf,nsup),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb)]) ).

cnf(g3,plain,
    leq(ninf,ninf),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03  % Command  : satcop --statistics %s
% 0.07/0.35  % Computer : n018.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep  7 13:55:22 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.12/0.36  % symbols: 25
% 0.12/0.36  % clauses: 79
% 0.12/0.36  % start clauses: 1
% 0.12/0.36  % iterative deepening steps: 9
% 0.12/0.36  % maximum path limit: 1
% 0.12/0.36  % literal attempts: 65
% 0.12/0.36  % depth failures: 42
% 0.12/0.36  % regularity failures: 0
% 0.12/0.36  % tautology failures: 0
% 0.12/0.36  % reductions: 0
% 0.12/0.36  % extensions: 57
% 0.12/0.36  % SAT variables: 68
% 0.12/0.36  % SAT clauses: 73
% 0.12/0.36  % WalkSAT solutions: 66
% 0.12/0.36  % CDCL solutions: 0
% 0.12/0.36  % SZS status Theorem for theBenchmark
% 0.12/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------