↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n028.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:13 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    organization(sK1,sK4),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g1,plain,
    organization(sK1,sK5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g2,plain,
    reorganization_free(sK1,sK4,sK5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g3,plain,
    survival_chance(sK1,sK2,sK4),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g4,plain,
    survival_chance(sK1,sK3,sK5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g5,plain,
    greater(sK5,sK4),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g6,plain,
    ~ greater(sK3,sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL)]) ).

cnf(g7,plain,
    ( ~ organization(sK1,sK4)
    | inertia(sK1,sK0(sK1,sK4),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5)]) ).

cnf(g8,plain,
    ( ~ organization(sK1,sK5)
    | inertia(sK1,sK0(sK1,sK5),sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5)]) ).

cnf(g9,plain,
    ( ~ reorganization_free(sK1,sK4,sK5)
    | reorganization_free(sK1,sK5,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4)]) ).

cnf(g10,plain,
    ( ~ reorganization_free(sK1,sK4,sK5)
    | reorganization_free(sK1,sK4,sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4)]) ).

cnf(g11,plain,
    ( ~ reorganization_free(sK1,sK4,sK5)
    | ~ organization(sK1,sK4)
    | ~ organization(sK1,sK5)
    | ~ inertia(sK1,sK0(sK1,sK4),sK4)
    | ~ inertia(sK1,sK0(sK1,sK5),sK5)
    | ~ greater(sK5,sK4)
    | greater(sK0(sK1,sK5),sK0(sK1,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL)]) ).

cnf(g12,plain,
    ( ~ reorganization_free(sK1,sK4,sK4)
    | ~ reorganization_free(sK1,sK5,sK5)
    | ~ organization(sK1,sK4)
    | ~ organization(sK1,sK5)
    | ~ inertia(sK1,sK0(sK1,sK4),sK4)
    | ~ inertia(sK1,sK0(sK1,sK5),sK5)
    | ~ survival_chance(sK1,sK2,sK4)
    | ~ survival_chance(sK1,sK3,sK5)
    | ~ greater(sK0(sK1,sK5),sK0(sK1,sK4))
    | greater(sK3,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT003+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03  % Command  : satcop --statistics %s
% 0.10/0.36  % Computer : n028.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep  7 11:36:31 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % symbols: 13
% 0.10/0.37  % clauses: 12
% 0.10/0.37  % start clauses: 7
% 0.10/0.37  % iterative deepening steps: 61
% 0.10/0.37  % maximum path limit: 2
% 0.10/0.37  % literal attempts: 4164
% 0.10/0.37  % depth failures: 1885
% 0.10/0.37  % regularity failures: 0
% 0.10/0.37  % tautology failures: 118
% 0.10/0.37  % reductions: 509
% 0.10/0.37  % extensions: 3272
% 0.10/0.37  % SAT variables: 598
% 0.10/0.37  % SAT clauses: 1083
% 0.10/0.37  % WalkSAT solutions: 1076
% 0.10/0.37  % CDCL solutions: 0
% 0.10/0.37  % SZS status Theorem for theBenchmark
% 0.10/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------