TSTP Solution File: MGT021+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT021+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 21 00:38:29 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 143 ( 59 ~; 48 |; 18 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 45 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a3,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).
fof(l4,hypothesis,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) )
& ( constant(resources(X1,X2))
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).
fof(prove_l3,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l3) ).
fof(mp_environment_not_empty,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> 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] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> 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,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a3]) ).
fof(c_0_7,hypothesis,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) )
& ( constant(resources(X1,X2))
=> ~ decreases(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] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_l3])]) ).
fof(c_0_9,hypothesis,
! [X5,X6] :
( ( ~ greater(equilibrium(X5),X6)
| decreases(resources(X5,X6))
| ~ environment(X5)
| ~ in_environment(X5,X6)
| ~ greater(number_of_organizations(X5,X6),zero) )
& ( greater(equilibrium(X5),X6)
| constant(resources(X5,X6))
| ~ environment(X5)
| ~ in_environment(X5,X6)
| ~ greater(number_of_organizations(X5,X6),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
! [X11,X12] :
( ~ environment(X11)
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| greater(number_of_organizations(X11,X12),zero) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_not_empty])])]) ).
fof(c_0_11,plain,
! [X13,X14] :
( ~ environment(X13)
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| in_environment(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_in_environment])])]) ).
fof(c_0_12,hypothesis,
! [X7,X8] :
( ( ~ decreases(resources(X7,X8))
| increases(difference(disbanding_rate(first_movers,X8),disbanding_rate(efficient_producers,X8)))
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8) )
& ( ~ constant(resources(X7,X8))
| ~ decreases(difference(disbanding_rate(first_movers,X8),disbanding_rate(efficient_producers,X8)))
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,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_13,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X3] :
( increases(X3)
=> ~ decreases(X3) ),
inference(fof_simplification,[status(thm)],[mp_increase_not_decrease]) ).
cnf(c_0_18,hypothesis,
( ~ constant(resources(X1,X2))
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X15] :
( ~ increases(X15)
| ~ decreases(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_24,hypothesis,
( increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ decreases(resources(X1,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,hypothesis,
( decreases(resources(X1,X2))
| ~ greater(equilibrium(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ constant(resources(X1,esk2_0))
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( constant(resources(esk1_0,esk2_0))
| greater(equilibrium(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_28,plain,
( ~ increases(X1)
| ~ decreases(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| ~ decreases(resources(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_22])]) ).
cnf(c_0_30,hypothesis,
( decreases(resources(X1,X2))
| ~ greater(equilibrium(X1),X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16]) ).
cnf(c_0_31,negated_conjecture,
greater(equilibrium(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]),c_0_22])]) ).
cnf(c_0_32,negated_conjecture,
~ decreases(resources(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19])]) ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_21]),c_0_22])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : MGT021+1 : TPTP v8.2.0. Released v2.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 00:04:22 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.51 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.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_3 with pid 6233 completed with status 0
% 0.22/0.52 # Result found by new_bool_3
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.52 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6236 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 7
% 0.22/0.52 # Removed by relevancy pruning/SinE : 1
% 0.22/0.52 # Initial clauses : 10
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 10
% 0.22/0.52 # Processed clauses : 27
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 27
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 1
% 0.22/0.52 # Backward-rewritten : 1
% 0.22/0.52 # Generated clauses : 8
% 0.22/0.52 # ...of the previous two non-redundant : 7
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 2
% 0.22/0.52 # Paramodulations : 8
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 8
% 0.22/0.52 # ...of those cached : 4
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 15
% 0.22/0.52 # Positive orientable unit clauses : 4
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 1
% 0.22/0.52 # Non-unit-clauses : 10
% 0.22/0.52 # Current number of unprocessed clauses: 0
% 0.22/0.52 # ...number of literals in the above : 0
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 12
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 57
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 21
% 0.22/0.52 # Non-unit clause-clause subsumptions : 2
% 0.22/0.52 # Unit Clause-clause subsumption calls : 3
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 1
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1254
% 0.22/0.52 # Search garbage collected termcells : 169
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.006 s
% 0.22/0.52 # Maximum resident set size: 1724 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.009 s
% 0.22/0.52 # Maximum resident set size: 1692 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------