↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : MGT071+1 : TPTP v9.3.0. Released v9.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   : 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.08s 0.36s
% Output   : Proof 0.08s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    in_closed(sK3,n0,n5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_false_conflict)]) ).

cnf(g1,plain,
    in_closed(sK3,n10,n15),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_false_conflict)]) ).

cnf(g2,plain,
    ( ~ in_closed(sK3,n0,n5)
    | ~ in_closed(sK3,n10,n15)
    | ~ axis_conflict(n0,n5,n10,n15) ),
    inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',axis_conflict_def)]) ).

cnf(g3,plain,
    axis_conflict(n0,n5,n10,n15),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conflict_hyp)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT071+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n011.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep  7 13:54:30 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % symbols: 28
% 0.08/0.36  % clauses: 99
% 0.08/0.36  % start clauses: 2
% 0.08/0.36  % iterative deepening steps: 12
% 0.08/0.36  % maximum path limit: 1
% 0.08/0.36  % literal attempts: 478
% 0.08/0.36  % depth failures: 279
% 0.08/0.36  % regularity failures: 6
% 0.08/0.36  % tautology failures: 1
% 0.08/0.36  % reductions: 168
% 0.08/0.36  % extensions: 309
% 0.08/0.36  % SAT variables: 239
% 0.08/0.36  % SAT clauses: 226
% 0.08/0.36  % WalkSAT solutions: 224
% 0.08/0.36  % CDCL solutions: 0
% 0.08/0.36  % SZS status Theorem for theBenchmark
% 0.08/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------