TSTP Solution File: MGT058+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : 600s
% DateTime : Sun Jul 17 22:06:51 EDT 2022
% Result : Theorem 7.87s 2.37s
% Output : CNFRefutation 7.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 15 unt; 8 nHn; 45 RR)
% Number of literals : 93 ( 24 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_12) ).
cnf(i_0_25,negated_conjecture,
age(esk5_0,esk6_0) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_25) ).
cnf(i_0_21,negated_conjecture,
robust_position(esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_21) ).
cnf(i_0_19,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_19) ).
cnf(i_0_16,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_16) ).
cnf(i_0_6,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_6) ).
cnf(i_0_22,negated_conjecture,
fragile_position(esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_22) ).
cnf(i_0_15,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_15) ).
cnf(i_0_23,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_23) ).
cnf(i_0_24,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_24) ).
cnf(i_0_18,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_18) ).
cnf(i_0_27,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_27) ).
cnf(i_0_28,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wew719bk/input.p',i_0_28) ).
cnf(c_0_42,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
i_0_12 ).
cnf(c_0_43,negated_conjecture,
age(esk5_0,esk6_0) = zero,
i_0_25 ).
cnf(c_0_44,negated_conjecture,
robust_position(esk5_0),
i_0_21 ).
cnf(c_0_45,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
i_0_19 ).
cnf(c_0_46,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
i_0_16 ).
cnf(c_0_47,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
i_0_6 ).
cnf(c_0_48,negated_conjecture,
fragile_position(esk5_0),
i_0_22 ).
cnf(c_0_49,plain,
( ~ positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_50,plain,
( smaller_or_equal(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_48])]) ).
cnf(c_0_52,plain,
( ~ positional_advantage(esk5_0,esk6_0)
| ~ greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( positional_advantage(esk5_0,esk6_0)
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_54,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_15 ).
cnf(c_0_55,negated_conjecture,
greater_or_equal(tau,zero),
i_0_23 ).
cnf(c_0_56,plain,
( ~ greater(tau,zero)
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( zero = tau
| greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
greater_or_equal(sigma,zero),
i_0_24 ).
cnf(c_0_59,negated_conjecture,
( zero = tau
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( zero = sigma
| greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_54,c_0_58]) ).
cnf(c_0_61,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_18 ).
cnf(c_0_62,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
i_0_27 ).
cnf(c_0_63,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
i_0_28 ).
cnf(c_0_64,negated_conjecture,
( zero = sigma
| zero = tau ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
( X1 = X2
| greater(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_62]) ).
cnf(c_0_67,plain,
( zero = sigma
| ~ greater(zero,sigma) ),
inference(spm,[status(thm)],[c_0_63,c_0_60]) ).
cnf(c_0_68,plain,
( zero = sigma
| ~ positional_advantage(esk5_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_64]),c_0_65])]) ).
cnf(c_0_69,negated_conjecture,
( zero = sigma
| tau != sigma ),
inference(ef,[status(thm)],[c_0_64]) ).
cnf(c_0_70,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_71,plain,
( zero = tau
| ~ greater(zero,tau) ),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_72,plain,
( tau != sigma
| ~ positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(sigma,tau) ),
inference(spm,[status(thm)],[c_0_49,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
positional_advantage(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_70]),c_0_65])]) ).
cnf(c_0_74,plain,
( zero = tau
| ~ positional_advantage(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_66]),c_0_71]) ).
cnf(c_0_75,plain,
( tau != sigma
| ~ smaller_or_equal(sigma,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_76,plain,
tau = sigma,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_70]),c_0_73])]) ).
cnf(c_0_77,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_76]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:38:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.87/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.87/2.37 # Version: 2.1pre011
% 7.87/2.37 # Preprocessing time : 0.015 s
% 7.87/2.37
% 7.87/2.37 # Proof found!
% 7.87/2.37 # SZS status Theorem
% 7.87/2.37 # SZS output start CNFRefutation
% See solution above
% 7.87/2.37 # Proof object total steps : 49
% 7.87/2.37 # Proof object clause steps : 36
% 7.87/2.37 # Proof object formula steps : 13
% 7.87/2.37 # Proof object conjectures : 19
% 7.87/2.37 # Proof object clause conjectures : 14
% 7.87/2.37 # Proof object formula conjectures : 5
% 7.87/2.37 # Proof object initial clauses used : 13
% 7.87/2.37 # Proof object initial formulas used : 13
% 7.87/2.37 # Proof object generating inferences : 18
% 7.87/2.37 # Proof object simplifying inferences : 22
% 7.87/2.37 # Training examples: 0 positive, 0 negative
% 7.87/2.37 # Parsed axioms : 29
% 7.87/2.37 # Removed by relevancy pruning/SinE : 0
% 7.87/2.37 # Initial clauses : 29
% 7.87/2.37 # Removed in clause preprocessing : 0
% 7.87/2.37 # Initial clauses in saturation : 29
% 7.87/2.37 # Processed clauses : 102
% 7.87/2.37 # ...of these trivial : 1
% 7.87/2.37 # ...subsumed : 14
% 7.87/2.37 # ...remaining for further processing : 87
% 7.87/2.37 # Other redundant clauses eliminated : 2
% 7.87/2.37 # Clauses deleted for lack of memory : 0
% 7.87/2.37 # Backward-subsumed : 5
% 7.87/2.37 # Backward-rewritten : 44
% 7.87/2.37 # Generated clauses : 165
% 7.87/2.37 # ...of the previous two non-trivial : 148
% 7.87/2.37 # Contextual simplify-reflections : 5
% 7.87/2.37 # Paramodulations : 160
% 7.87/2.37 # Factorizations : 3
% 7.87/2.37 # Equation resolutions : 2
% 7.87/2.37 # Propositional unsat checks : 0
% 7.87/2.37 # Propositional unsat check successes : 0
% 7.87/2.37 # Current number of processed clauses : 36
% 7.87/2.37 # Positive orientable unit clauses : 9
% 7.87/2.37 # Positive unorientable unit clauses: 0
% 7.87/2.37 # Negative unit clauses : 1
% 7.87/2.37 # Non-unit-clauses : 26
% 7.87/2.37 # Current number of unprocessed clauses: 18
% 7.87/2.37 # ...number of literals in the above : 55
% 7.87/2.37 # Current number of archived formulas : 0
% 7.87/2.37 # Current number of archived clauses : 49
% 7.87/2.37 # Clause-clause subsumption calls (NU) : 764
% 7.87/2.37 # Rec. Clause-clause subsumption calls : 551
% 7.87/2.37 # Non-unit clause-clause subsumptions : 18
% 7.87/2.37 # Unit Clause-clause subsumption calls : 30
% 7.87/2.37 # Rewrite failures with RHS unbound : 0
% 7.87/2.37 # BW rewrite match attempts : 14
% 7.87/2.37 # BW rewrite match successes : 4
% 7.87/2.37 # Condensation attempts : 0
% 7.87/2.37 # Condensation successes : 0
% 7.87/2.37 # Termbank termtop insertions : 2257
% 7.87/2.37
% 7.87/2.37 # -------------------------------------------------
% 7.87/2.37 # User time : 0.019 s
% 7.87/2.37 # System time : 0.001 s
% 7.87/2.37 # Total time : 0.020 s
% 7.87/2.37 # ...preprocessing : 0.015 s
% 7.87/2.37 # ...main loop : 0.005 s
% 7.87/2.37 # Maximum resident set size: 7128 pages
% 7.87/2.37
%------------------------------------------------------------------------------