TSTP Solution File: MGT008+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:30 EDT 2022
% Result : Theorem 0.25s 1.41s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 159 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 201 ( 76 ~; 73 |; 47 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn 56 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_FOL,conjecture,
! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& greater(X7,X6) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_FOL) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& inertia(X1,X8,X10)
& inertia(X4,X9,X11)
& greater(X7,X6) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a5_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(t1_FOL,hypothesis,
! [X1,X4,X10,X11,X8,X9,X12,X13] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& inertia(X1,X8,X10)
& inertia(X4,X9,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& greater(X9,X8) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_FOL) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& greater(X7,X6) )
=> greater(X13,X12) ),
inference(assume_negation,[status(cth)],[t8_FOL]) ).
fof(c_0_5,hypothesis,
! [X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ~ organization(X12,X19)
| ~ organization(X13,X20)
| ~ class(X12,X14,X19)
| ~ class(X13,X14,X20)
| ~ size(X12,X15,X19)
| ~ size(X13,X16,X20)
| ~ inertia(X12,X17,X19)
| ~ inertia(X13,X18,X20)
| ~ greater(X16,X15)
| greater(X18,X17) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])])])]) ).
fof(c_0_6,negated_conjecture,
( organization(esk1_0,esk8_0)
& organization(esk2_0,esk9_0)
& reorganization_free(esk1_0,esk8_0,esk8_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& class(esk1_0,esk3_0,esk8_0)
& class(esk2_0,esk3_0,esk9_0)
& survival_chance(esk1_0,esk4_0,esk8_0)
& survival_chance(esk2_0,esk5_0,esk9_0)
& size(esk1_0,esk6_0,esk8_0)
& size(esk2_0,esk7_0,esk9_0)
& greater(esk7_0,esk6_0)
& ~ greater(esk5_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,negated_conjecture,
size(esk1_0,esk6_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk6_0)
| ~ size(X4,X3,X5)
| ~ class(esk1_0,X6,esk8_0)
| ~ class(X4,X6,X5)
| ~ inertia(esk1_0,X2,esk8_0)
| ~ inertia(X4,X1,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
class(esk1_0,esk3_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| inertia(X4,esk10_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])])])])]) ).
fof(c_0_13,hypothesis,
! [X14,X15,X16,X17,X18,X19,X20,X21] :
( ~ organization(X14,X16)
| ~ organization(X15,X17)
| ~ reorganization_free(X14,X16,X16)
| ~ reorganization_free(X15,X17,X17)
| ~ inertia(X14,X18,X16)
| ~ inertia(X15,X19,X17)
| ~ survival_chance(X14,X20,X16)
| ~ survival_chance(X15,X21,X17)
| ~ greater(X19,X18)
| greater(X21,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])]) ).
cnf(c_0_14,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk6_0)
| ~ size(X4,X3,X5)
| ~ class(X4,esk3_0,X5)
| ~ inertia(esk1_0,X2,esk8_0)
| ~ inertia(X4,X1,X5)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( inertia(X1,esk10_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ survival_chance(X5,X1,X6)
| ~ survival_chance(X7,X2,X8)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
survival_chance(esk1_0,esk4_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
reorganization_free(esk1_0,esk8_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( greater(X1,esk10_2(esk1_0,esk8_0))
| ~ greater(X2,esk6_0)
| ~ size(X3,X2,X4)
| ~ class(X3,esk3_0,X4)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
class(esk2_0,esk3_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( greater(X1,esk4_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X4,X5)
| ~ inertia(esk1_0,X5,esk8_0)
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_9])]) ).
cnf(c_0_25,negated_conjecture,
( greater(X1,esk10_2(esk1_0,esk8_0))
| ~ inertia(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( greater(X1,esk4_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X4,esk10_2(esk1_0,esk8_0))
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_9])]) ).
cnf(c_0_27,negated_conjecture,
greater(esk10_2(esk2_0,esk9_0),esk10_2(esk1_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( greater(X1,esk4_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk10_2(esk2_0,esk9_0),X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( greater(X1,esk4_0)
| ~ survival_chance(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_29]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
survival_chance(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
~ greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 07:30:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.41 # Preprocessing time : 0.016 s
% 0.25/1.41
% 0.25/1.41 # Proof found!
% 0.25/1.41 # SZS status Theorem
% 0.25/1.41 # SZS output start CNFRefutation
% See solution above
% 0.25/1.41 # Proof object total steps : 34
% 0.25/1.41 # Proof object clause steps : 25
% 0.25/1.41 # Proof object formula steps : 9
% 0.25/1.41 # Proof object conjectures : 25
% 0.25/1.41 # Proof object clause conjectures : 22
% 0.25/1.41 # Proof object formula conjectures : 3
% 0.25/1.41 # Proof object initial clauses used : 15
% 0.25/1.41 # Proof object initial formulas used : 4
% 0.25/1.41 # Proof object generating inferences : 10
% 0.25/1.41 # Proof object simplifying inferences : 19
% 0.25/1.41 # Training examples: 0 positive, 0 negative
% 0.25/1.41 # Parsed axioms : 4
% 0.25/1.41 # Removed by relevancy pruning/SinE : 0
% 0.25/1.41 # Initial clauses : 15
% 0.25/1.41 # Removed in clause preprocessing : 0
% 0.25/1.41 # Initial clauses in saturation : 15
% 0.25/1.41 # Processed clauses : 34
% 0.25/1.41 # ...of these trivial : 0
% 0.25/1.41 # ...subsumed : 0
% 0.25/1.41 # ...remaining for further processing : 34
% 0.25/1.41 # Other redundant clauses eliminated : 0
% 0.25/1.41 # Clauses deleted for lack of memory : 0
% 0.25/1.41 # Backward-subsumed : 0
% 0.25/1.41 # Backward-rewritten : 0
% 0.25/1.41 # Generated clauses : 23
% 0.25/1.41 # ...of the previous two non-trivial : 22
% 0.25/1.41 # Contextual simplify-reflections : 0
% 0.25/1.41 # Paramodulations : 23
% 0.25/1.41 # Factorizations : 0
% 0.25/1.41 # Equation resolutions : 0
% 0.25/1.41 # Current number of processed clauses : 34
% 0.25/1.41 # Positive orientable unit clauses : 12
% 0.25/1.41 # Positive unorientable unit clauses: 0
% 0.25/1.41 # Negative unit clauses : 1
% 0.25/1.41 # Non-unit-clauses : 21
% 0.25/1.41 # Current number of unprocessed clauses: 3
% 0.25/1.41 # ...number of literals in the above : 14
% 0.25/1.41 # Current number of archived formulas : 0
% 0.25/1.41 # Current number of archived clauses : 0
% 0.25/1.41 # Clause-clause subsumption calls (NU) : 116
% 0.25/1.41 # Rec. Clause-clause subsumption calls : 4
% 0.25/1.41 # Non-unit clause-clause subsumptions : 0
% 0.25/1.41 # Unit Clause-clause subsumption calls : 0
% 0.25/1.41 # Rewrite failures with RHS unbound : 0
% 0.25/1.41 # BW rewrite match attempts : 0
% 0.25/1.41 # BW rewrite match successes : 0
% 0.25/1.41 # Condensation attempts : 0
% 0.25/1.41 # Condensation successes : 0
% 0.25/1.41 # Termbank termtop insertions : 1920
% 0.25/1.41
% 0.25/1.41 # -------------------------------------------------
% 0.25/1.41 # User time : 0.015 s
% 0.25/1.41 # System time : 0.003 s
% 0.25/1.41 # Total time : 0.019 s
% 0.25/1.41 # Maximum resident set size: 2956 pages
%------------------------------------------------------------------------------