↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT036-3 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n008.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 : Fri Sep 25 02:11:46 PM UTC 2026

% Result   : Unsatisfiable 4.01s 0.93s
% Output   : Proof 4.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   38 (  26 unt;   0 def)
%            Number of atoms       :   70 (  13 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   70 (  38   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-4 aty)
%            Number of variables   :   50 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( subpopulations(C,B,A,D)
    | ~ subpopulations(B,C,A,D)
    | ~ environment(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).

fof(f0_nnf,plain,
    ! [A,B,C,D] :
      ( subpopulations(C,B,A,D)
      | ~ subpopulations(B,C,A,D)
      | ~ environment(A) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B,C,D] :
      ( subpopulations(C,B,A,D)
      | ~ subpopulations(B,C,A,D)
      | ~ environment(A) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( subpopulations(X2,X1,X0,X3)
    | ~ subpopulations(X1,X2,X0,X3)
    | ~ environment(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(environment(X0),true,ifeq(subpopulations(X1,X2,X0,X3),true,subpopulations(X2,X1,X0,X3),true),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(f4,hypothesis,
    environment(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_5) ).

fof(f4_nnf,plain,
    environment(sk1),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    environment(sk1),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    environment(sk1) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(f5,hypothesis,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_6) ).

fof(f5_nnf,plain,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    inference(nnf_transformation,[status(thm)],[f5]) ).

cnf(c5,plain,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f5_nnf]) ).

cnf(hi5,axiom,
    subpopulations(first_movers,efficient_producers,sk1,sk2) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(h0,plain,
    subpopulations(efficient_producers,first_movers,sk1,sk2) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi4,hi5]) ).

cnf(f1,hypothesis,
    ( outcompetes(C,B,D)
    | ~ greater(zero,growth_rate(B,D))
    | ~ greater_or_equal(growth_rate(C,D),zero)
    | ~ subpopulations(B,C,A,D)
    | ~ environment(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_2) ).

fof(f1_nnf,plain,
    ! [A,B,C,D] :
      ( outcompetes(C,B,D)
      | ~ greater(zero,growth_rate(B,D))
      | ~ greater_or_equal(growth_rate(C,D),zero)
      | ~ subpopulations(B,C,A,D)
      | ~ environment(A) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A,B,C,D] :
      ( outcompetes(C,B,D)
      | ~ greater(zero,growth_rate(B,D))
      | ~ greater_or_equal(growth_rate(C,D),zero)
      | ~ subpopulations(B,C,A,D)
      | ~ environment(A) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( outcompetes(X2,X1,X3)
    | ~ greater(zero,growth_rate(X1,X3))
    | ~ greater_or_equal(growth_rate(X2,X3),zero)
    | ~ subpopulations(X1,X2,X0,X3)
    | ~ environment(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    ifeq(environment(X0),true,ifeq(subpopulations(X1,X2,X0,X3),true,ifeq(greater_or_equal(growth_rate(X2,X3),zero),true,ifeq(greater(zero,growth_rate(X1,X3)),true,outcompetes(X2,X1,X3),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f6,hypothesis,
    greater_or_equal(growth_rate(first_movers,sk2),zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_7) ).

fof(f6_nnf,plain,
    greater_or_equal(growth_rate(first_movers,sk2),zero),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    greater_or_equal(growth_rate(first_movers,sk2),zero),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(hi6,axiom,
    greater_or_equal(growth_rate(first_movers,sk2),zero) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(f7,hypothesis,
    greater(zero,growth_rate(efficient_producers,sk2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_8) ).

fof(f7_nnf,plain,
    greater(zero,growth_rate(efficient_producers,sk2)),
    inference(nnf_transformation,[status(thm)],[f7]) ).

cnf(c7,plain,
    greater(zero,growth_rate(efficient_producers,sk2)),
    inference(cnf_transformation,[status(esa)],[f7_nnf]) ).

cnf(hi7,axiom,
    greater(zero,growth_rate(efficient_producers,sk2)) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(h1,plain,
    outcompetes(first_movers,efficient_producers,sk2) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi4,h0,hi6,hi7]) ).

cnf(f8,negated_conjecture,
    ( ~ outcompetes(first_movers,efficient_producers,B)
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_star_9) ).

fof(f8_nnf,plain,
    ! [A,B] :
      ( ~ outcompetes(first_movers,efficient_producers,B)
      | ~ subpopulations(first_movers,efficient_producers,A,B)
      | ~ environment(A) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A,B] :
      ( ~ outcompetes(first_movers,efficient_producers,B)
      | ~ subpopulations(first_movers,efficient_producers,A,B)
      | ~ environment(A) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ( ~ outcompetes(first_movers,efficient_producers,X1)
    | ~ subpopulations(first_movers,efficient_producers,X0,X1)
    | ~ environment(X0) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(hi8,negated_conjecture,
    ifeq(environment(X0),true,ifeq(subpopulations(first_movers,efficient_producers,X0,X1),true,ifeq(outcompetes(first_movers,efficient_producers,X1),true,false,true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi8,hi4,hi5,h1]) ).

cnf(t49,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t49]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT036-3 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35  % Computer : n008.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Thu Sep 24 01:09:23 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.01/0.93  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.01/0.93  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------