↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MGT024-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n019.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 : Thu Sep 24 08:50:37 AM UTC 2026

% Result   : Unsatisfiable 30.15s 30.41s
% Output   : Proof 30.15s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(mp_time_point_occur_24,axiom,
    ( in_environment(A,B)
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',mp_time_point_occur_24) ).

cnf(mp_positive_number_of_organizations_25,axiom,
    ( greater(number_of_organizations(A,B),zero)
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',mp_positive_number_of_organizations_25) ).

cnf(mp_equilibrium_26,axiom,
    ( ~ greater(equilibrium(A),B)
    | ~ greater_or_equal(B,equilibrium(A))
    | ~ environment(A) ),
    file('theBenchmark.p',mp_equilibrium_26) ).

cnf(a3_27,hypothesis,
    ( decreases(resources(A,B))
    | ~ greater(equilibrium(A),B)
    | ~ greater(number_of_organizations(A,B),zero)
    | ~ in_environment(A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',a3_27) ).

cnf(a3_28,hypothesis,
    ( constant(resources(A,B))
    | greater(equilibrium(A),B)
    | ~ greater(number_of_organizations(A,B),zero)
    | ~ in_environment(A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',a3_28) ).

cnf(a6_29,hypothesis,
    ( ~ decreases(number_of_organizations(A,B))
    | ~ decreases(resources(A,B))
    | ~ in_environment(A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',a6_29) ).

cnf(a6_30,hypothesis,
    ( constant(number_of_organizations(A,B))
    | ~ constant(resources(A,B))
    | ~ in_environment(A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',a6_30) ).

cnf(l7_31,hypothesis,
    ( greater(growth_rate(efficient_producers,B),zero)
    | greater(growth_rate(first_movers,B),zero)
    | growth_rate(first_movers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_31) ).

cnf(l7_32,hypothesis,
    ( greater(zero,growth_rate(first_movers,B))
    | greater(growth_rate(first_movers,B),zero)
    | growth_rate(first_movers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_32) ).

cnf(l7_33,hypothesis,
    ( greater(growth_rate(efficient_producers,B),zero)
    | greater(zero,growth_rate(efficient_producers,B))
    | growth_rate(first_movers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_33) ).

cnf(l7_34,hypothesis,
    ( greater(zero,growth_rate(first_movers,B))
    | greater(zero,growth_rate(efficient_producers,B))
    | growth_rate(first_movers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_34) ).

cnf(l7_35,hypothesis,
    ( greater(growth_rate(efficient_producers,B),zero)
    | greater(growth_rate(first_movers,B),zero)
    | growth_rate(efficient_producers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_35) ).

cnf(l7_36,hypothesis,
    ( greater(zero,growth_rate(first_movers,B))
    | greater(growth_rate(first_movers,B),zero)
    | growth_rate(efficient_producers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_36) ).

cnf(l7_37,hypothesis,
    ( greater(growth_rate(efficient_producers,B),zero)
    | greater(zero,growth_rate(efficient_producers,B))
    | growth_rate(efficient_producers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_37) ).

cnf(l7_38,hypothesis,
    ( greater(zero,growth_rate(first_movers,B))
    | greater(zero,growth_rate(efficient_producers,B))
    | growth_rate(efficient_producers,B) = zero
    | ~ constant(number_of_organizations(A,B))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l7_38) ).

cnf(prove_l6_39,negated_conjecture,
    environment(sk1),
    file('theBenchmark.p',prove_l6_39) ).

cnf(prove_l6_40,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    file('theBenchmark.p',prove_l6_40) ).

cnf(prove_l6_41,negated_conjecture,
    greater_or_equal(sk2,equilibrium(sk1)),
    file('theBenchmark.p',prove_l6_41) ).

cnf(prove_l6_42,negated_conjecture,
    ( growth_rate(efficient_producers,sk2) != zero
    | growth_rate(first_movers,sk2) != zero ),
    file('theBenchmark.p',prove_l6_42) ).

cnf(prove_l6_43,negated_conjecture,
    ( ~ greater(zero,growth_rate(efficient_producers,sk2))
    | ~ greater(growth_rate(first_movers,sk2),zero) ),
    file('theBenchmark.p',prove_l6_43) ).

cnf(prove_l6_44,negated_conjecture,
    ( ~ greater(zero,growth_rate(first_movers,sk2))
    | ~ greater(growth_rate(efficient_producers,sk2),zero) ),
    file('theBenchmark.p',prove_l6_44) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( number_of_organizations(Eq_x_0,Eq_x_1) = number_of_organizations(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( equilibrium(Eq_x_0) = equilibrium(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( resources(Eq_x_0,Eq_x_1) = resources(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_7,axiom,
    ( growth_rate(Eq_x_0,Eq_x_1) = growth_rate(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_8,axiom,
    ( environment(Eq_y_0)
    | ~ environment(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_9,axiom,
    ( subpopulations(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3)
    | ~ subpopulations(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3)
    | Eq_x_3 != Eq_y_3
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_10,axiom,
    ( in_environment(Eq_y_0,Eq_y_1)
    | ~ in_environment(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_11,axiom,
    ( greater(Eq_y_0,Eq_y_1)
    | ~ greater(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_12,axiom,
    ( greater_or_equal(Eq_y_0,Eq_y_1)
    | ~ greater_or_equal(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_13,axiom,
    ( decreases(Eq_y_0)
    | ~ decreases(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_14,axiom,
    ( constant(Eq_y_0)
    | ~ constant(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT024-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n019.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 19 16:12:35 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 30.15/30.41  % SZS status Unsatisfiable for theBenchmark
% 30.15/30.41  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------