TSTP Solution File: MGT058+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT058+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Sat May 4 08:36:43 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 148 ( 26 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 147 ( 42 ~; 56 |; 32 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_10,conjecture,
! [X1] :
( ( organization(X1)
& ? [X5] : age(X1,X5) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',lemma_10) ).
fof(definition_greater_or_equal,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( greater(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',definition_greater_or_equal) ).
fof(definition_3,axiom,
! [X1] :
( fragile_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),sigma)
=> positional_advantage(X1,X4) )
& ( greater(age(X1,X4),sigma)
=> ~ positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',definition_3) ).
fof(definition_smaller,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',definition_smaller) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',definition_smaller_or_equal) ).
fof(definition_4,axiom,
! [X1] :
( robust_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),tau)
=> ~ positional_advantage(X1,X4) )
& ( greater(age(X1,X4),tau)
=> positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p',definition_4) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( organization(X1)
& ? [X5] : age(X1,X5) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
inference(assume_negation,[status(cth)],[lemma_10]) ).
fof(c_0_7,plain,
! [X20,X21] :
( ( ~ greater_or_equal(X20,X21)
| greater(X20,X21)
| X20 = X21 )
& ( ~ greater(X20,X21)
| greater_or_equal(X20,X21) )
& ( X20 != X21
| greater_or_equal(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_greater_or_equal])])])]) ).
fof(c_0_8,negated_conjecture,
( organization(esk1_0)
& age(esk1_0,esk2_0) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero)
& fragile_position(esk1_0)
& robust_position(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X1] :
( fragile_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),sigma)
=> positional_advantage(X1,X4) )
& ( greater(age(X1,X4),sigma)
=> ~ positional_advantage(X1,X4) ) ) ),
inference(fof_simplification,[status(thm)],[definition_3]) ).
fof(c_0_10,plain,
! [X29,X30] :
( ( ~ smaller(X29,X30)
| greater(X30,X29) )
& ( ~ greater(X30,X29)
| smaller(X29,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])])]) ).
cnf(c_0_11,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
greater_or_equal(sigma,zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X14,X15,X16,X17] :
( ( ~ smaller_or_equal(age(X14,X15),sigma)
| positional_advantage(X14,X15)
| ~ fragile_position(X14) )
& ( ~ greater(age(X14,X16),sigma)
| ~ positional_advantage(X14,X16)
| ~ fragile_position(X14) )
& ( greater(age(X17,esk6_1(X17)),sigma)
| smaller_or_equal(age(X17,esk5_1(X17)),sigma)
| fragile_position(X17) )
& ( positional_advantage(X17,esk6_1(X17))
| smaller_or_equal(age(X17,esk5_1(X17)),sigma)
| fragile_position(X17) )
& ( greater(age(X17,esk6_1(X17)),sigma)
| ~ positional_advantage(X17,esk5_1(X17))
| fragile_position(X17) )
& ( positional_advantage(X17,esk6_1(X17))
| ~ positional_advantage(X17,esk5_1(X17))
| fragile_position(X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_14,plain,
! [X27,X28] :
( ( ~ smaller_or_equal(X27,X28)
| smaller(X27,X28)
| X27 = X28 )
& ( ~ smaller(X27,X28)
| smaller_or_equal(X27,X28) )
& ( X27 != X28
| smaller_or_equal(X27,X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])]) ).
cnf(c_0_15,plain,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( zero = sigma
| greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,plain,
! [X1] :
( robust_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),tau)
=> ~ positional_advantage(X1,X4) )
& ( greater(age(X1,X4),tau)
=> positional_advantage(X1,X4) ) ) ),
inference(fof_simplification,[status(thm)],[definition_4]) ).
cnf(c_0_18,plain,
( positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),sigma)
| ~ fragile_position(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
age(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
fragile_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( zero = sigma
| smaller(zero,sigma) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
greater_or_equal(tau,zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
! [X8,X9,X10,X11] :
( ( ~ smaller_or_equal(age(X8,X9),tau)
| ~ positional_advantage(X8,X9)
| ~ robust_position(X8) )
& ( ~ greater(age(X8,X10),tau)
| positional_advantage(X8,X10)
| ~ robust_position(X8) )
& ( greater(age(X11,esk4_1(X11)),tau)
| smaller_or_equal(age(X11,esk3_1(X11)),tau)
| robust_position(X11) )
& ( ~ positional_advantage(X11,esk4_1(X11))
| smaller_or_equal(age(X11,esk3_1(X11)),tau)
| robust_position(X11) )
& ( greater(age(X11,esk4_1(X11)),tau)
| positional_advantage(X11,esk3_1(X11))
| robust_position(X11) )
& ( ~ positional_advantage(X11,esk4_1(X11))
| positional_advantage(X11,esk3_1(X11))
| robust_position(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
( zero = sigma
| smaller_or_equal(zero,sigma) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( zero = tau
| greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_28,plain,
( ~ smaller_or_equal(age(X1,X2),tau)
| ~ positional_advantage(X1,X2)
| ~ robust_position(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( zero = sigma
| positional_advantage(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
robust_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
( zero = tau
| smaller(zero,tau) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( zero = sigma
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_19])]) ).
cnf(c_0_33,negated_conjecture,
( zero = tau
| smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_34,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( zero = tau
| zero = sigma ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( zero = sigma
| tau != sigma ),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
positional_advantage(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_38]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
~ smaller_or_equal(sigma,tau),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_39]),c_0_30]),c_0_19]),c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
tau = sigma,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_38]),c_0_38]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT058+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:15:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.FtHQylzNXQ/E---3.1_24582.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 24662 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 24665 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 9
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 29
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 29
% 0.20/0.51 # Processed clauses : 88
% 0.20/0.51 # ...of these trivial : 2
% 0.20/0.51 # ...subsumed : 5
% 0.20/0.51 # ...remaining for further processing : 81
% 0.20/0.51 # Other redundant clauses eliminated : 2
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 25
% 0.20/0.51 # Generated clauses : 48
% 0.20/0.51 # ...of the previous two non-redundant : 52
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 45
% 0.20/0.51 # Factorizations : 1
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 2
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 55
% 0.20/0.51 # ...of those cached : 43
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 25
% 0.20/0.51 # Positive orientable unit clauses : 9
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 15
% 0.20/0.51 # Current number of unprocessed clauses: 19
% 0.20/0.51 # ...number of literals in the above : 55
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 54
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 184
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 166
% 0.20/0.51 # Non-unit clause-clause subsumptions : 5
% 0.20/0.51 # Unit Clause-clause subsumption calls : 28
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 8
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2336
% 0.20/0.51 # Search garbage collected termcells : 422
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1704 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.009 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.012 s
% 0.20/0.51 # Maximum resident set size: 1696 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------