↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Computer : n020.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:36 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(l3_22,axiom,
    ( ~ decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',l3_22) ).

cnf(mp_earliest_time_point_23,axiom,
    ( subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A))
    | ~ in_environment(A,initial_FM_EP(A))
    | ~ environment(A) ),
    file('theBenchmark.p',mp_earliest_time_point_23) ).

cnf(mp_earliest_time_point_24,axiom,
    ( greater_or_equal(B,initial_FM_EP(A))
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',mp_earliest_time_point_24) ).

cnf(mp_positive_function_difference_25,axiom,
    ( greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D))
    | decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)))
    | ~ greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C))
    | ~ subpopulations(first_movers,efficient_producers,A,D)
    | ~ greater_or_equal(D,B)
    | ~ greater_or_equal(B,C)
    | ~ environment(A) ),
    file('theBenchmark.p',mp_positive_function_difference_25) ).

cnf(mp_time_point_occurs_26,axiom,
    ( in_environment(A,B)
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',mp_time_point_occurs_26) ).

cnf(mp_initial_time_27,axiom,
    ( greater_or_equal(initial_FM_EP(A),start_time(A))
    | ~ environment(A) ),
    file('theBenchmark.p',mp_initial_time_27) ).

cnf(mp_times_in_order_28,axiom,
    ( in_environment(A,B)
    | ~ in_environment(A,C)
    | ~ greater(C,B)
    | ~ greater_or_equal(B,start_time(A))
    | ~ environment(A) ),
    file('theBenchmark.p',mp_times_in_order_28) ).

cnf(mp_greater_transitivity_29,axiom,
    ( greater(A,C)
    | ~ greater(B,C)
    | ~ greater(A,B) ),
    file('theBenchmark.p',mp_greater_transitivity_29) ).

cnf(mp_greater_or_equal_30,axiom,
    ( A = B
    | greater(A,B)
    | ~ greater_or_equal(A,B) ),
    file('theBenchmark.p',mp_greater_or_equal_30) ).

cnf(a8_31,hypothesis,
    ( greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A)))
    | ~ environment(A) ),
    file('theBenchmark.p',a8_31) ).

cnf(a10_32,hypothesis,
    ( subpopulations(first_movers,efficient_producers,A,D)
    | ~ greater_or_equal(C,D)
    | ~ greater_or_equal(D,B)
    | ~ subpopulations(first_movers,efficient_producers,A,C)
    | ~ subpopulations(first_movers,efficient_producers,A,B)
    | ~ environment(A) ),
    file('theBenchmark.p',a10_32) ).

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

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

cnf(prove_l2_35,negated_conjecture,
    ~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
    file('theBenchmark.p',prove_l2_35) ).

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,
    ( disbanding_rate(Eq_x_0,Eq_x_1) = disbanding_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_5,axiom,
    ( difference(Eq_x_0,Eq_x_1) = difference(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

cnf(equality_7,axiom,
    ( start_time(Eq_x_0) = start_time(Eq_y_0)
    | 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,
    ( decreases(Eq_y_0)
    | ~ decreases(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_11,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_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,
    ( 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(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT020-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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Sat Sep 19 16:12:46 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.22/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.22/0.50  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------