%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT058+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:12:58 PM UTC 2026
% Result : Theorem 1.58s 6.29s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 10
% Syntax : Number of formulae : 112 ( 21 unt; 1 def)
% Number of atoms : 336 ( 69 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 285 ( 107 ~; 124 |; 33 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn 129 !; 7 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( smaller_or_equal(X0,X1)
<=> ( X0 = X1
| smaller(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(f2,axiom,
! [X0,X1] :
( greater_or_equal(X0,X1)
<=> ( X0 = X1
| greater(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_greater_or_equal) ).
fof(f3,axiom,
! [X0,X1] :
( smaller(X0,X1)
<=> greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).
fof(f4,axiom,
! [X0,X1] :
~ ( greater(X1,X0)
& greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_strict) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( greater(X1,X2)
& greater(X0,X1) )
=> greater(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(f6,axiom,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| smaller(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_comparable) ).
fof(f7,axiom,
! [X0] :
( fragile_position(X0)
<=> ! [X1] :
( ( greater(age(X0,X1),sigma)
=> ~ positional_advantage(X0,X1) )
& ( smaller_or_equal(age(X0,X1),sigma)
=> positional_advantage(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_3) ).
fof(f8,axiom,
! [X0] :
( robust_position(X0)
<=> ! [X1] :
( ( greater(age(X0,X1),tau)
=> positional_advantage(X0,X1) )
& ( smaller_or_equal(age(X0,X1),tau)
=> ~ positional_advantage(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_4) ).
fof(f9,conjecture,
! [X0] :
( ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : age(X0,X1) = zero
& organization(X0) )
=> ~ ( robust_position(X0)
& fragile_position(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : age(X0,X1) = zero
& organization(X0) )
=> ~ ( robust_position(X0)
& fragile_position(X0) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0] :
( robust_position(X0)
=> ! [X1] :
( ( greater(age(X0,X1),tau)
=> positional_advantage(X0,X1) )
& ( smaller_or_equal(age(X0,X1),tau)
=> ~ positional_advantage(X0,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f12,plain,
! [X0] :
( fragile_position(X0)
=> ! [X1] :
( ( greater(age(X0,X1),sigma)
=> ~ positional_advantage(X0,X1) )
& ( smaller_or_equal(age(X0,X1),sigma)
=> positional_advantage(X0,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f13,plain,
! [X0,X1] :
( ( X0 = X1
| smaller(X0,X1) )
=> smaller_or_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f14,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
=> ( X0 = X1
| greater(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
~ ! [X0] :
( ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : age(X0,X1) = zero )
=> ~ ( robust_position(X0)
& fragile_position(X0) ) ),
inference(pure_predicate_removal,[],[f10]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 != X1
& ~ smaller(X0,X1) )
| smaller_or_equal(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0] :
( ~ fragile_position(X0)
| ! [X1] :
( ( ~ greater(age(X0,X1),sigma)
| ~ positional_advantage(X0,X1) )
& ( ~ smaller_or_equal(age(X0,X1),sigma)
| positional_advantage(X0,X1) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f23,plain,
! [X0] :
( ~ robust_position(X0)
| ! [X1] :
( ( ~ greater(age(X0,X1),tau)
| positional_advantage(X0,X1) )
& ( ~ smaller_or_equal(age(X0,X1),tau)
| ~ positional_advantage(X0,X1) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f24,plain,
? [X0] :
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : age(X0,X1) = zero
& robust_position(X0)
& fragile_position(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f25,plain,
? [X0] :
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : age(X0,X1) = zero
& robust_position(X0)
& fragile_position(X0) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( ~ smaller(X0,X1)
| greater(X1,X0) )
& ( ~ greater(X1,X0)
| smaller(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f27,plain,
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& zero = age(sK0,sK1)
& robust_position(sK0)
& fragile_position(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f25]) ).
fof(f28,plain,
! [X0,X1] :
( X0 != X1
| smaller_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1] :
( ~ smaller(X0,X1)
| smaller_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| smaller(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| smaller(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X0,X1] :
( ~ fragile_position(X0)
| ~ smaller_or_equal(age(X0,X1),sigma)
| positional_advantage(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0,X1] :
( ~ robust_position(X0)
| ~ smaller_or_equal(age(X0,X1),tau)
| ~ positional_advantage(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
greater_or_equal(tau,zero),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
greater_or_equal(sigma,zero),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
zero = age(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
robust_position(sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
fragile_position(sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f28]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( smaller_or_equal(X0,X1)
| ~ smaller(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_50,plain,
! [X0: $i] : smaller_or_equal(X0,X0),
inference(cnf_transformation,[],[f45]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ~ greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( smaller(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(X0,X2)
| ~ greater(X1,X2)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| smaller(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( positional_advantage(X0,X1)
| ~ fragile_position(X0)
| ~ smaller_or_equal(age(X0,X1),sigma) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ robust_position(X0)
| ~ positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),tau) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_61,negated_conjecture,
fragile_position(sK0),
inference(cnf_transformation,[],[f44]) ).
tcf(c_62,negated_conjecture,
robust_position(sK0),
inference(cnf_transformation,[],[f43]) ).
tcf(c_63,negated_conjecture,
age(sK0,sK1) = zero,
inference(cnf_transformation,[],[f42]) ).
tcf(c_64,negated_conjecture,
greater_or_equal(sigma,zero),
inference(cnf_transformation,[],[f41]) ).
tcf(c_65,negated_conjecture,
greater_or_equal(tau,zero),
inference(cnf_transformation,[],[f40]) ).
tcf(c_211,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ( X1 != zero )
| ( X0 != sigma ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_64]) ).
tcf(c_212,plain,
( greater(sigma,zero)
| ( sigma = zero ) ),
inference(unflattening,[status(thm)],[c_211]) ).
tcf(c_219,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ( X1 != zero )
| ( X0 != tau ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_65]) ).
tcf(c_220,plain,
( greater(tau,zero)
| ( tau = zero ) ),
inference(unflattening,[status(thm)],[c_219]) ).
tcf(c_240,plain,
! [X0: $i,X1: $i] :
( positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),sigma)
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_57,c_61]) ).
tcf(c_241,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ~ smaller_or_equal(age(sK0,X0),sigma) ),
inference(unflattening,[status(thm)],[c_240]) ).
tcf(c_262,plain,
! [X0: $i,X1: $i] :
( ~ positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),tau)
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_62]) ).
tcf(c_263,plain,
! [X0: $i] :
( ~ positional_advantage(sK0,X0)
| ~ smaller_or_equal(age(sK0,X0),tau) ),
inference(unflattening,[status(thm)],[c_262]) ).
tcf(c_275,plain,
! [X0: $i,X1: $i,X2: $i] :
( positional_advantage(sK0,X0)
| ~ smaller(X1,X2)
| ( X2 != sigma )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_241]) ).
tcf(c_276,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ~ smaller(age(sK0,X0),sigma) ),
inference(unflattening,[status(thm)],[c_275]) ).
tcf(c_284,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ positional_advantage(sK0,X0)
| ~ smaller(X1,X2)
| ( X2 != tau )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_263]) ).
tcf(c_285,plain,
! [X0: $i] :
( ~ positional_advantage(sK0,X0)
| ~ smaller(age(sK0,X0),tau) ),
inference(unflattening,[status(thm)],[c_284]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i] :
( positional_advantage(sK0,X0)
| ( X1 != sigma )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_241]) ).
tcf(c_294,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ( age(sK0,X0) != sigma ) ),
inference(unflattening,[status(thm)],[c_293]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i] :
( ~ positional_advantage(sK0,X0)
| ( X1 != tau )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_263]) ).
tcf(c_303,plain,
! [X0: $i] :
( ~ positional_advantage(sK0,X0)
| ( age(sK0,X0) != tau ) ),
inference(unflattening,[status(thm)],[c_302]) ).
tcf(c_333,plain,
! [X0: $i,X1: $i,X2: $i] :
( positional_advantage(sK0,X0)
| greater(X1,X2)
| ( X1 = X2 )
| ( X2 != sigma )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_56,c_276]) ).
tcf(c_334,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| greater(age(sK0,X0),sigma)
| ( age(sK0,X0) = sigma ) ),
inference(unflattening,[status(thm)],[c_333]) ).
tcf(c_345,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(X1,X2)
| ( X1 = X2 )
| ~ positional_advantage(sK0,X0)
| ( X2 != tau )
| ( age(sK0,X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_56,c_285]) ).
tcf(c_346,plain,
! [X0: $i] :
( greater(age(sK0,X0),tau)
| ( age(sK0,X0) = tau )
| ~ positional_advantage(sK0,X0) ),
inference(unflattening,[status(thm)],[c_345]) ).
tcf(c_357,plain,
! [X0: $i,X1: $i,X2: $i] :
( positional_advantage(sK0,X1)
| ~ greater(X0,X2)
| ( X0 != sigma )
| ( age(sK0,X1) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_276]) ).
tcf(c_358,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ~ greater(sigma,age(sK0,X0)) ),
inference(unflattening,[status(thm)],[c_357]) ).
tcf(c_530,plain,
! [X0: $i] :
( greater(age(sK0,X0),sigma)
| positional_advantage(sK0,X0) ),
inference(prop_impl_just,[status(thm)],[c_294,c_334]) ).
tcf(c_531,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| greater(age(sK0,X0),sigma) ),
inference(renaming,[status(thm)],[c_530]) ).
tcf(c_534,plain,
! [X0: $i] :
( greater(age(sK0,X0),tau)
| ~ positional_advantage(sK0,X0) ),
inference(prop_impl_just,[status(thm)],[c_303,c_346]) ).
tcf(c_540,plain,
( greater(sigma,zero)
| ( sigma = zero ) ),
inference(prop_impl_just,[status(thm)],[c_212]) ).
tcf(c_544,plain,
( greater(tau,zero)
| ( tau = zero ) ),
inference(prop_impl_just,[status(thm)],[c_220]) ).
tcf(c_554,plain,
! [X0: $i] :
( ~ greater(sigma,age(sK0,X0))
| positional_advantage(sK0,X0) ),
inference(prop_impl_just,[status(thm)],[c_358]) ).
tcf(c_555,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ~ greater(sigma,age(sK0,X0)) ),
inference(renaming,[status(thm)],[c_554]) ).
tcf(c_836,definition,
iPr_def_10 = age(sK0,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_837,negated_conjecture,
iPr_def_10 = zero,
inference(demodulation,[status(thm)],[c_63,c_836]) ).
tcf(c_1170,plain,
( greater(sigma,iPr_def_10)
| ( sigma = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_540,c_837]) ).
tcf(c_1173,plain,
( greater(tau,iPr_def_10)
| ( tau = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_544,c_837]) ).
tcf(c_1184,plain,
( ( sigma = iPr_def_10 )
| ~ greater(iPr_def_10,sigma) ),
inference(superposition,[status(thm)],[c_1170,c_54]) ).
tcf(c_1185,plain,
( ( tau = iPr_def_10 )
| ~ greater(iPr_def_10,tau) ),
inference(superposition,[status(thm)],[c_1173,c_54]) ).
tcf(c_1202,plain,
( positional_advantage(sK0,sK1)
| greater(iPr_def_10,sigma) ),
inference(superposition,[status(thm)],[c_836,c_531]) ).
tcf(c_1218,plain,
( greater(iPr_def_10,tau)
| ~ positional_advantage(sK0,sK1) ),
inference(superposition,[status(thm)],[c_836,c_534]) ).
tcf(c_1230,plain,
! [X0: $i] :
( greater(sigma,X0)
| ( sigma = iPr_def_10 )
| ~ greater(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_1170,c_55]) ).
tcf(c_1256,plain,
( greater(iPr_def_10,tau)
| greater(iPr_def_10,sigma) ),
inference(superposition,[status(thm)],[c_1202,c_1218]) ).
tcf(c_1264,plain,
( greater(iPr_def_10,sigma)
| ~ greater(tau,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1256,c_54]) ).
tcf(c_1265,plain,
( greater(iPr_def_10,sigma)
| ( tau = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1256,c_1185]) ).
tcf(c_1285,plain,
( ( tau = iPr_def_10 )
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1265,c_1184]) ).
tcf(c_1308,plain,
( greater(iPr_def_10,sigma)
| greater(sigma,tau)
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1256,c_1230]) ).
tcf(c_1346,plain,
( greater(iPr_def_10,sigma)
| ( sigma = iPr_def_10 )
| ~ greater(iPr_def_10,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1285,c_1264]) ).
tcf(c_1347,plain,
( greater(iPr_def_10,iPr_def_10)
| greater(iPr_def_10,sigma)
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1285,c_1256]) ).
tcf(c_1357,plain,
( greater(iPr_def_10,sigma)
| ( sigma = iPr_def_10 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1347,c_1346]) ).
tcf(c_1366,plain,
sigma = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_1308,c_1184,c_1357]) ).
tcf(c_1374,plain,
( positional_advantage(sK0,sK1)
| greater(iPr_def_10,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_1202,c_1366]) ).
tcf(c_1434,plain,
! [X0: $i] :
( positional_advantage(sK0,X0)
| ~ greater(iPr_def_10,age(sK0,X0)) ),
inference(light_normalisation,[status(thm)],[c_555,c_1366]) ).
tcf(c_1441,plain,
( positional_advantage(sK0,sK1)
| ~ greater(iPr_def_10,iPr_def_10) ),
inference(superposition,[status(thm)],[c_836,c_1434]) ).
tcf(c_1444,plain,
positional_advantage(sK0,sK1),
inference(global_subsumption_just,[status(thm)],[c_1374,c_1374,c_1441]) ).
tcf(c_1446,plain,
greater(iPr_def_10,tau),
inference(backward_subsumption_resolution,[status(thm)],[c_1218,c_1444]) ).
tcf(c_1447,plain,
tau = iPr_def_10,
inference(backward_subsumption_resolution,[status(thm)],[c_1185,c_1446]) ).
tcf(c_1456,plain,
greater(iPr_def_10,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_1446,c_1447]) ).
tcf(c_1458,plain,
~ greater(iPr_def_10,iPr_def_10),
inference(superposition,[status(thm)],[c_1456,c_54]) ).
tcf(c_1459,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1458,c_1456]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT058+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.37 % Computer : n026.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 01:18:44 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/5.42
% 0.13/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.42
% 0.13/5.42 % Detected problem language: tptp
% 0.13/5.44 % Proving...
% 1.58/6.29 % SZS status Started for theBenchmark.p
% 1.58/6.29 % SZS status Theorem for theBenchmark.p
% 1.58/6.29
% 1.58/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.58/6.29
% 1.58/6.29 % ------ iProver source info
% 1.58/6.29
% 1.58/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.58/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.58/6.29 % git: non_committed_changes: false
% 1.58/6.29
% 1.58/6.29 % ------ Parsing...
% 1.58/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.58/6.29
% 1.58/6.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 1.58/6.29
% 1.58/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.58/6.29
% 1.58/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.58/6.29 % ------ Proving...
% 1.58/6.29 % ------ Problem Properties
% 1.58/6.29
% 1.58/6.29 %
% 1.58/6.29 % clauses 15
% 1.58/6.29 % conjectures 1
% 1.58/6.29 % EPR 6
% 1.58/6.29 % Horn 11
% 1.58/6.29 % unary 2
% 1.58/6.29 % binary 11
% 1.58/6.29 % lits 30
% 1.58/6.29 % lits eq 7
% 1.58/6.29 % fd_pure 0
% 1.58/6.29 % fd_pseudo 0
% 1.58/6.29 % fd_cond 0
% 1.58/6.29 % fd_pseudo_cond 1
% 1.58/6.29 % AC symbols 0
% 1.58/6.29
% 1.58/6.29 % ------ Schedule dynamic 5 is on
% 1.58/6.29
% 1.58/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/6.29
% 1.58/6.29
% 1.58/6.29 % ------
% 1.58/6.29 % Current options:
% 1.58/6.29 % ------
% 1.58/6.29
% 1.58/6.29
% 1.58/6.29 %
% 1.58/6.29
% 1.58/6.29 % ------ Proving...
% 1.58/6.29 %
% 1.58/6.29
% 1.58/6.29 % SZS status Theorem for theBenchmark.p
% 1.58/6.29
% 1.58/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/6.29
% 1.58/6.29
%------------------------------------------------------------------------------