TSTP Solution File: MGT014+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:09:32 EDT 2022
% Result : Theorem 0.09s 1.29s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 18 unt; 0 def)
% Number of atoms : 168 ( 20 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 195 ( 78 ~; 71 |; 38 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 99 ( 1 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_FOL,conjecture,
! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t14_FOL) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp15) ).
fof(t11_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_FOL) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp17) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp16) ).
fof(t12_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_FOL) ).
fof(mp19,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp19) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp6_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[t14_FOL]) ).
fof(c_0_9,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| time(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])]) ).
fof(c_0_10,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_11,hypothesis,
! [X8,X9,X10,X11,X12] :
( ~ organization(X8,X11)
| ~ organization(X8,X12)
| ~ reorganization_free(X8,X11,X12)
| ~ size(X8,X9,X11)
| ~ size(X8,X10,X12)
| ~ greater(X12,X11)
| ~ greater(X9,X10) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t11_FOL])])])])]) ).
fof(c_0_12,plain,
! [X6,X7,X8] :
( ~ reorganization_free(X6,X7,X8)
| reorganization_free(X6,X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])]) ).
fof(c_0_13,plain,
! [X6,X7] :
( ~ time(X6)
| ~ time(X7)
| greater(X6,X7)
| X6 = X7
| greater(X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])]) ).
cnf(c_0_14,plain,
( time(X1)
| ~ organization(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ size(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ organization(esk1_0,X2)
| ~ greater(esk6_0,X2)
| ~ greater(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,hypothesis,
! [X10,X11,X12,X13,X14] :
( ~ organization(X10,X13)
| ~ organization(X10,X14)
| ~ reorganization_free(X10,X13,X14)
| ~ complexity(X10,X11,X13)
| ~ complexity(X10,X12,X14)
| ~ greater(X14,X13)
| ~ greater(X11,X12) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t12_FOL])])])])]) ).
fof(c_0_26,plain,
! [X8,X9,X10,X11,X12] :
( ~ organization(X8,X11)
| ~ organization(X8,X12)
| ~ size(X8,X9,X11)
| ~ size(X8,X10,X12)
| X11 != X12
| X9 = X10 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp19])])])]) ).
cnf(c_0_27,negated_conjecture,
( X1 = esk7_0
| greater(esk7_0,X1)
| greater(X1,esk7_0)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( ~ size(esk1_0,X1,esk7_0)
| ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( X1 = X2
| X3 != X4
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk6_0,esk7_0)
| greater(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ organization(esk1_0,X2)
| ~ greater(esk7_0,X2)
| ~ greater(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk7_0,esk6_0) ),
inference(sr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20]),c_0_18]),c_0_39])]) ).
cnf(c_0_43,negated_conjecture,
( X1 = esk5_0
| ~ size(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_15])]) ).
cnf(c_0_44,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ greater(X3,X4)
| X3 != X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk5_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
esk4_0 = esk5_0,
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_49,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.06 % Command : run_ET %s %d
% 0.06/0.25 % Computer : n018.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Thu Jun 9 11:21:38 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.09/1.29 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.09/1.29 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.09/1.29 # Preprocessing time : 0.008 s
% 0.09/1.29
% 0.09/1.29 # Failure: Out of unprocessed clauses!
% 0.09/1.29 # OLD status GaveUp
% 0.09/1.29 # Parsed axioms : 9
% 0.09/1.29 # Removed by relevancy pruning/SinE : 2
% 0.09/1.29 # Initial clauses : 15
% 0.09/1.29 # Removed in clause preprocessing : 0
% 0.09/1.29 # Initial clauses in saturation : 15
% 0.09/1.29 # Processed clauses : 33
% 0.09/1.29 # ...of these trivial : 0
% 0.09/1.29 # ...subsumed : 4
% 0.09/1.29 # ...remaining for further processing : 29
% 0.09/1.29 # Other redundant clauses eliminated : 2
% 0.09/1.29 # Clauses deleted for lack of memory : 0
% 0.09/1.29 # Backward-subsumed : 0
% 0.09/1.29 # Backward-rewritten : 0
% 0.09/1.29 # Generated clauses : 19
% 0.09/1.29 # ...of the previous two non-trivial : 18
% 0.09/1.29 # Contextual simplify-reflections : 0
% 0.09/1.29 # Paramodulations : 17
% 0.09/1.29 # Factorizations : 0
% 0.09/1.29 # Equation resolutions : 2
% 0.09/1.29 # Current number of processed clauses : 27
% 0.09/1.29 # Positive orientable unit clauses : 10
% 0.09/1.29 # Positive unorientable unit clauses: 0
% 0.09/1.29 # Negative unit clauses : 5
% 0.09/1.29 # Non-unit-clauses : 12
% 0.09/1.29 # Current number of unprocessed clauses: 0
% 0.09/1.29 # ...number of literals in the above : 0
% 0.09/1.29 # Current number of archived formulas : 0
% 0.09/1.29 # Current number of archived clauses : 0
% 0.09/1.29 # Clause-clause subsumption calls (NU) : 72
% 0.09/1.29 # Rec. Clause-clause subsumption calls : 43
% 0.09/1.29 # Non-unit clause-clause subsumptions : 0
% 0.09/1.29 # Unit Clause-clause subsumption calls : 30
% 0.09/1.29 # Rewrite failures with RHS unbound : 0
% 0.09/1.29 # BW rewrite match attempts : 0
% 0.09/1.29 # BW rewrite match successes : 0
% 0.09/1.29 # Condensation attempts : 0
% 0.09/1.29 # Condensation successes : 0
% 0.09/1.29 # Termbank termtop insertions : 1491
% 0.09/1.29
% 0.09/1.29 # -------------------------------------------------
% 0.09/1.29 # User time : 0.007 s
% 0.09/1.29 # System time : 0.002 s
% 0.09/1.29 # Total time : 0.009 s
% 0.09/1.29 # Maximum resident set size: 2780 pages
% 0.09/1.29 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.09/1.29 # Preprocessing time : 0.007 s
% 0.09/1.29
% 0.09/1.29 # Proof found!
% 0.09/1.29 # SZS status Theorem
% 0.09/1.29 # SZS output start CNFRefutation
% See solution above
% 0.09/1.29 # Proof object total steps : 51
% 0.09/1.29 # Proof object clause steps : 34
% 0.09/1.29 # Proof object formula steps : 17
% 0.09/1.29 # Proof object conjectures : 28
% 0.09/1.29 # Proof object clause conjectures : 25
% 0.09/1.29 # Proof object formula conjectures : 3
% 0.09/1.29 # Proof object initial clauses used : 16
% 0.09/1.29 # Proof object initial formulas used : 8
% 0.09/1.29 # Proof object generating inferences : 12
% 0.09/1.29 # Proof object simplifying inferences : 21
% 0.09/1.29 # Training examples: 0 positive, 0 negative
% 0.09/1.29 # Parsed axioms : 9
% 0.09/1.29 # Removed by relevancy pruning/SinE : 0
% 0.09/1.29 # Initial clauses : 17
% 0.09/1.29 # Removed in clause preprocessing : 0
% 0.09/1.29 # Initial clauses in saturation : 17
% 0.09/1.29 # Processed clauses : 48
% 0.09/1.29 # ...of these trivial : 0
% 0.09/1.29 # ...subsumed : 7
% 0.09/1.29 # ...remaining for further processing : 41
% 0.09/1.29 # Other redundant clauses eliminated : 2
% 0.09/1.29 # Clauses deleted for lack of memory : 0
% 0.09/1.29 # Backward-subsumed : 0
% 0.09/1.29 # Backward-rewritten : 19
% 0.09/1.29 # Generated clauses : 31
% 0.09/1.29 # ...of the previous two non-trivial : 44
% 0.09/1.29 # Contextual simplify-reflections : 0
% 0.09/1.29 # Paramodulations : 27
% 0.09/1.29 # Factorizations : 0
% 0.09/1.29 # Equation resolutions : 2
% 0.09/1.29 # Current number of processed clauses : 18
% 0.09/1.29 # Positive orientable unit clauses : 7
% 0.09/1.29 # Positive unorientable unit clauses: 0
% 0.09/1.29 # Negative unit clauses : 2
% 0.09/1.29 # Non-unit-clauses : 9
% 0.09/1.29 # Current number of unprocessed clauses: 12
% 0.09/1.29 # ...number of literals in the above : 34
% 0.09/1.29 # Current number of archived formulas : 0
% 0.09/1.29 # Current number of archived clauses : 21
% 0.09/1.29 # Clause-clause subsumption calls (NU) : 138
% 0.09/1.29 # Rec. Clause-clause subsumption calls : 67
% 0.09/1.29 # Non-unit clause-clause subsumptions : 1
% 0.09/1.29 # Unit Clause-clause subsumption calls : 40
% 0.09/1.29 # Rewrite failures with RHS unbound : 0
% 0.09/1.29 # BW rewrite match attempts : 2
% 0.09/1.29 # BW rewrite match successes : 2
% 0.09/1.29 # Condensation attempts : 0
% 0.09/1.29 # Condensation successes : 0
% 0.09/1.29 # Termbank termtop insertions : 1762
% 0.09/1.29
% 0.09/1.29 # -------------------------------------------------
% 0.09/1.29 # User time : 0.009 s
% 0.09/1.29 # System time : 0.000 s
% 0.09/1.29 # Total time : 0.009 s
% 0.09/1.29 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------