TSTP Solution File: MGT058-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT058-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:35:52 EDT 2023
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 16 unt; 10 nHn; 38 RR)
% Number of literals : 68 ( 20 equ; 22 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_greater_or_equal_4,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_greater_or_equal_4) ).
cnf(lemma_10_44,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',lemma_10_44) ).
cnf(definition_smaller_8,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_smaller_8) ).
cnf(definition_3_30,axiom,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_3_30) ).
cnf(lemma_10_43,negated_conjecture,
age(sk3,sk4) = zero,
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',lemma_10_43) ).
cnf(lemma_10_46,negated_conjecture,
fragile_position(sk3),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',lemma_10_46) ).
cnf(definition_smaller_or_equal_2,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_smaller_or_equal_2) ).
cnf(lemma_10_45,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',lemma_10_45) ).
cnf(definition_4_36,axiom,
( ~ robust_position(X1)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_4_36) ).
cnf(lemma_10_47,negated_conjecture,
robust_position(sk3),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',lemma_10_47) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.ujpYVzexMd/E---3.1_7179.p',definition_smaller_or_equal_3) ).
cnf(c_0_11,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
definition_greater_or_equal_4 ).
cnf(c_0_12,negated_conjecture,
greater_or_equal(sigma,zero),
lemma_10_44 ).
cnf(c_0_13,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
definition_smaller_8 ).
cnf(c_0_14,negated_conjecture,
( zero = sigma
| greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
definition_3_30 ).
cnf(c_0_16,negated_conjecture,
age(sk3,sk4) = zero,
lemma_10_43 ).
cnf(c_0_17,negated_conjecture,
fragile_position(sk3),
lemma_10_46 ).
cnf(c_0_18,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
definition_smaller_or_equal_2 ).
cnf(c_0_19,negated_conjecture,
( zero = sigma
| smaller(zero,sigma) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
greater_or_equal(tau,zero),
lemma_10_45 ).
cnf(c_0_21,negated_conjecture,
( positional_advantage(sk3,sk4)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( zero = sigma
| smaller_or_equal(zero,sigma) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( zero = tau
| greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,axiom,
( ~ robust_position(X1)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ positional_advantage(X1,X2) ),
definition_4_36 ).
cnf(c_0_25,negated_conjecture,
( zero = sigma
| positional_advantage(sk3,sk4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
robust_position(sk3),
lemma_10_47 ).
cnf(c_0_27,negated_conjecture,
( zero = tau
| smaller(zero,tau) ),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_28,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_24,c_0_25]),c_0_26]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
( zero = tau
| smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_30,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
definition_smaller_or_equal_3 ).
cnf(c_0_31,negated_conjecture,
( zero = tau
| zero = sigma ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( zero = sigma
| tau != sigma ),
inference(ef,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
positional_advantage(sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_34]),c_0_32])]) ).
cnf(c_0_36,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_24,c_0_35]),c_0_26]),c_0_16]),c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
tau = sigma,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_34]),c_0_34]),c_0_36]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : MGT058-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 00:25:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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.ujpYVzexMd/E---3.1_7179.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 7306 completed with status 0
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 7315 completed with status 0
% 0.22/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 29
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 29
% 0.22/0.51 # Removed in clause preprocessing : 2
% 0.22/0.51 # Initial clauses in saturation : 27
% 0.22/0.51 # Processed clauses : 88
% 0.22/0.51 # ...of these trivial : 3
% 0.22/0.51 # ...subsumed : 5
% 0.22/0.51 # ...remaining for further processing : 80
% 0.22/0.51 # Other redundant clauses eliminated : 2
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 27
% 0.22/0.51 # Generated clauses : 49
% 0.22/0.51 # ...of the previous two non-redundant : 53
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 1
% 0.22/0.51 # Paramodulations : 46
% 0.22/0.51 # Factorizations : 1
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 2
% 0.22/0.51 # Total rewrite steps : 57
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 24
% 0.22/0.51 # Positive orientable unit clauses : 9
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 14
% 0.22/0.51 # Current number of unprocessed clauses: 16
% 0.22/0.51 # ...number of literals in the above : 48
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 54
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 221
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 187
% 0.22/0.51 # Non-unit clause-clause subsumptions : 5
% 0.22/0.51 # Unit Clause-clause subsumption calls : 27
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 6
% 0.22/0.51 # BW rewrite match successes : 3
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1277
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.007 s
% 0.22/0.51 # Maximum resident set size: 1616 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.008 s
% 0.22/0.51 # Total time : 0.011 s
% 0.22/0.51 # Maximum resident set size: 1688 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------