TSTP Solution File: MGT036+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT036+3 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:37:09 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 75 ( 31 ~; 26 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t5_star,conjecture,
? [X1,X4] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4)
& outcompetes(first_movers,efficient_producers,X4) ),
file('/export/starexec/sandbox/tmp/tmp.uag25Revbw/E---3.1_12520.p',prove_t5_star) ).
fof(d2,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> ( ( greater_or_equal(growth_rate(X3,X4),zero)
& greater(zero,growth_rate(X2,X4)) )
<=> outcompetes(X3,X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.uag25Revbw/E---3.1_12520.p',d2) ).
fof(a13_star,hypothesis,
? [X1,X4] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(growth_rate(first_movers,X4),zero)
& greater(zero,growth_rate(efficient_producers,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.uag25Revbw/E---3.1_12520.p',a13_star) ).
fof(mp_symmetry_of_subpopulations,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> subpopulations(X3,X2,X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.uag25Revbw/E---3.1_12520.p',mp_symmetry_of_subpopulations) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X4] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4)
& outcompetes(first_movers,efficient_producers,X4) ),
inference(assume_negation,[status(cth)],[prove_t5_star]) ).
fof(c_0_5,hypothesis,
! [X5,X6,X7,X8] :
( ( ~ greater_or_equal(growth_rate(X7,X8),zero)
| ~ greater(zero,growth_rate(X6,X8))
| outcompetes(X7,X6,X8)
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8) )
& ( greater_or_equal(growth_rate(X7,X8),zero)
| ~ outcompetes(X7,X6,X8)
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8) )
& ( greater(zero,growth_rate(X6,X8))
| ~ outcompetes(X7,X6,X8)
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2])])]) ).
fof(c_0_6,hypothesis,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& greater_or_equal(growth_rate(first_movers,esk2_0),zero)
& greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[a13_star])]) ).
fof(c_0_7,negated_conjecture,
! [X11,X12] :
( ~ environment(X11)
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ outcompetes(first_movers,efficient_producers,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_8,hypothesis,
( outcompetes(X1,X3,X2)
| ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X3,X2))
| ~ environment(X4)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X13,X14,X15,X16] :
( ~ environment(X13)
| ~ subpopulations(X14,X15,X13,X16)
| subpopulations(X15,X14,X13,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_symmetry_of_subpopulations])]) ).
cnf(c_0_14,hypothesis,
( outcompetes(X1,efficient_producers,esk2_0)
| ~ greater_or_equal(growth_rate(X1,esk2_0),zero)
| ~ subpopulations(efficient_producers,X1,X2,esk2_0)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
~ outcompetes(first_movers,efficient_producers,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( ~ subpopulations(efficient_producers,first_movers,X1,esk2_0)
| ~ environment(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,hypothesis,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12])]) ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : MGT036+3 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n027.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 00:48:00 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.uag25Revbw/E---3.1_12520.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 12598 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FHHNF-FFSS22-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 12602 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FHHNF-FFSS22-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 4
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 9
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 9
% 0.21/0.53 # Processed clauses : 24
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 24
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 12
% 0.21/0.53 # ...of the previous two non-redundant : 8
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 12
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 11
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 15
% 0.21/0.53 # Positive orientable unit clauses : 5
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 9
% 0.21/0.53 # Current number of unprocessed clauses: 2
% 0.21/0.53 # ...number of literals in the above : 9
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 9
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 1
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 1
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 856
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.003 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.005 s
% 0.21/0.53 # Maximum resident set size: 1760 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.004 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.008 s
% 0.21/0.53 # Maximum resident set size: 1676 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------