%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT045+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:10:12 EDT 2022
% Result : Theorem 0.12s 1.31s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 37 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 36 ( 13 ~; 10 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_4,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(position(X1,X5),position(X1,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma_4) ).
fof(assumption_8,axiom,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(external_ties(X1,X5),external_ties(X1,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_8) ).
fof(assumption_6,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_6) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(position(X1,X5),position(X1,X4)) ),
inference(assume_negation,[status(cth)],[lemma_4]) ).
fof(c_0_4,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| ~ greater(age(X6,X8),age(X6,X7))
| greater(external_ties(X6,X8),external_ties(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_8])]) ).
fof(c_0_5,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& ~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X6,X7,X8,X7,X8] :
( ( ~ greater(external_ties(X6,X8),external_ties(X6,X7))
| greater(position(X6,X8),position(X6,X7))
| ~ organization(X6) )
& ( external_ties(X6,X8) != external_ties(X6,X7)
| position(X6,X8) = position(X6,X7)
| ~ organization(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_6])])])])]) ).
cnf(c_0_7,plain,
( greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : MGT045+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.08 % Command : run_ET %s %d
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Thu Jun 9 11:47:22 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.12/1.31 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.12/1.31 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.12/1.31 # Preprocessing time : 0.013 s
% 0.12/1.31
% 0.12/1.31 # Proof found!
% 0.12/1.31 # SZS status Theorem
% 0.12/1.31 # SZS output start CNFRefutation
% See solution above
% 0.12/1.31 # Proof object total steps : 14
% 0.12/1.31 # Proof object clause steps : 7
% 0.12/1.31 # Proof object formula steps : 7
% 0.12/1.31 # Proof object conjectures : 8
% 0.12/1.31 # Proof object clause conjectures : 5
% 0.12/1.31 # Proof object formula conjectures : 3
% 0.12/1.31 # Proof object initial clauses used : 5
% 0.12/1.31 # Proof object initial formulas used : 3
% 0.12/1.31 # Proof object generating inferences : 2
% 0.12/1.31 # Proof object simplifying inferences : 5
% 0.12/1.31 # Training examples: 0 positive, 0 negative
% 0.12/1.31 # Parsed axioms : 9
% 0.12/1.31 # Removed by relevancy pruning/SinE : 4
% 0.12/1.31 # Initial clauses : 8
% 0.12/1.31 # Removed in clause preprocessing : 0
% 0.12/1.31 # Initial clauses in saturation : 8
% 0.12/1.31 # Processed clauses : 10
% 0.12/1.31 # ...of these trivial : 0
% 0.12/1.31 # ...subsumed : 0
% 0.12/1.31 # ...remaining for further processing : 10
% 0.12/1.31 # Other redundant clauses eliminated : 0
% 0.12/1.31 # Clauses deleted for lack of memory : 0
% 0.12/1.31 # Backward-subsumed : 0
% 0.12/1.31 # Backward-rewritten : 0
% 0.12/1.31 # Generated clauses : 10
% 0.12/1.31 # ...of the previous two non-trivial : 9
% 0.12/1.31 # Contextual simplify-reflections : 0
% 0.12/1.31 # Paramodulations : 10
% 0.12/1.31 # Factorizations : 0
% 0.12/1.31 # Equation resolutions : 0
% 0.12/1.31 # Current number of processed clauses : 10
% 0.12/1.31 # Positive orientable unit clauses : 3
% 0.12/1.31 # Positive unorientable unit clauses: 0
% 0.12/1.31 # Negative unit clauses : 1
% 0.12/1.31 # Non-unit-clauses : 6
% 0.12/1.31 # Current number of unprocessed clauses: 7
% 0.12/1.31 # ...number of literals in the above : 13
% 0.12/1.31 # Current number of archived formulas : 0
% 0.12/1.31 # Current number of archived clauses : 0
% 0.12/1.31 # Clause-clause subsumption calls (NU) : 6
% 0.12/1.31 # Rec. Clause-clause subsumption calls : 6
% 0.12/1.31 # Non-unit clause-clause subsumptions : 0
% 0.12/1.31 # Unit Clause-clause subsumption calls : 0
% 0.12/1.31 # Rewrite failures with RHS unbound : 0
% 0.12/1.31 # BW rewrite match attempts : 0
% 0.12/1.31 # BW rewrite match successes : 0
% 0.12/1.31 # Condensation attempts : 0
% 0.12/1.31 # Condensation successes : 0
% 0.12/1.31 # Termbank termtop insertions : 737
% 0.12/1.31
% 0.12/1.31 # -------------------------------------------------
% 0.12/1.31 # User time : 0.013 s
% 0.12/1.31 # System time : 0.001 s
% 0.12/1.31 # Total time : 0.014 s
% 0.12/1.31 # Maximum resident set size: 2808 pages
%------------------------------------------------------------------------------