↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : MGT021+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.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 01:26:03 PM UTC 2026

% Result   : Theorem 0.13s 0.42s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (   5 unt;   0 def)
%            Number of atoms       :  121 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  150 (  63   ~;  49   |;  19   &)
%                                         (   0 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_l3,conjecture,
    ! [X1,X2] :
      ( ( subpopulations(first_movers,efficient_producers,X1,X2)
        & environment(X1) )
     => ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l3) ).

fof(l4,hypothesis,
    ! [X1,X2] :
      ( ( subpopulations(first_movers,efficient_producers,X1,X2)
        & environment(X1) )
     => ( ( constant(resources(X1,X2))
         => ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) )
        & ( decreases(resources(X1,X2))
         => increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).

fof(a3,hypothesis,
    ! [X1,X2] :
      ( ( greater(number_of_organizations(X1,X2),zero)
        & in_environment(X1,X2)
        & environment(X1) )
     => ( ( ~ greater(equilibrium(X1),X2)
         => constant(resources(X1,X2)) )
        & ( greater(equilibrium(X1),X2)
         => decreases(resources(X1,X2)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).

fof(mp_environment_not_empty,axiom,
    ! [X1,X2] :
      ( ( subpopulations(first_movers,efficient_producers,X1,X2)
        & environment(X1) )
     => greater(number_of_organizations(X1,X2),zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_environment_not_empty) ).

fof(mp_time_point_in_environment,axiom,
    ! [X1,X2] :
      ( ( subpopulations(first_movers,efficient_producers,X1,X2)
        & environment(X1) )
     => in_environment(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_in_environment) ).

fof(mp_increase_not_decrease,axiom,
    ! [X3] :
      ( increases(X3)
     => ~ decreases(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_increase_not_decrease) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( subpopulations(first_movers,efficient_producers,X1,X2)
          & environment(X1) )
       => ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
    inference(assume_negation,[status(cth)],[prove_l3]) ).

fof(c_0_7,hypothesis,
    ! [X1,X2] :
      ( ( subpopulations(first_movers,efficient_producers,X1,X2)
        & environment(X1) )
     => ( ( constant(resources(X1,X2))
         => ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) )
        & ( decreases(resources(X1,X2))
         => increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ) ) ),
    inference(fof_simplification,[status(thm)],[l4]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( subpopulations(first_movers,efficient_producers,X1,X2)
          & environment(X1) )
       => ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_9,hypothesis,
    ! [X1,X2] :
      ( ( greater(number_of_organizations(X1,X2),zero)
        & in_environment(X1,X2)
        & environment(X1) )
     => ( ( ~ greater(equilibrium(X1),X2)
         => constant(resources(X1,X2)) )
        & ( greater(equilibrium(X1),X2)
         => decreases(resources(X1,X2)) ) ) ),
    inference(fof_simplification,[status(thm)],[a3]) ).

fof(c_0_10,hypothesis,
    ! [X7,X8] :
      ( ( ~ subpopulations(first_movers,efficient_producers,X7,X8)
        | ~ environment(X7)
        | ~ decreases(difference(disbanding_rate(first_movers,X8),disbanding_rate(efficient_producers,X8)))
        | ~ constant(resources(X7,X8)) )
      & ( ~ subpopulations(first_movers,efficient_producers,X7,X8)
        | ~ environment(X7)
        | increases(difference(disbanding_rate(first_movers,X8),disbanding_rate(efficient_producers,X8)))
        | ~ decreases(resources(X7,X8)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

fof(c_0_11,negated_conjecture,
    ( decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
    & subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
    & environment(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

fof(c_0_12,hypothesis,
    ! [X5,X6] :
      ( ( ~ greater(number_of_organizations(X5,X6),zero)
        | ~ in_environment(X5,X6)
        | ~ environment(X5)
        | constant(resources(X5,X6))
        | greater(equilibrium(X5),X6) )
      & ( ~ greater(number_of_organizations(X5,X6),zero)
        | ~ in_environment(X5,X6)
        | ~ environment(X5)
        | decreases(resources(X5,X6))
        | ~ greater(equilibrium(X5),X6) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

fof(c_0_13,plain,
    ! [X11,X12] :
      ( greater(number_of_organizations(X11,X12),zero)
      | ~ subpopulations(first_movers,efficient_producers,X11,X12)
      | ~ environment(X11) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_not_empty])])]) ).

fof(c_0_14,plain,
    ! [X13,X14] :
      ( in_environment(X13,X14)
      | ~ subpopulations(first_movers,efficient_producers,X13,X14)
      | ~ environment(X13) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_in_environment])])]) ).

cnf(c_0_15,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
    | ~ constant(resources(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    ( ~ greater(number_of_organizations(X1,X2),zero)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | ~ greater(equilibrium(X1),X2)
    | decreases(resources(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater(number_of_organizations(X1,X2),zero) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | in_environment(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
    | ~ constant(resources(X1,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,hypothesis,
    ( ~ greater(number_of_organizations(X1,X2),zero)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | constant(resources(X1,X2))
    | greater(equilibrium(X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,hypothesis,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ greater(equilibrium(X1),X2)
    | decreases(resources(X1,X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_23,hypothesis,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
    | greater(equilibrium(X1),esk2_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_18]) ).

fof(c_0_24,plain,
    ! [X3] :
      ( increases(X3)
     => ~ decreases(X3) ),
    inference(fof_simplification,[status(thm)],[mp_increase_not_decrease]) ).

cnf(c_0_25,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | ~ decreases(resources(X1,X2))
    | increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,hypothesis,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
    | decreases(resources(X1,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_27,plain,
    ! [X15] :
      ( ~ decreases(X15)
      | ~ increases(X15) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

cnf(c_0_28,hypothesis,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
    | increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_30,negated_conjecture,
    environment(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_31,plain,
    ( ~ decreases(X1)
    | ~ increases(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT021+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.35  % Computer : n017.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 01:16:56 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.42  % Version: 3.5.1
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42  % Starting sh5l with 300s (1) cores
% 0.13/0.42  % new_bool_3 with pid 1112343 completed with status 0
% 0.13/0.42  % Result found by new_bool_3
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42  % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.13/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42  % SubtermCWHack with pid 1112349 completed with status 0
% 0.13/0.42  % Result found by SubtermCWHack
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42  % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.13/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42  % Preprocessing time       : 0.001 s
% 0.13/0.42  
% 0.13/0.42  % Proof found!
% 0.13/0.42  % SZS status Theorem
% 0.13/0.42  % SZS output start CNFRefutation
% See solution above
% 0.13/0.42  % Parsed axioms                        : 7
% 0.13/0.42  % Removed by relevancy pruning/SinE    : 1
% 0.13/0.42  % Initial clauses                      : 10
% 0.13/0.42  % Removed in clause preprocessing      : 0
% 0.13/0.42  % Initial clauses in saturation        : 10
% 0.13/0.42  % Processed clauses                    : 16
% 0.13/0.42  % ...of these trivial                  : 0
% 0.13/0.42  % ...subsumed                          : 0
% 0.13/0.42  % ...remaining for further processing  : 16
% 0.13/0.42  % Other redundant clauses eliminated   : 0
% 0.13/0.42  % Clauses deleted for lack of memory   : 0
% 0.13/0.42  % Backward-subsumed                    : 0
% 0.13/0.42  % Backward-rewritten                   : 1
% 0.13/0.42  % Generated clauses                    : 7
% 0.13/0.42  % ...of the previous two non-redundant : 6
% 0.13/0.42  % ...aggressively subsumed             : 0
% 0.13/0.42  % Contextual simplify-reflections      : 3
% 0.13/0.42  % Paramodulations                      : 7
% 0.13/0.42  % Factorizations                       : 0
% 0.13/0.42  % NegExts                              : 0
% 0.13/0.42  % Equation resolutions                 : 0
% 0.13/0.42  % Disequality decompositions           : 0
% 0.13/0.42  % Total rewrite steps                  : 3
% 0.13/0.42  % ...of those cached                   : 0
% 0.13/0.42  % Propositional unsat checks           : 0
% 0.13/0.42  %    Propositional check models        : 0
% 0.13/0.42  %    Propositional check unsatisfiable : 0
% 0.13/0.42  %    Propositional clauses             : 0
% 0.13/0.42  %    Propositional clauses after purity: 0
% 0.13/0.42  %    Propositional unsat core size     : 0
% 0.13/0.42  %    Propositional preprocessing time  : 0.000
% 0.13/0.42  %    Propositional encoding time       : 0.000
% 0.13/0.42  %    Propositional solver time         : 0.000
% 0.13/0.42  %    Success case prop preproc time    : 0.000
% 0.13/0.42  %    Success case prop encoding time   : 0.000
% 0.13/0.42  %    Success case prop solver time     : 0.000
% 0.13/0.42  % Current number of processed clauses  : 15
% 0.13/0.42  %    Positive orientable unit clauses  : 4
% 0.13/0.42  %    Positive unorientable unit clauses: 0
% 0.13/0.42  %    Negative unit clauses             : 0
% 0.13/0.42  %    Non-unit-clauses                  : 11
% 0.13/0.42  % Current number of unprocessed clauses: 0
% 0.13/0.42  % ...number of literals in the above   : 0
% 0.13/0.42  % Current number of archived formulas  : 0
% 0.13/0.42  % Current number of archived clauses   : 1
% 0.13/0.42  % Clause-clause subsumption calls (NU) : 52
% 0.13/0.42  % Rec. Clause-clause subsumption calls : 21
% 0.13/0.42  % Non-unit clause-clause subsumptions  : 3
% 0.13/0.42  % Unit Clause-clause subsumption calls : 0
% 0.13/0.42  % Rewrite failures with RHS unbound    : 0
% 0.13/0.42  % BW rewrite match attempts            : 2
% 0.13/0.42  % BW rewrite match successes           : 1
% 0.13/0.42  % Condensation attempts                : 0
% 0.13/0.42  % Condensation successes               : 0
% 0.13/0.42  % Termbank termtop insertions          : 1208
% 0.13/0.42  % Search garbage collected termcells   : 168
% 0.13/0.42  
% 0.13/0.42  % -------------------------------------------------
% 0.13/0.42  % User time                : 0.005 s
% 0.13/0.42  % System time              : 0.002 s
% 0.13/0.42  % Total time               : 0.007 s
% 0.13/0.42  % Maximum resident set size: 3640 pages
% 0.13/0.42  
% 0.13/0.42  % -------------------------------------------------
% 0.13/0.42  % User time                : 0.007 s
% 0.13/0.42  % System time              : 0.006 s
% 0.13/0.42  % Total time               : 0.013 s
% 0.13/0.42  % Maximum resident set size: 4608 pages
% 0.13/0.42  % E exiting
%------------------------------------------------------------------------------