TSTP Solution File: MGT011+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT011+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:31 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 154 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 192 ( 79 ~; 72 |; 34 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_FOL,conjecture,
! [X1,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& size(X1,X10,X6)
& size(X1,X11,X7)
& greater(X7,X6) )
=> ~ greater(X10,X11) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_FOL) ).
fof(mp10,axiom,
! [X1,X6,X7,X8,X9] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& class(X1,X8,X6)
& class(X1,X9,X7) )
=> X8 = X9 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp10) ).
fof(mp9,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X5] : class(X1,X5,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp9) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X10,X11,X12,X13,X6,X7] :
( ( organization(X1,X6)
& organization(X4,X7)
& class(X1,X5,X6)
& class(X4,X5,X7)
& size(X1,X10,X6)
& size(X4,X11,X7)
& inertia(X1,X12,X6)
& inertia(X4,X13,X7)
& greater(X11,X10) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a5_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X12,X13,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& inertia(X1,X12,X6)
& inertia(X1,X13,X7)
& greater(X7,X6) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp5) ).
fof(mp6_2,axiom,
! [X1,X4] :
~ ( greater(X1,X4)
& greater(X4,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp6_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& size(X1,X10,X6)
& size(X1,X11,X7)
& greater(X7,X6) )
=> ~ greater(X10,X11) ),
inference(assume_negation,[status(cth)],[t11_FOL]) ).
fof(c_0_8,plain,
! [X10,X11,X12,X13,X14] :
( ~ organization(X10,X11)
| ~ organization(X10,X12)
| ~ reorganization_free(X10,X11,X12)
| ~ class(X10,X13,X11)
| ~ class(X10,X14,X12)
| X13 = X14 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])]) ).
fof(c_0_9,negated_conjecture,
( organization(esk1_0,esk4_0)
& organization(esk1_0,esk5_0)
& reorganization_free(esk1_0,esk4_0,esk5_0)
& size(esk1_0,esk2_0,esk4_0)
& size(esk1_0,esk3_0,esk5_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_7])])])])]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ class(X3,X2,X4)
| ~ class(X3,X1,X5)
| ~ reorganization_free(X3,X5,X4)
| ~ organization(X3,X4)
| ~ organization(X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X6,X7] :
( ~ organization(X6,X7)
| class(X6,esk7_2(X6,X7),X7) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])])])]) ).
fof(c_0_15,hypothesis,
! [X14,X15,X16,X17,X18,X19,X20,X21,X22] :
( ~ organization(X14,X21)
| ~ organization(X15,X22)
| ~ class(X14,X16,X21)
| ~ class(X15,X16,X22)
| ~ size(X14,X17,X21)
| ~ size(X15,X18,X22)
| ~ inertia(X14,X19,X21)
| ~ inertia(X15,X20,X22)
| ~ greater(X18,X17)
| greater(X20,X19) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])])])]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ class(esk1_0,X2,esk5_0)
| ~ class(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( class(X1,esk7_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ size(X5,X3,X6)
| ~ size(X7,X4,X8)
| ~ class(X5,X9,X6)
| ~ class(X7,X9,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
size(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( X1 = esk7_2(esk1_0,esk5_0)
| ~ class(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13])]) ).
fof(c_0_21,hypothesis,
! [X14,X15,X16,X17,X18] :
( ~ organization(X14,X17)
| ~ organization(X14,X18)
| ~ reorganization_free(X14,X17,X18)
| ~ inertia(X14,X15,X17)
| ~ inertia(X14,X16,X18)
| ~ greater(X18,X17)
| greater(X16,X15) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])])]) ).
cnf(c_0_22,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(esk1_0,X6,esk5_0)
| ~ class(X3,X6,X5)
| ~ greater(X4,esk3_0)
| ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(X3,X1,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_23,negated_conjecture,
esk7_2(esk1_0,esk5_0) = esk7_2(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_12])]) ).
cnf(c_0_24,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X3)
| ~ inertia(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| inertia(X4,esk6_2(X4,X5),X5) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])])]) ).
cnf(c_0_27,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(X3,esk7_2(esk1_0,esk4_0),X5)
| ~ greater(X4,esk3_0)
| ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(X3,X1,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk1_0,X2,esk4_0)
| ~ inertia(esk1_0,X1,esk5_0) ),
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_11]),c_0_25]),c_0_12]),c_0_13])]) ).
cnf(c_0_29,plain,
( inertia(X1,esk6_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( greater(X1,X2)
| ~ size(esk1_0,X3,esk4_0)
| ~ greater(X3,esk3_0)
| ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_12])]) ).
cnf(c_0_31,negated_conjecture,
size(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_33,plain,
! [X5,X6] :
( ~ greater(X5,X6)
| ~ greater(X6,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])]) ).
cnf(c_0_34,negated_conjecture,
( greater(X1,esk6_2(esk1_0,esk4_0))
| ~ inertia(esk1_0,X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_12])]) ).
cnf(c_0_35,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
greater(esk6_2(esk1_0,esk5_0),esk6_2(esk1_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_13])]) ).
cnf(c_0_38,negated_conjecture,
( greater(X1,esk6_2(esk1_0,esk5_0))
| ~ inertia(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_13])]) ).
cnf(c_0_39,negated_conjecture,
~ greater(esk6_2(esk1_0,esk4_0),esk6_2(esk1_0,esk5_0)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_12])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT011+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.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 10:05:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 41
% 0.23/1.41 # Proof object clause steps : 26
% 0.23/1.41 # Proof object formula steps : 15
% 0.23/1.41 # Proof object conjectures : 23
% 0.23/1.41 # Proof object clause conjectures : 20
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 13
% 0.23/1.41 # Proof object simplifying inferences : 29
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 8
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 14
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 14
% 0.23/1.41 # Processed clauses : 37
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 3
% 0.23/1.41 # ...remaining for further processing : 34
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 25
% 0.23/1.41 # ...of the previous two non-trivial : 25
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 24
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 31
% 0.23/1.41 # Positive orientable unit clauses : 10
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 17
% 0.23/1.41 # Current number of unprocessed clauses: 2
% 0.23/1.41 # ...number of literals in the above : 10
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 238
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 21
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3
% 0.23/1.41 # Unit Clause-clause subsumption calls : 22
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1811
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.017 s
% 0.23/1.41 # Maximum resident set size: 2784 pages
%------------------------------------------------------------------------------