↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n001.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:18 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,
    environment(sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l5)]) ).

cnf(g1,plain,
    stable(sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l5)]) ).

cnf(g2,plain,
    ~ in_environment(sK2,critical_point(sK2)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l5)]) ).

cnf(g3,plain,
    ( ~ environment(sK2)
    | ~ stable(sK2)
    | in_environment(sK2,sK1(sK2)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12)]) ).

cnf(g4,plain,
    ( ~ environment(sK2)
    | ~ greater(growth_rate(efficient_producers,sK1(sK2)),growth_rate(first_movers,sK1(sK2)))
    | ~ stable(sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12)]) ).

cnf(g5,plain,
    ( ~ environment(sK2)
    | ~ greater(sK0(sK2,sK1(sK2)),sK1(sK2))
    | ~ subpopulations(first_movers,efficient_producers,sK2,sK0(sK2,sK1(sK2)))
    | ~ stable(sK2)
    | greater(growth_rate(efficient_producers,sK0(sK2,sK1(sK2))),growth_rate(first_movers,sK0(sK2,sK1(sK2)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12)]) ).

cnf(g6,plain,
    ( ~ environment(sK2)
    | ~ in_environment(sK2,sK1(sK2))
    | sPE(sK1(sK2),critical_point(sK2))
    | greater(growth_rate(efficient_producers,sK1(sK2)),growth_rate(first_movers,sK1(sK2)))
    | greater(sK0(sK2,sK1(sK2)),sK1(sK2)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1)]) ).

cnf(g7,plain,
    ( ~ environment(sK2)
    | ~ in_environment(sK2,sK1(sK2))
    | sPE(sK1(sK2),critical_point(sK2))
    | greater(growth_rate(efficient_producers,sK1(sK2)),growth_rate(first_movers,sK1(sK2)))
    | subpopulations(first_movers,efficient_producers,sK2,sK0(sK2,sK1(sK2))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1)]) ).

cnf(g8,plain,
    ( ~ environment(sK2)
    | ~ greater(growth_rate(efficient_producers,sK0(sK2,sK1(sK2))),growth_rate(first_movers,sK0(sK2,sK1(sK2))))
    | ~ in_environment(sK2,sK1(sK2))
    | sPE(sK1(sK2),critical_point(sK2))
    | greater(growth_rate(efficient_producers,sK1(sK2)),growth_rate(first_movers,sK1(sK2))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1)]) ).

cnf(g9,plain,
    ( ~ sPE(sK2,sK2)
    | ~ sPE(sK1(sK2),critical_point(sK2))
    | ~ in_environment(sK2,sK1(sK2))
    | in_environment(sK2,critical_point(sK2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    sPE(sK2,sK2),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT023+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.10/0.36  % Computer : n001.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 12:10:52 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % symbols: 14
% 0.10/0.37  % clauses: 21
% 0.10/0.37  % start clauses: 3
% 0.10/0.37  % iterative deepening steps: 31
% 0.10/0.37  % maximum path limit: 2
% 0.10/0.37  % literal attempts: 1800
% 0.10/0.37  % depth failures: 1212
% 0.10/0.37  % regularity failures: 0
% 0.10/0.37  % tautology failures: 18
% 0.10/0.37  % reductions: 262
% 0.10/0.37  % extensions: 1446
% 0.10/0.37  % SAT variables: 663
% 0.10/0.37  % SAT clauses: 513
% 0.10/0.37  % WalkSAT solutions: 505
% 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
%------------------------------------------------------------------------------