TSTP Solution File: MGT003+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:28 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 174 ( 70 ~; 67 |; 31 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 90 ( 2 sgn 46 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_FOL,conjecture,
! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_FOL) ).
fof(mp4,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp4) ).
fof(t1_FOL,hypothesis,
! [X1,X6,X2,X3,X7,X8,X9,X10] :
( ( organization(X1,X2)
& organization(X6,X3)
& reorganization_free(X1,X2,X2)
& reorganization_free(X6,X3,X3)
& inertia(X1,X7,X2)
& inertia(X6,X8,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X6,X10,X3)
& greater(X8,X7) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X7,X8,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& inertia(X1,X7,X2)
& inertia(X1,X8,X3)
& greater(X3,X2) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_FOL) ).
fof(mp5,axiom,
! [X1,X4] :
( organization(X1,X4)
=> ? [X5] : inertia(X1,X5,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp5) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
inference(assume_negation,[status(cth)],[t3_FOL]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( reorganization_free(X4,X5,X5)
| ~ reorganization_free(X4,X5,X6) )
& ( reorganization_free(X4,X6,X6)
| ~ reorganization_free(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4])])]) ).
fof(c_0_7,negated_conjecture,
( organization(esk1_0,esk4_0)
& organization(esk1_0,esk5_0)
& reorganization_free(esk1_0,esk4_0,esk5_0)
& survival_chance(esk1_0,esk2_0,esk4_0)
& survival_chance(esk1_0,esk3_0,esk5_0)
& greater(esk5_0,esk4_0)
& ~ greater(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,hypothesis,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ organization(X11,X13)
| ~ organization(X12,X14)
| ~ reorganization_free(X11,X13,X13)
| ~ reorganization_free(X12,X14,X14)
| ~ inertia(X11,X15,X13)
| ~ inertia(X12,X16,X14)
| ~ survival_chance(X11,X17,X13)
| ~ survival_chance(X12,X18,X14)
| ~ greater(X16,X15)
| greater(X18,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])]) ).
cnf(c_0_9,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X9,X10,X11,X12,X13] :
( ~ organization(X9,X12)
| ~ organization(X9,X13)
| ~ reorganization_free(X9,X12,X13)
| ~ inertia(X9,X10,X12)
| ~ inertia(X9,X11,X13)
| ~ greater(X13,X12)
| greater(X11,X10) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])])]) ).
fof(c_0_12,plain,
! [X6,X7] :
( ~ organization(X6,X7)
| inertia(X6,esk6_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)],[mp5])])])])]) ).
cnf(c_0_13,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_8]) ).
cnf(c_0_14,negated_conjecture,
survival_chance(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk4_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,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_11]) ).
cnf(c_0_18,plain,
( inertia(X1,esk6_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( greater(X1,esk2_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk1_0,X3,esk4_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5)
| ~ reorganization_free(X4,X5,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16])]) ).
cnf(c_0_20,hypothesis,
( greater(X1,esk6_2(X2,X3))
| ~ greater(X4,X3)
| ~ inertia(X2,X1,X4)
| ~ organization(X2,X3)
| ~ organization(X2,X4)
| ~ reorganization_free(X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( greater(X1,esk2_0)
| ~ greater(X2,esk6_2(esk1_0,esk4_0))
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_15])]) ).
cnf(c_0_22,hypothesis,
( greater(esk6_2(X1,X2),esk6_2(X1,X3))
| ~ greater(X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| ~ reorganization_free(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,hypothesis,
( greater(X1,esk2_0)
| ~ greater(X2,esk4_0)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,esk6_2(esk1_0,X2),X4)
| ~ organization(esk1_0,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(esk1_0,esk4_0,X2)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15])]) ).
cnf(c_0_24,plain,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,hypothesis,
( greater(X1,esk2_0)
| ~ greater(X2,esk4_0)
| ~ survival_chance(esk1_0,X1,X2)
| ~ organization(esk1_0,X2)
| ~ reorganization_free(esk1_0,esk4_0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
survival_chance(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
~ greater(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_10])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 09:33:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.015 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 31
% 0.22/1.40 # Proof object clause steps : 20
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 14
% 0.22/1.40 # Proof object clause conjectures : 11
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 12
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 8
% 0.22/1.40 # Proof object simplifying inferences : 14
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 5
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 12
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 12
% 0.22/1.40 # Processed clauses : 26
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 26
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 20
% 0.22/1.40 # ...of the previous two non-trivial : 14
% 0.22/1.40 # Contextual simplify-reflections : 2
% 0.22/1.40 # Paramodulations : 20
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 26
% 0.22/1.40 # Positive orientable unit clauses : 8
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 17
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 96
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 21
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2
% 0.22/1.40 # Unit Clause-clause subsumption calls : 0
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 1
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 1478
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.016 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.017 s
% 0.22/1.40 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------