↑ Up

CSE_E---1.7.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT031+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:47:31 PM UTC 2026

% Result   : CounterSatisfiable 1.26s 1.72s
% Output   : Saturation 1.26s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(mp_greater_or_equal,axiom,
    ! [X4,X5] :
      ( greater_or_equal(X4,X5)
    <=> ( greater(X4,X5)
        | X4 = X5 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal) ).

fof(mp_FM_not_precede_first,axiom,
    ! [X1] :
      ( environment(X1)
     => greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_FM_not_precede_first) ).

fof(prove_l13,conjecture,
    ! [X1] :
      ( ( environment(X1)
        & in_environment(X1,appear(an_organisation,X1)) )
     => appear(an_organisation,X1) = appear(first_movers,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l13) ).

fof(a9,hypothesis,
    ! [X1,X4,X2] :
      ( ( environment(X1)
        & subpopulation(X4,X1,X2)
        & greater(cardinality_at_time(X4,X2),zero) )
     => ( X4 = efficient_producers
        | X4 = first_movers ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a9) ).

fof(mp_number_mean_non_empty,axiom,
    ! [X1,X2] :
      ( ( environment(X1)
        & greater(number_of_organizations(X1,X2),zero) )
     => ? [X3] :
          ( subpopulation(X3,X1,X2)
          & greater(cardinality_at_time(X3,X2),zero) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_number_mean_non_empty) ).

fof(mp_greater_transitivity,axiom,
    ! [X4,X5,X6] :
      ( ( greater(X4,X5)
        & greater(X5,X6) )
     => greater(X4,X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity) ).

fof(mp_positive_number_when_appear,axiom,
    ! [X1] :
      ( environment(X1)
     => greater(number_of_organizations(e,appear(an_organisation,X1)),zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_number_when_appear) ).

fof(a13,hypothesis,
    ! [X1] :
      ( environment(X1)
     => greater(appear(efficient_producers,e),appear(first_movers,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13) ).

fof(mp_no_FM_before_appearance,axiom,
    ! [X1,X2] :
      ( ( environment(X1)
        & in_environment(X1,X2)
        & greater(appear(first_movers,X1),X2) )
     => ~ greater(cardinality_at_time(first_movers,X2),zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_no_FM_before_appearance) ).

fof(mp_no_EP_before_appearance,axiom,
    ! [X1,X2] :
      ( ( environment(X1)
        & in_environment(X1,X2)
        & greater(appear(efficient_producers,X1),X2) )
     => ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_no_EP_before_appearance) ).

fof(c_0_10,plain,
    ! [X38,X39] :
      ( ( ~ greater_or_equal(X38,X39)
        | greater(X38,X39)
        | X38 = X39 )
      & ( ~ greater(X38,X39)
        | greater_or_equal(X38,X39) )
      & ( X38 != X39
        | greater_or_equal(X38,X39) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])]) ).

fof(c_0_11,plain,
    ! [X34] :
      ( ~ environment(X34)
      | greater_or_equal(appear(first_movers,X34),appear(an_organisation,X34)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_FM_not_precede_first])]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X1] :
        ( ( environment(X1)
          & in_environment(X1,appear(an_organisation,X1)) )
       => appear(an_organisation,X1) = appear(first_movers,X1) ),
    inference(assume_negation,[status(cth)],[prove_l13]) ).

cnf(c_0_13,plain,
    ( greater(X1,X2)
    | X1 = X2
    | ~ greater_or_equal(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]),
    [final] ).

cnf(c_0_14,plain,
    ( greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))
    | ~ environment(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]),
    [final] ).

fof(c_0_15,negated_conjecture,
    ( environment(esk2_0)
    & in_environment(esk2_0,appear(an_organisation,esk2_0))
    & appear(an_organisation,esk2_0) != appear(first_movers,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).

fof(c_0_16,hypothesis,
    ! [X40,X41,X42] :
      ( ~ environment(X40)
      | ~ subpopulation(X41,X40,X42)
      | ~ greater(cardinality_at_time(X41,X42),zero)
      | X41 = efficient_producers
      | X41 = first_movers ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a9])]) ).

fof(c_0_17,plain,
    ! [X27,X28] :
      ( ( subpopulation(esk1_2(X27,X28),X27,X28)
        | ~ environment(X27)
        | ~ greater(number_of_organizations(X27,X28),zero) )
      & ( greater(cardinality_at_time(esk1_2(X27,X28),X28),zero)
        | ~ environment(X27)
        | ~ greater(number_of_organizations(X27,X28),zero) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_number_mean_non_empty])])])]) ).

fof(c_0_18,plain,
    ! [X35,X36,X37] :
      ( ~ greater(X35,X36)
      | ~ greater(X36,X37)
      | greater(X35,X37) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])]) ).

cnf(c_0_19,plain,
    ( appear(an_organisation,X1) = appear(first_movers,X1)
    | greater(appear(first_movers,X1),appear(an_organisation,X1))
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]),
    [final] ).

cnf(c_0_20,negated_conjecture,
    environment(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]),
    [final] ).

cnf(c_0_21,negated_conjecture,
    appear(an_organisation,esk2_0) != appear(first_movers,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]),
    [final] ).

cnf(c_0_22,hypothesis,
    ( X2 = efficient_producers
    | X2 = first_movers
    | ~ environment(X1)
    | ~ subpopulation(X2,X1,X3)
    | ~ greater(cardinality_at_time(X2,X3),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_23,plain,
    ( greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)
    | ~ environment(X1)
    | ~ greater(number_of_organizations(X1,X2),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_17]),
    [final] ).

cnf(c_0_24,plain,
    ( greater(X1,X3)
    | ~ greater(X1,X2)
    | ~ greater(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]),
    [final] ).

cnf(c_0_25,negated_conjecture,
    greater(appear(first_movers,esk2_0),appear(an_organisation,esk2_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [final] ).

cnf(c_0_26,hypothesis,
    ( esk1_2(X1,X2) = first_movers
    | esk1_2(X1,X2) = efficient_producers
    | ~ subpopulation(esk1_2(X1,X2),X3,X2)
    | ~ greater(number_of_organizations(X1,X2),zero)
    | ~ environment(X3)
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( subpopulation(esk1_2(X1,X2),X1,X2)
    | ~ environment(X1)
    | ~ greater(number_of_organizations(X1,X2),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_17]),
    [final] ).

fof(c_0_28,plain,
    ! [X26] :
      ( ~ environment(X26)
      | greater(number_of_organizations(e,appear(an_organisation,X26)),zero) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_positive_number_when_appear])]) ).

fof(c_0_29,hypothesis,
    ! [X43] :
      ( ~ environment(X43)
      | greater(appear(efficient_producers,e),appear(first_movers,X43)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a13])]) ).

cnf(c_0_30,negated_conjecture,
    ( greater(X1,appear(an_organisation,esk2_0))
    | ~ greater(X1,appear(first_movers,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]),
    [final] ).

fof(c_0_31,plain,
    ! [X1,X2] :
      ( ( environment(X1)
        & in_environment(X1,X2)
        & greater(appear(first_movers,X1),X2) )
     => ~ greater(cardinality_at_time(first_movers,X2),zero) ),
    inference(fof_simplification,[status(thm)],[mp_no_FM_before_appearance]) ).

fof(c_0_32,plain,
    ! [X1,X2] :
      ( ( environment(X1)
        & in_environment(X1,X2)
        & greater(appear(efficient_producers,X1),X2) )
     => ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
    inference(fof_simplification,[status(thm)],[mp_no_EP_before_appearance]) ).

cnf(c_0_33,hypothesis,
    ( esk1_2(X1,X2) = efficient_producers
    | esk1_2(X1,X2) = first_movers
    | ~ greater(number_of_organizations(X1,X2),zero)
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]),
    [final] ).

cnf(c_0_34,plain,
    ( greater(number_of_organizations(e,appear(an_organisation,X1)),zero)
    | ~ environment(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]),
    [final] ).

cnf(c_0_35,hypothesis,
    ( greater(appear(efficient_producers,e),appear(first_movers,X1))
    | ~ environment(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]),
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( greater(X1,appear(an_organisation,esk2_0))
    | ~ greater(X2,appear(first_movers,esk2_0))
    | ~ greater(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_30]),
    [final] ).

fof(c_0_37,plain,
    ! [X32,X33] :
      ( ~ environment(X32)
      | ~ in_environment(X32,X33)
      | ~ greater(appear(first_movers,X32),X33)
      | ~ greater(cardinality_at_time(first_movers,X33),zero) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).

fof(c_0_38,plain,
    ! [X30,X31] :
      ( ~ environment(X30)
      | ~ in_environment(X30,X31)
      | ~ greater(appear(efficient_producers,X30),X31)
      | ~ greater(cardinality_at_time(efficient_producers,X31),zero) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).

cnf(c_0_39,plain,
    ( greater_or_equal(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_40,hypothesis,
    ( esk1_2(e,appear(an_organisation,X1)) = first_movers
    | esk1_2(e,appear(an_organisation,X1)) = efficient_producers
    | ~ environment(e)
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]),
    [final] ).

cnf(c_0_41,plain,
    ( greater(X1,zero)
    | ~ greater(X1,cardinality_at_time(esk1_2(X2,X3),X3))
    | ~ greater(number_of_organizations(X2,X3),zero)
    | ~ environment(X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_23]),
    [final] ).

cnf(c_0_42,plain,
    ( greater(X1,zero)
    | ~ greater(X1,number_of_organizations(e,appear(an_organisation,X2)))
    | ~ environment(X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_34]),
    [final] ).

cnf(c_0_43,hypothesis,
    ( greater(X1,appear(first_movers,X2))
    | ~ greater(X1,appear(efficient_producers,e))
    | ~ environment(X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_35]),
    [final] ).

cnf(c_0_44,hypothesis,
    ( greater(X1,appear(an_organisation,esk2_0))
    | ~ greater(X1,appear(efficient_producers,e)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_20])]),
    [final] ).

cnf(c_0_45,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(appear(first_movers,X1),X2)
    | ~ greater(cardinality_at_time(first_movers,X2),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_37]),
    [final] ).

cnf(c_0_46,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(appear(efficient_producers,X1),X2)
    | ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_38]),
    [final] ).

cnf(c_0_47,plain,
    ( greater_or_equal(X1,X2)
    | ~ greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]),
    [final] ).

cnf(c_0_48,plain,
    greater_or_equal(X1,X1),
    inference(er,[status(thm)],[c_0_39]),
    [final] ).

cnf(c_0_49,negated_conjecture,
    in_environment(esk2_0,appear(an_organisation,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT031+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n025.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 23:27:43 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status CounterSatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start Saturation
% See solution above
% 1.26/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------