%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.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:10:16 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 138 ( 20 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 145 ( 48 ~; 56 |; 30 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 10 sgn 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_10,conjecture,
! [X1] :
( ( organization(X1)
& ? [X5] : age(X1,X5) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma_10) ).
fof(definition_4,axiom,
! [X1] :
( robust_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),tau)
=> ~ positional_advantage(X1,X4) )
& ( greater(age(X1,X4),tau)
=> positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_4) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(definition_smaller,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).
fof(definition_3,axiom,
! [X1] :
( fragile_position(X1)
<=> ! [X4] :
( ( smaller_or_equal(age(X1,X4),sigma)
=> positional_advantage(X1,X4) )
& ( greater(age(X1,X4),sigma)
=> ~ positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_3) ).
fof(definition_greater_or_equal,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( greater(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_greater_or_equal) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( organization(X1)
& ? [X5] : age(X1,X5) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
inference(assume_negation,[status(cth)],[lemma_10]) ).
fof(c_0_7,plain,
! [X5,X6,X6,X5] :
( ( ~ smaller_or_equal(age(X5,X6),tau)
| ~ positional_advantage(X5,X6)
| ~ robust_position(X5) )
& ( ~ greater(age(X5,X6),tau)
| positional_advantage(X5,X6)
| ~ robust_position(X5) )
& ( greater(age(X5,esk4_1(X5)),tau)
| smaller_or_equal(age(X5,esk3_1(X5)),tau)
| robust_position(X5) )
& ( ~ positional_advantage(X5,esk4_1(X5))
| smaller_or_equal(age(X5,esk3_1(X5)),tau)
| robust_position(X5) )
& ( greater(age(X5,esk4_1(X5)),tau)
| positional_advantage(X5,esk3_1(X5))
| robust_position(X5) )
& ( ~ positional_advantage(X5,esk4_1(X5))
| positional_advantage(X5,esk3_1(X5))
| robust_position(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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)],[definition_4])])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( organization(esk1_0)
& age(esk1_0,esk2_0) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero)
& fragile_position(esk1_0)
& robust_position(esk1_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( ~ smaller_or_equal(X3,X4)
| smaller(X3,X4)
| X3 = X4 )
& ( ~ smaller(X3,X4)
| smaller_or_equal(X3,X4) )
& ( X3 != X4
| smaller_or_equal(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])])]) ).
fof(c_0_10,plain,
! [X3,X4,X3,X4] :
( ( ~ smaller(X3,X4)
| greater(X4,X3) )
& ( ~ greater(X4,X3)
| smaller(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])])])]) ).
fof(c_0_11,plain,
! [X5,X6,X6,X5] :
( ( ~ smaller_or_equal(age(X5,X6),sigma)
| positional_advantage(X5,X6)
| ~ fragile_position(X5) )
& ( ~ greater(age(X5,X6),sigma)
| ~ positional_advantage(X5,X6)
| ~ fragile_position(X5) )
& ( greater(age(X5,esk6_1(X5)),sigma)
| smaller_or_equal(age(X5,esk5_1(X5)),sigma)
| fragile_position(X5) )
& ( positional_advantage(X5,esk6_1(X5))
| smaller_or_equal(age(X5,esk5_1(X5)),sigma)
| fragile_position(X5) )
& ( greater(age(X5,esk6_1(X5)),sigma)
| ~ positional_advantage(X5,esk5_1(X5))
| fragile_position(X5) )
& ( positional_advantage(X5,esk6_1(X5))
| ~ positional_advantage(X5,esk5_1(X5))
| fragile_position(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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)],[definition_3])])])])])])])]) ).
cnf(c_0_12,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
age(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
robust_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
fragile_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_20,plain,
( smaller_or_equal(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_18])]) ).
fof(c_0_22,plain,
! [X3,X4,X3,X4] :
( ( ~ greater_or_equal(X3,X4)
| greater(X3,X4)
| X3 = X4 )
& ( ~ greater(X3,X4)
| greater_or_equal(X3,X4) )
& ( X3 != X4
| greater_or_equal(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_greater_or_equal])])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| ~ greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
greater_or_equal(tau,zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ greater(tau,zero)
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( tau = zero
| greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
greater_or_equal(sigma,zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( tau = zero
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( sigma = zero
| greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_32,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( sigma = zero
| tau = zero ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( sigma = zero
| ~ positional_advantage(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
sigma = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
positional_advantage(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_36]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
~ greater(tau,zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_37])]) ).
cnf(c_0_39,negated_conjecture,
tau = zero,
inference(sr,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_37])]),c_0_39]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n028.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 12:23:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 41
% 0.24/1.42 # Proof object clause steps : 28
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 23
% 0.24/1.42 # Proof object clause conjectures : 20
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 11
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 12
% 0.24/1.42 # Proof object simplifying inferences : 19
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 9
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 29
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 29
% 0.24/1.42 # Processed clauses : 55
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 2
% 0.24/1.42 # ...remaining for further processing : 52
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 25
% 0.24/1.42 # Generated clauses : 60
% 0.24/1.42 # ...of the previous two non-trivial : 67
% 0.24/1.42 # Contextual simplify-reflections : 1
% 0.24/1.42 # Paramodulations : 55
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 2
% 0.24/1.42 # Current number of processed clauses : 24
% 0.24/1.42 # Positive orientable unit clauses : 9
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 14
% 0.24/1.42 # Current number of unprocessed clauses: 15
% 0.24/1.42 # ...number of literals in the above : 45
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 26
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 92
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 78
% 0.24/1.42 # Non-unit clause-clause subsumptions : 2
% 0.24/1.42 # Unit Clause-clause subsumption calls : 21
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 13
% 0.24/1.42 # BW rewrite match successes : 3
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 2145
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.020 s
% 0.24/1.42 # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------