%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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 : Tue Sep 29 12:02:39 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 17
% Syntax : Number of formulae : 136 ( 25 unt; 6 def)
% Number of atoms : 377 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 430 ( 189 ~; 189 |; 34 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 7 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 98 ( 0 sgn 91 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ( observational_period(X0)
& propagation_strategy(first_movers)
& propagation_strategy(efficient_producers)
& ! [X1] :
( ( environment(X1)
& in_environment(X0,X1) )
=> selection_favors(efficient_producers,first_movers,end_time(X1)) ) )
=> selection_favors(efficient_producers,first_movers,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy) ).
fof(f2,axiom,
! [X0] :
( ( observational_period(X0)
& slow_change(X0) )
=> ! [X1] :
( ( environment(X1)
& in_environment(X0,X1) )
=> ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point) ).
fof(f3,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets1) ).
fof(f4,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets2) ).
fof(f5,axiom,
! [X0,X1] :
( ( environment(X0)
& greater_or_equal(X1,start_time(X0))
& greater_or_equal(end_time(X0),X1) )
=> in_environment(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_in_environment) ).
fof(f6,axiom,
! [X0,X1] :
( ( environment(X0)
& in_environment(X0,X1) )
=> greater_or_equal(end_time(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_end_point) ).
fof(f7,axiom,
! [X0] :
( environment(X0)
=> greater_or_equal(critical_point(X0),start_time(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_of_critical_point) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( greater(X0,X1)
& greater(X1,X2) )
=> greater(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(f9,axiom,
! [X0,X1] :
( greater_or_equal(X0,X1)
<=> ( greater(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(f11,axiom,
! [X0,X1] :
( ( environment(X0)
& in_environment(X0,X1)
& greater(X1,critical_point(X0)) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8) ).
fof(f12,conjecture,
! [X0] :
( ( observational_period(X0)
& slow_change(X0) )
=> selection_favors(efficient_producers,first_movers,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( ( observational_period(X0)
& slow_change(X0) )
=> selection_favors(efficient_producers,first_movers,X0) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ? [X1] :
( ~ selection_favors(efficient_producers,first_movers,end_time(X1))
& environment(X1)
& in_environment(X0,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ? [X1] :
( ~ selection_favors(efficient_producers,first_movers,end_time(X1))
& environment(X1)
& in_environment(X0,X1) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) )
| ~ environment(X1)
| ~ in_environment(X0,X1) )
| ~ observational_period(X0)
| ~ slow_change(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) )
| ~ environment(X1)
| ~ in_environment(X0,X1) )
| ~ observational_period(X0)
| ~ slow_change(X0) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( in_environment(X0,X1)
| ~ environment(X0)
| ~ greater_or_equal(X1,start_time(X0))
| ~ greater_or_equal(end_time(X0),X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f19,plain,
! [X0,X1] :
( in_environment(X0,X1)
| ~ environment(X0)
| ~ greater_or_equal(X1,start_time(X0))
| ~ greater_or_equal(end_time(X0),X1) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( greater_or_equal(end_time(X0),X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f21,plain,
! [X0,X1] :
( greater_or_equal(end_time(X0),X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0] :
( greater_or_equal(critical_point(X0),start_time(X0))
| ~ environment(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f23,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X0,X1)
| ~ greater(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X0,X1)
| ~ greater(X1,X2) ),
inference(flattening,[],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( selection_favors(efficient_producers,first_movers,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(X1,critical_point(X0)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f28,plain,
! [X0,X1] :
( selection_favors(efficient_producers,first_movers,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(X1,critical_point(X0)) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
? [X0] :
( ~ selection_favors(efficient_producers,first_movers,X0)
& observational_period(X0)
& slow_change(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f30,plain,
? [X0] :
( ~ selection_favors(efficient_producers,first_movers,X0)
& observational_period(X0)
& slow_change(X0) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
& environment(sK0(X0))
& in_environment(X0,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f15]) ).
fof(f32,plain,
! [X0] :
( ! [X1] :
( ( in_environment(X1,sK1(X1))
& greater(sK1(X1),critical_point(X1)) )
| ~ environment(X1)
| ~ in_environment(X0,X1) )
| ~ observational_period(X0)
| ~ slow_change(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X1))],[f17]) ).
fof(f33,plain,
! [X0,X1] :
( ( greater_or_equal(X0,X1)
| ( ~ greater(X0,X1)
& X0 != X1 ) )
& ( greater(X0,X1)
| X0 = X1
| ~ greater_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f34,plain,
! [X0,X1] :
( ( greater_or_equal(X0,X1)
| ( ~ greater(X0,X1)
& X0 != X1 ) )
& ( greater(X0,X1)
| X0 = X1
| ~ greater_or_equal(X0,X1) ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
( ~ selection_favors(efficient_producers,first_movers,sK2)
& observational_period(sK2)
& slow_change(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f30]) ).
fof(f36,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| in_environment(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f37,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| environment(sK0(X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f38,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0))) ),
inference(cnf_transformation,[],[f31]) ).
fof(f39,plain,
! [X0,X1] :
( ~ slow_change(X0)
| ~ environment(X1)
| ~ in_environment(X0,X1)
| ~ observational_period(X0)
| greater(sK1(X1),critical_point(X1)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f40,plain,
! [X0,X1] :
( ~ slow_change(X0)
| ~ environment(X1)
| ~ in_environment(X0,X1)
| ~ observational_period(X0)
| in_environment(X1,sK1(X1)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f41,plain,
propagation_strategy(first_movers),
inference(cnf_transformation,[],[f3]) ).
fof(f42,plain,
propagation_strategy(efficient_producers),
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0,X1] :
( ~ environment(X0)
| in_environment(X0,X1)
| ~ greater_or_equal(X1,start_time(X0))
| ~ greater_or_equal(end_time(X0),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f44,plain,
! [X0,X1] :
( ~ environment(X0)
| greater_or_equal(end_time(X0),X1)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
! [X0] :
( ~ environment(X0)
| greater_or_equal(critical_point(X0),start_time(X0)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ greater(X0,X1)
| greater(X0,X2)
| ~ greater(X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f47,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f48,plain,
! [X0,X1] :
( X0 != X1
| greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f49,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f51,plain,
! [X0,X1] :
( ~ environment(X0)
| selection_favors(efficient_producers,first_movers,X1)
| ~ in_environment(X0,X1)
| ~ greater(X1,critical_point(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
slow_change(sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f53,plain,
observational_period(sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f54,plain,
~ selection_favors(efficient_producers,first_movers,sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f55,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(efficient_producers)
| in_environment(X0,sK0(X0)) ),
inference(forward_subsumption_resolution,[],[f36,f41]) ).
fof(f56,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(efficient_producers)
| environment(sK0(X0)) ),
inference(forward_subsumption_resolution,[],[f37,f41]) ).
fof(f57,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0))) ),
inference(forward_subsumption_resolution,[],[f38,f41]) ).
fof(f58,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| in_environment(X0,sK0(X0)) ),
inference(forward_subsumption_resolution,[],[f55,f42]) ).
fof(f59,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| environment(sK0(X0)) ),
inference(forward_subsumption_resolution,[],[f56,f42]) ).
fof(f60,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0))) ),
inference(forward_subsumption_resolution,[],[f57,f42]) ).
fof(f61,plain,
! [X0] : greater_or_equal(X0,X0),
inference(equality_resolution,[],[f48]) ).
fof(f63,plain,
( selection_favors(efficient_producers,first_movers,sK2)
| environment(sK0(sK2)) ),
inference(resolution,[],[f59,f53]) ).
fof(f64,plain,
environment(sK0(sK2)),
inference(forward_subsumption_resolution,[],[f63,f54]) ).
fof(f65,plain,
( selection_favors(efficient_producers,first_movers,sK2)
| in_environment(sK2,sK0(sK2)) ),
inference(resolution,[],[f58,f53]) ).
fof(f66,plain,
in_environment(sK2,sK0(sK2)),
inference(forward_subsumption_resolution,[],[f65,f54]) ).
fof(f67,plain,
! [X0] :
( ~ in_environment(sK0(sK2),X0)
| greater_or_equal(end_time(sK0(sK2)),X0) ),
inference(resolution,[],[f64,f44]) ).
fof(f68,plain,
greater_or_equal(critical_point(sK0(sK2)),start_time(sK0(sK2))),
inference(resolution,[],[f64,f45]) ).
fof(f69,plain,
( selection_favors(efficient_producers,first_movers,sK2)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))) ),
inference(resolution,[],[f60,f53]) ).
fof(f70,plain,
~ selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))),
inference(forward_subsumption_resolution,[],[f69,f54]) ).
fof(f71,plain,
! [X0] :
( ~ greater(X0,critical_point(sK0(sK2)))
| ~ in_environment(sK0(sK2),X0)
| selection_favors(efficient_producers,first_movers,X0) ),
inference(resolution,[],[f51,f64]) ).
fof(f72,plain,
! [X0] :
( ~ environment(X0)
| ~ in_environment(sK2,X0)
| ~ observational_period(sK2)
| in_environment(X0,sK1(X0)) ),
inference(resolution,[],[f40,f52]) ).
fof(f73,plain,
! [X0] :
( ~ environment(X0)
| ~ in_environment(sK2,X0)
| in_environment(X0,sK1(X0)) ),
inference(forward_subsumption_resolution,[],[f72,f53]) ).
fof(f74,plain,
( critical_point(sK0(sK2)) = start_time(sK0(sK2))
| greater(critical_point(sK0(sK2)),start_time(sK0(sK2))) ),
inference(resolution,[],[f68,f47]) ).
fof(f76,definition,
( spl3_1
<=> greater(critical_point(sK0(sK2)),start_time(sK0(sK2))) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f78,plain,
( greater(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f80,definition,
( spl3_2
<=> critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f82,plain,
( critical_point(sK0(sK2)) = start_time(sK0(sK2))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f83,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f74,f80,f76]) ).
fof(f84,plain,
! [X0] :
( ~ greater_or_equal(X0,start_time(sK0(sK2)))
| in_environment(sK0(sK2),X0)
| ~ greater_or_equal(end_time(sK0(sK2)),X0) ),
inference(resolution,[],[f43,f64]) ).
fof(f85,plain,
( ! [X0] :
( ~ greater_or_equal(X0,critical_point(sK0(sK2)))
| in_environment(sK0(sK2),X0)
| ~ greater_or_equal(end_time(sK0(sK2)),X0) )
| ~ spl3_2 ),
inference(forward_demodulation,[],[f84,f82]) ).
fof(f87,plain,
! [X0] :
( ~ environment(X0)
| ~ in_environment(sK2,X0)
| ~ observational_period(sK2)
| greater(sK1(X0),critical_point(X0)) ),
inference(resolution,[],[f39,f52]) ).
fof(f88,plain,
! [X0] :
( ~ environment(X0)
| ~ in_environment(sK2,X0)
| greater(sK1(X0),critical_point(X0)) ),
inference(forward_subsumption_resolution,[],[f87,f53]) ).
fof(f89,plain,
( ~ in_environment(sK2,sK0(sK2))
| in_environment(sK0(sK2),sK1(sK0(sK2))) ),
inference(resolution,[],[f73,f64]) ).
fof(f90,plain,
in_environment(sK0(sK2),sK1(sK0(sK2))),
inference(forward_subsumption_resolution,[],[f89,f66]) ).
fof(f93,plain,
( ~ in_environment(sK2,sK0(sK2))
| greater(sK1(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(resolution,[],[f88,f64]) ).
fof(f94,plain,
greater(sK1(sK0(sK2)),critical_point(sK0(sK2))),
inference(forward_subsumption_resolution,[],[f93,f66]) ).
fof(f95,plain,
! [X0] :
( ~ greater(critical_point(sK0(sK2)),X0)
| greater(sK1(sK0(sK2)),X0) ),
inference(resolution,[],[f94,f46]) ).
fof(f97,plain,
greater_or_equal(end_time(sK0(sK2)),sK1(sK0(sK2))),
inference(resolution,[],[f67,f90]) ).
fof(f99,plain,
( ~ in_environment(sK0(sK2),sK1(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,sK1(sK0(sK2))) ),
inference(resolution,[],[f71,f94]) ).
fof(f100,plain,
selection_favors(efficient_producers,first_movers,sK1(sK0(sK2))),
inference(forward_subsumption_resolution,[],[f99,f90]) ).
fof(f104,definition,
( spl3_3
<=> greater_or_equal(end_time(sK0(sK2)),critical_point(sK0(sK2))) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f105,plain,
( greater_or_equal(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f106,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| spl3_3 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f112,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| greater(end_time(sK0(sK2)),sK1(sK0(sK2))) ),
inference(resolution,[],[f97,f47]) ).
fof(f114,definition,
( spl3_5
<=> greater(end_time(sK0(sK2)),sK1(sK0(sK2))) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f116,plain,
( greater(end_time(sK0(sK2)),sK1(sK0(sK2)))
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f114]) ).
fof(f118,definition,
( spl3_6
<=> end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f120,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f121,plain,
( spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f112,f118,f114]) ).
fof(f123,plain,
( ! [X0] :
( ~ greater(sK1(sK0(sK2)),X0)
| greater(end_time(sK0(sK2)),X0) )
| ~ spl3_5 ),
inference(resolution,[],[f116,f46]) ).
fof(f125,plain,
( greater(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| ~ spl3_5 ),
inference(resolution,[],[f123,f94]) ).
fof(f127,plain,
( ~ in_environment(sK0(sK2),end_time(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| ~ spl3_5 ),
inference(resolution,[],[f125,f71]) ).
fof(f129,plain,
( greater_or_equal(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| ~ spl3_5 ),
inference(resolution,[],[f125,f49]) ).
fof(f130,plain,
( $false
| spl3_3
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f129,f106]) ).
fof(f131,plain,
( spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f130]) ).
fof(f132,plain,
( ~ in_environment(sK0(sK2),end_time(sK0(sK2)))
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f127,f70]) ).
fof(f138,plain,
( selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| ~ spl3_6 ),
inference(superposition,[],[f100,f120]) ).
fof(f140,plain,
( $false
| ~ spl3_6 ),
inference(forward_subsumption_resolution,[],[f138,f70]) ).
fof(f141,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f145,plain,
( in_environment(sK0(sK2),end_time(sK0(sK2)))
| ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2)))
| ~ spl3_2
| ~ spl3_3 ),
inference(resolution,[],[f105,f85]) ).
fof(f147,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2)))
| ~ spl3_2
| ~ spl3_3
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f145,f132]) ).
fof(f148,plain,
( $false
| ~ spl3_2
| ~ spl3_3
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f147,f61]) ).
fof(f149,plain,
( ~ spl3_2
| ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f148]) ).
fof(f150,plain,
( greater(sK1(sK0(sK2)),start_time(sK0(sK2)))
| ~ spl3_1 ),
inference(resolution,[],[f78,f95]) ).
fof(f156,definition,
( spl3_7
<=> greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2))) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
fof(f157,plain,
( greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2)))
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f158,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2)))
| spl3_7 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f165,plain,
( ! [X0] :
( ~ greater(sK1(sK0(sK2)),X0)
| greater(end_time(sK0(sK2)),X0) )
| ~ spl3_5 ),
inference(resolution,[],[f116,f46]) ).
fof(f176,plain,
( greater(end_time(sK0(sK2)),start_time(sK0(sK2)))
| ~ spl3_1
| ~ spl3_5 ),
inference(resolution,[],[f165,f150]) ).
fof(f179,plain,
( greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2)))
| ~ spl3_1
| ~ spl3_5 ),
inference(resolution,[],[f176,f49]) ).
fof(f180,plain,
( $false
| ~ spl3_1
| ~ spl3_5
| spl3_7 ),
inference(forward_subsumption_resolution,[],[f179,f158]) ).
fof(f181,plain,
( ~ spl3_1
| ~ spl3_5
| spl3_7 ),
inference(avatar_contradiction_clause,[],[f180]) ).
fof(f184,plain,
( in_environment(sK0(sK2),end_time(sK0(sK2)))
| ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2)))
| ~ spl3_7 ),
inference(resolution,[],[f157,f84]) ).
fof(f186,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2)))
| ~ spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f184,f132]) ).
fof(f187,plain,
( $false
| ~ spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f186,f61]) ).
fof(f188,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f187]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f83]) ).
cnf(s3,plain,
( spl3_5
| spl3_6 ),
inference(sat_conversion,[],[f121]) ).
cnf(s4,plain,
( spl3_3
| ~ spl3_5 ),
inference(sat_conversion,[],[f131]) ).
cnf(s5,plain,
~ spl3_6,
inference(sat_conversion,[],[f141]) ).
cnf(s7,plain,
( ~ spl3_2
| ~ spl3_3
| ~ spl3_5 ),
inference(sat_conversion,[],[f149]) ).
cnf(s9,plain,
( ~ spl3_1
| ~ spl3_5
| spl3_7 ),
inference(sat_conversion,[],[f181]) ).
cnf(s10,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(sat_conversion,[],[f188]) ).
cnf(s11,plain,
spl3_5,
inference(rat,[],[s3,s5]) ).
cnf(s12,plain,
~ spl3_7,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
~ spl3_1,
inference(rat,[],[s9,s12,s11]) ).
cnf(s14,plain,
spl3_3,
inference(rat,[],[s4,s11]) ).
cnf(s15,plain,
~ spl3_2,
inference(rat,[],[s7,s11,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s15,s13]) ).
fof(f189,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 17:26:09 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.45 % (2617832)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (2617842)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3951010260:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (2617842) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2617832-2617842"...
% 0.11/0.45 % (2617838)% WARNING: option uhcvi not known.
% 0.11/0.45 % (2617842)...printing done.
% 0.11/0.45 % (2617842)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (2617842)------------------------------
% 0.11/0.46 % (2617842)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (2617842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (2617842)CaDiCaL version: 2.1.3
% 0.11/0.46 % (2617842)Termination reason: Refutation
% 0.11/0.46 % (2617842)Time elapsed: 0.004 s
% 0.11/0.46 % (2617842)Peak memory usage: 12 MB
% 0.11/0.46 % (2617842)Instructions burned: 7 (million)
% 0.11/0.46 % (2617832)Success in time 0.034 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------