↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT021-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n003.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:48 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.41s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  10 unt;   3 nHn;  25 RR)
%            Number of literals    :   60 (   0 equ;  38 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ environment(u)
    | ~ subpopulations(first_movers,efficient_producers,u,v)
    | in_environment(u,v) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ environment(u)
    | ~ subpopulations(first_movers,efficient_producers,u,v)
    | greater(number_of_organizations(u,v),zero) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ decreases(u)
    | ~ increases(u) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ environment(u)
    | ~ in_environment(u,v)
    | ~ greater(equilibrium(u),v)
    | ~ greater(number_of_organizations(u,v),zero)
    | decreases(resources(u,v)) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ environment(u)
    | ~ in_environment(u,v)
    | ~ greater(number_of_organizations(u,v),zero)
    | constant(resources(u,v))
    | greater(equilibrium(u),v) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ environment(u)
    | ~ decreases(resources(u,v))
    | ~ subpopulations(first_movers,efficient_producers,u,v)
    | increases(difference(disbanding_rate(first_movers,v),disbanding_rate(efficient_producers,v))) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ environment(u)
    | ~ constant(resources(u,v))
    | ~ decreases(difference(disbanding_rate(first_movers,v),disbanding_rate(efficient_producers,v)))
    | ~ subpopulations(first_movers,efficient_producers,u,v) ),
    file('MGT021-1.p',unknown),
    [] ).

cnf(9,axiom,
    environment(sk1),
    file('MGT021-1.p',unknown),
    [] ).

cnf(10,axiom,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    file('MGT021-1.p',unknown),
    [] ).

cnf(11,axiom,
    decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
    file('MGT021-1.p',unknown),
    [] ).

cnf(14,plain,
    ( ~ in_environment(sk1,u)
    | ~ greater(equilibrium(sk1),u)
    | ~ greater(number_of_organizations(sk1,u),zero)
    | decreases(resources(sk1,u)) ),
    inference(res,[status(thm),theory(equality)],[9,5]),
    [iquote('0:Res:9.0,5.0')] ).

cnf(15,plain,
    ( ~ in_environment(sk1,u)
    | ~ greater(number_of_organizations(sk1,u),zero)
    | constant(resources(sk1,u))
    | greater(equilibrium(sk1),u) ),
    inference(res,[status(thm),theory(equality)],[9,6]),
    [iquote('0:Res:9.0,6.0')] ).

cnf(18,plain,
    ( ~ environment(sk1)
    | ~ constant(resources(sk1,sk2))
    | ~ decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
    inference(res,[status(thm),theory(equality)],[10,8]),
    [iquote('0:Res:10.0,8.1')] ).

cnf(19,plain,
    ( ~ environment(sk1)
    | ~ decreases(resources(sk1,sk2))
    | increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
    inference(res,[status(thm),theory(equality)],[10,7]),
    [iquote('0:Res:10.0,7.1')] ).

cnf(20,plain,
    ( ~ environment(sk1)
    | greater(number_of_organizations(sk1,sk2),zero) ),
    inference(res,[status(thm),theory(equality)],[10,2]),
    [iquote('0:Res:10.0,2.1')] ).

cnf(21,plain,
    ( ~ environment(sk1)
    | in_environment(sk1,sk2) ),
    inference(res,[status(thm),theory(equality)],[10,1]),
    [iquote('0:Res:10.0,1.1')] ).

cnf(22,plain,
    ~ increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
    inference(res,[status(thm),theory(equality)],[11,3]),
    [iquote('0:Res:11.0,3.1')] ).

cnf(24,plain,
    in_environment(sk1,sk2),
    inference(mrr,[status(thm)],[21,9]),
    [iquote('0:MRR:21.0,9.0')] ).

cnf(25,plain,
    greater(number_of_organizations(sk1,sk2),zero),
    inference(mrr,[status(thm)],[20,9]),
    [iquote('0:MRR:20.0,9.0')] ).

cnf(26,plain,
    ~ decreases(resources(sk1,sk2)),
    inference(mrr,[status(thm)],[19,9,22]),
    [iquote('0:MRR:19.0,19.2,9.0,22.0')] ).

cnf(27,plain,
    ~ constant(resources(sk1,sk2)),
    inference(mrr,[status(thm)],[18,9,11]),
    [iquote('0:MRR:18.0,18.2,9.0,11.0')] ).

cnf(31,plain,
    ( ~ in_environment(sk1,sk2)
    | constant(resources(sk1,sk2))
    | greater(equilibrium(sk1),sk2) ),
    inference(res,[status(thm),theory(equality)],[25,15]),
    [iquote('0:Res:25.0,15.1')] ).

cnf(35,plain,
    greater(equilibrium(sk1),sk2),
    inference(mrr,[status(thm)],[31,24,27]),
    [iquote('0:MRR:31.0,31.1,24.0,27.0')] ).

cnf(47,plain,
    ( ~ in_environment(sk1,sk2)
    | ~ greater(equilibrium(sk1),sk2)
    | decreases(resources(sk1,sk2)) ),
    inference(res,[status(thm),theory(equality)],[25,14]),
    [iquote('0:Res:25.0,14.2')] ).

cnf(51,plain,
    $false,
    inference(mrr,[status(thm)],[47,24,35,26]),
    [iquote('0:MRR:47.0,47.1,47.2,24.0,35.0,26.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT021-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.03  % Command  : run_spass %d %s
% 0.09/0.34  % Computer : n003.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Mon Sep  7 12:04:24 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.13/0.41  
% 0.13/0.41  SPASS V 3.9 
% 0.13/0.41  SPASS beiseite: Proof found.
% 0.13/0.41  % SZS status Theorem
% 0.13/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.13/0.41  SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.13/0.41  SPASS allocated 75646 KBytes.
% 0.13/0.41  SPASS spent	0:00:00.05 on the problem.
% 0.13/0.41  		0:00:00.03 for the input.
% 0.13/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.41  		0:00:00.00 for inferences.
% 0.13/0.41  		0:00:00.00 for the backtracking.
% 0.13/0.41  		0:00:00.00 for the reduction.
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  Here is a proof with depth 2, length 25 :
% 0.13/0.41  % SZS output start Refutation
% See solution above
% 0.13/0.41  Formulae used in the proof : mp_time_point_in_environment_27 mp_environment_not_empty_28 mp_increase_not_decrease_29 a3_31 a3_32 l4_33 l4_34 prove_l3_35 prove_l3_36 prove_l3_37
% 0.13/0.41  
%------------------------------------------------------------------------------