TSTP Solution File: MGT039+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n005.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 : 300s
% DateTime : Wed Aug 31 17:51:33 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 17
% Syntax : Number of formulae : 134 ( 25 unt; 3 typ; 0 def)
% Number of atoms : 396 ( 32 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 440 ( 175 ~; 194 |; 50 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 140 ( 130 !; 10 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_10,type,
sQ4_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_11,type,
sQ5_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_12,type,
sQ6_eqProxy: ( $real * $real ) > $o ).
fof(f300,plain,
$false,
inference(subsumption_resolution,[],[f297,f140]) ).
fof(f140,plain,
~ selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))),
inference(subsumption_resolution,[],[f139,f75]) ).
fof(f75,plain,
~ selection_favors(efficient_producers,first_movers,sK2),
inference(literal_reordering,[],[f64]) ).
fof(f64,plain,
~ selection_favors(efficient_producers,first_movers,sK2),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
( slow_change(sK2)
& observational_period(sK2)
& ~ selection_favors(efficient_producers,first_movers,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f29,f47]) ).
fof(f47,plain,
( ? [X0] :
( slow_change(X0)
& observational_period(X0)
& ~ selection_favors(efficient_producers,first_movers,X0) )
=> ( slow_change(sK2)
& observational_period(sK2)
& ~ selection_favors(efficient_producers,first_movers,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0] :
( slow_change(X0)
& observational_period(X0)
& ~ selection_favors(efficient_producers,first_movers,X0) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
? [X0] :
( ~ selection_favors(efficient_producers,first_movers,X0)
& slow_change(X0)
& observational_period(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( ( slow_change(X0)
& observational_period(X0) )
=> selection_favors(efficient_producers,first_movers,X0) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] :
( ( slow_change(X0)
& observational_period(X0) )
=> selection_favors(efficient_producers,first_movers,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8) ).
fof(f139,plain,
( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,sK2) ),
inference(resolution,[],[f138,f87]) ).
fof(f87,plain,
observational_period(sK2),
inference(literal_reordering,[],[f65]) ).
fof(f65,plain,
observational_period(sK2),
inference(cnf_transformation,[],[f48]) ).
fof(f138,plain,
! [X0] :
( ~ observational_period(X0)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
| selection_favors(efficient_producers,first_movers,X0) ),
inference(subsumption_resolution,[],[f137,f72]) ).
fof(f72,plain,
propagation_strategy(first_movers),
inference(literal_reordering,[],[f57]) ).
fof(f57,plain,
propagation_strategy(first_movers),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets1) ).
fof(f137,plain,
! [X0] :
( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| selection_favors(efficient_producers,first_movers,X0) ),
inference(subsumption_resolution,[],[f86,f69]) ).
fof(f69,plain,
propagation_strategy(efficient_producers),
inference(literal_reordering,[],[f54]) ).
fof(f54,plain,
propagation_strategy(efficient_producers),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets2) ).
fof(f86,plain,
! [X0] :
( ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
| ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(first_movers) ),
inference(literal_reordering,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ~ propagation_strategy(first_movers)
| ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
& in_environment(X0,sK0(X0))
& environment(sK0(X0)) )
| ~ propagation_strategy(first_movers) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f35,f38]) ).
fof(f38,plain,
! [X0] :
( ? [X1] :
( ~ selection_favors(efficient_producers,first_movers,end_time(X1))
& in_environment(X0,X1)
& environment(X1) )
=> ( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
& in_environment(X0,sK0(X0))
& environment(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ? [X1] :
( ~ selection_favors(efficient_producers,first_movers,end_time(X1))
& in_environment(X0,X1)
& environment(X1) )
| ~ propagation_strategy(first_movers) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ? [X1] :
( ~ selection_favors(efficient_producers,first_movers,end_time(X1))
& in_environment(X0,X1)
& environment(X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ( propagation_strategy(efficient_producers)
& observational_period(X0)
& propagation_strategy(first_movers)
& ! [X1] :
( ( in_environment(X0,X1)
& environment(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(f297,plain,
selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))),
inference(backward_demodulation,[],[f159,f290]) ).
fof(f290,plain,
end_time(sK0(sK2)) = sK1(sK0(sK2)),
inference(subsumption_resolution,[],[f289,f195]) ).
fof(f195,plain,
( greater(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
inference(resolution,[],[f184,f144]) ).
fof(f144,plain,
greater(sK1(sK0(sK2)),critical_point(sK0(sK2))),
inference(subsumption_resolution,[],[f143,f87]) ).
fof(f143,plain,
( greater(sK1(sK0(sK2)),critical_point(sK0(sK2)))
| ~ observational_period(sK2) ),
inference(subsumption_resolution,[],[f142,f78]) ).
fof(f78,plain,
slow_change(sK2),
inference(literal_reordering,[],[f66]) ).
fof(f66,plain,
slow_change(sK2),
inference(cnf_transformation,[],[f48]) ).
fof(f142,plain,
( ~ slow_change(sK2)
| ~ observational_period(sK2)
| greater(sK1(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(subsumption_resolution,[],[f141,f128]) ).
fof(f128,plain,
environment(sK0(sK2)),
inference(subsumption_resolution,[],[f127,f87]) ).
fof(f127,plain,
( ~ observational_period(sK2)
| environment(sK0(sK2)) ),
inference(resolution,[],[f126,f75]) ).
fof(f126,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| environment(sK0(X0)) ),
inference(subsumption_resolution,[],[f125,f72]) ).
fof(f125,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| environment(sK0(X0))
| ~ propagation_strategy(first_movers) ),
inference(subsumption_resolution,[],[f76,f69]) ).
fof(f76,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| environment(sK0(X0))
| ~ observational_period(X0)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers) ),
inference(literal_reordering,[],[f49]) ).
fof(f49,plain,
! [X0] :
( ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| environment(sK0(X0))
| ~ propagation_strategy(first_movers) ),
inference(cnf_transformation,[],[f39]) ).
fof(f141,plain,
( greater(sK1(sK0(sK2)),critical_point(sK0(sK2)))
| ~ environment(sK0(sK2))
| ~ slow_change(sK2)
| ~ observational_period(sK2) ),
inference(resolution,[],[f136,f77]) ).
fof(f77,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| greater(sK1(X1),critical_point(X1))
| ~ slow_change(X0)
| ~ observational_period(X0)
| ~ environment(X1) ),
inference(literal_reordering,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ~ slow_change(X0)
| ~ environment(X1)
| greater(sK1(X1),critical_point(X1))
| ~ in_environment(X0,X1)
| ~ observational_period(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0] :
( ~ slow_change(X0)
| ! [X1] :
( ~ in_environment(X0,X1)
| ~ environment(X1)
| ( in_environment(X1,sK1(X1))
& greater(sK1(X1),critical_point(X1)) ) )
| ~ observational_period(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f22,f43]) ).
fof(f43,plain,
! [X1] :
( ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) )
=> ( in_environment(X1,sK1(X1))
& greater(sK1(X1),critical_point(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0] :
( ~ slow_change(X0)
| ! [X1] :
( ~ in_environment(X0,X1)
| ~ environment(X1)
| ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) ) )
| ~ observational_period(X0) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) )
| ~ in_environment(X0,X1)
| ~ environment(X1) )
| ~ observational_period(X0)
| ~ slow_change(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] :
( ( observational_period(X0)
& slow_change(X0) )
=> ! [X1] :
( ( in_environment(X0,X1)
& environment(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& greater(X2,critical_point(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point) ).
fof(f136,plain,
in_environment(sK2,sK0(sK2)),
inference(subsumption_resolution,[],[f135,f87]) ).
fof(f135,plain,
( ~ observational_period(sK2)
| in_environment(sK2,sK0(sK2)) ),
inference(resolution,[],[f134,f75]) ).
fof(f134,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| in_environment(X0,sK0(X0)) ),
inference(subsumption_resolution,[],[f133,f72]) ).
fof(f133,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X0)
| in_environment(X0,sK0(X0)) ),
inference(subsumption_resolution,[],[f85,f69]) ).
fof(f85,plain,
! [X0] :
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(efficient_producers)
| in_environment(X0,sK0(X0))
| ~ propagation_strategy(first_movers) ),
inference(literal_reordering,[],[f50]) ).
fof(f50,plain,
! [X0] :
( ~ propagation_strategy(efficient_producers)
| in_environment(X0,sK0(X0))
| selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers) ),
inference(cnf_transformation,[],[f39]) ).
fof(f184,plain,
! [X0] :
( ~ greater(sK1(sK0(sK2)),X0)
| greater(end_time(sK0(sK2)),X0)
| end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
inference(resolution,[],[f170,f80]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X2)
| greater(X0,X2) ),
inference(literal_reordering,[],[f53]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ greater(X1,X2)
| greater(X0,X2)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X0,X1)
| ~ greater(X1,X2) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( greater(X2,X1)
| ~ greater(X2,X0)
| ~ greater(X0,X1) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X2,X1,X0] :
( greater(X2,X1)
| ~ greater(X2,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X2,X1,X0] :
( ( greater(X2,X0)
& greater(X0,X1) )
=> greater(X2,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X4,X5,X3] :
( ( greater(X4,X5)
& greater(X3,X4) )
=> greater(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(f170,plain,
( greater(end_time(sK0(sK2)),sK1(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
inference(resolution,[],[f157,f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(literal_reordering,[],[f60]) ).
fof(f60,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ( greater_or_equal(X0,X1)
| ( X0 != X1
& ~ greater(X0,X1) ) )
& ( X0 = X1
| greater(X0,X1)
| ~ greater_or_equal(X0,X1) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( greater_or_equal(X0,X1)
| ( X0 != X1
& ~ greater(X0,X1) ) )
& ( X0 = X1
| greater(X0,X1)
| ~ greater_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
<=> ( X0 = X1
| greater(X0,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X3,X4] :
( ( greater(X3,X4)
| X3 = X4 )
<=> greater_or_equal(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(f157,plain,
greater_or_equal(end_time(sK0(sK2)),sK1(sK0(sK2))),
inference(resolution,[],[f155,f132]) ).
fof(f132,plain,
! [X3] :
( ~ in_environment(sK0(sK2),X3)
| greater_or_equal(end_time(sK0(sK2)),X3) ),
inference(resolution,[],[f128,f84]) ).
fof(f84,plain,
! [X0,X1] :
( ~ environment(X1)
| greater_or_equal(end_time(X1),X0)
| ~ in_environment(X1,X0) ),
inference(literal_reordering,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( greater_or_equal(end_time(X1),X0)
| ~ environment(X1)
| ~ in_environment(X1,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ~ in_environment(X1,X0)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X0) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater_or_equal(end_time(X0),X1) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X1,X0] :
( greater_or_equal(end_time(X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( in_environment(X0,X1)
& environment(X0) )
=> greater_or_equal(end_time(X0),X1) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> greater_or_equal(end_time(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_end_point) ).
fof(f155,plain,
in_environment(sK0(sK2),sK1(sK0(sK2))),
inference(subsumption_resolution,[],[f154,f87]) ).
fof(f154,plain,
( in_environment(sK0(sK2),sK1(sK0(sK2)))
| ~ observational_period(sK2) ),
inference(subsumption_resolution,[],[f153,f136]) ).
fof(f153,plain,
( ~ in_environment(sK2,sK0(sK2))
| ~ observational_period(sK2)
| in_environment(sK0(sK2),sK1(sK0(sK2))) ),
inference(resolution,[],[f130,f78]) ).
fof(f130,plain,
! [X1] :
( ~ slow_change(X1)
| ~ observational_period(X1)
| ~ in_environment(X1,sK0(sK2))
| in_environment(sK0(sK2),sK1(sK0(sK2))) ),
inference(resolution,[],[f128,f74]) ).
fof(f74,plain,
! [X0,X1] :
( ~ environment(X1)
| ~ slow_change(X0)
| ~ observational_period(X0)
| in_environment(X1,sK1(X1))
| ~ in_environment(X0,X1) ),
inference(literal_reordering,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ observational_period(X0)
| ~ environment(X1)
| in_environment(X1,sK1(X1))
| ~ slow_change(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f289,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(subsumption_resolution,[],[f286,f140]) ).
fof(f286,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(resolution,[],[f282,f131]) ).
fof(f131,plain,
! [X2] :
( ~ in_environment(sK0(sK2),X2)
| selection_favors(efficient_producers,first_movers,X2)
| ~ greater(X2,critical_point(sK0(sK2))) ),
inference(resolution,[],[f128,f70]) ).
fof(f70,plain,
! [X0,X1] :
( ~ environment(X0)
| ~ greater(X1,critical_point(X0))
| selection_favors(efficient_producers,first_movers,X1)
| ~ in_environment(X0,X1) ),
inference(literal_reordering,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( ~ environment(X0)
| ~ greater(X1,critical_point(X0))
| selection_favors(efficient_producers,first_movers,X1)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( selection_favors(efficient_producers,first_movers,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(X1,critical_point(X0)) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( selection_favors(efficient_producers,first_movers,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ greater(X1,critical_point(X0)) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( in_environment(X0,X1)
& environment(X0)
& greater(X1,critical_point(X0)) )
=> selection_favors(efficient_producers,first_movers,X1) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X1,X2] :
( ( in_environment(X1,X2)
& greater(X2,critical_point(X1))
& environment(X1) )
=> selection_favors(efficient_producers,first_movers,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8) ).
fof(f282,plain,
( in_environment(sK0(sK2),end_time(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
inference(subsumption_resolution,[],[f281,f81]) ).
fof(f81,plain,
! [X1] : greater_or_equal(X1,X1),
inference(literal_reordering,[],[f68]) ).
fof(f68,plain,
! [X1] : greater_or_equal(X1,X1),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f46]) ).
fof(f281,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| in_environment(sK0(sK2),end_time(sK0(sK2)))
| ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2))) ),
inference(resolution,[],[f273,f195]) ).
fof(f273,plain,
! [X0] :
( ~ greater(X0,critical_point(sK0(sK2)))
| in_environment(sK0(sK2),X0)
| ~ greater_or_equal(end_time(sK0(sK2)),X0) ),
inference(resolution,[],[f260,f79]) ).
fof(f79,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
| ~ greater(X0,X1) ),
inference(literal_reordering,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f260,plain,
! [X0] :
( ~ greater_or_equal(X0,critical_point(sK0(sK2)))
| ~ greater_or_equal(end_time(sK0(sK2)),X0)
| in_environment(sK0(sK2),X0) ),
inference(backward_demodulation,[],[f129,f259]) ).
fof(f259,plain,
critical_point(sK0(sK2)) = start_time(sK0(sK2)),
inference(subsumption_resolution,[],[f251,f140]) ).
fof(f251,plain,
( critical_point(sK0(sK2)) = start_time(sK0(sK2))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))) ),
inference(superposition,[],[f159,f241]) ).
fof(f241,plain,
( end_time(sK0(sK2)) = sK1(sK0(sK2))
| critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
inference(subsumption_resolution,[],[f240,f195]) ).
fof(f240,plain,
( critical_point(sK0(sK2)) = start_time(sK0(sK2))
| end_time(sK0(sK2)) = sK1(sK0(sK2))
| ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(subsumption_resolution,[],[f237,f140]) ).
fof(f237,plain,
( critical_point(sK0(sK2)) = start_time(sK0(sK2))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2)) ),
inference(resolution,[],[f211,f131]) ).
fof(f211,plain,
( in_environment(sK0(sK2),end_time(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2))
| critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
inference(resolution,[],[f196,f152]) ).
fof(f152,plain,
( ~ greater(end_time(sK0(sK2)),start_time(sK0(sK2)))
| in_environment(sK0(sK2),end_time(sK0(sK2))) ),
inference(resolution,[],[f150,f79]) ).
fof(f150,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2)))
| in_environment(sK0(sK2),end_time(sK0(sK2))) ),
inference(resolution,[],[f129,f81]) ).
fof(f196,plain,
( greater(end_time(sK0(sK2)),start_time(sK0(sK2)))
| end_time(sK0(sK2)) = sK1(sK0(sK2))
| critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
inference(resolution,[],[f184,f161]) ).
fof(f161,plain,
( greater(sK1(sK0(sK2)),start_time(sK0(sK2)))
| critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
inference(resolution,[],[f148,f149]) ).
fof(f149,plain,
! [X0] :
( ~ greater(critical_point(sK0(sK2)),X0)
| greater(sK1(sK0(sK2)),X0) ),
inference(resolution,[],[f144,f80]) ).
fof(f148,plain,
( greater(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| critical_point(sK0(sK2)) = start_time(sK0(sK2)) ),
inference(resolution,[],[f124,f128]) ).
fof(f124,plain,
! [X3] :
( ~ environment(X3)
| critical_point(X3) = start_time(X3)
| greater(critical_point(X3),start_time(X3)) ),
inference(resolution,[],[f73,f71]) ).
fof(f71,plain,
! [X0] :
( greater_or_equal(critical_point(X0),start_time(X0))
| ~ environment(X0) ),
inference(literal_reordering,[],[f67]) ).
fof(f67,plain,
! [X0] :
( greater_or_equal(critical_point(X0),start_time(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( greater_or_equal(critical_point(X0),start_time(X0))
| ~ environment(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0] :
( environment(X0)
=> greater_or_equal(critical_point(X0),start_time(X0)) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(critical_point(X1),start_time(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_of_critical_point) ).
fof(f129,plain,
! [X0] :
( ~ greater_or_equal(end_time(sK0(sK2)),X0)
| ~ greater_or_equal(X0,start_time(sK0(sK2)))
| in_environment(sK0(sK2),X0) ),
inference(resolution,[],[f128,f82]) ).
fof(f82,plain,
! [X0,X1] :
( ~ environment(X1)
| ~ greater_or_equal(X0,start_time(X1))
| in_environment(X1,X0)
| ~ greater_or_equal(end_time(X1),X0) ),
inference(literal_reordering,[],[f52]) ).
fof(f52,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,start_time(X1))
| ~ greater_or_equal(end_time(X1),X0)
| ~ environment(X1)
| in_environment(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( in_environment(X1,X0)
| ~ greater_or_equal(end_time(X1),X0)
| ~ greater_or_equal(X0,start_time(X1))
| ~ environment(X1) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( in_environment(X1,X0)
| ~ greater_or_equal(end_time(X1),X0)
| ~ greater_or_equal(X0,start_time(X1))
| ~ environment(X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( greater_or_equal(end_time(X1),X0)
& greater_or_equal(X0,start_time(X1))
& environment(X1) )
=> in_environment(X1,X0) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X1] :
( ( environment(X1)
& greater_or_equal(end_time(X1),X2)
& greater_or_equal(X2,start_time(X1)) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_in_environment) ).
fof(f159,plain,
selection_favors(efficient_producers,first_movers,sK1(sK0(sK2))),
inference(subsumption_resolution,[],[f156,f144]) ).
fof(f156,plain,
( ~ greater(sK1(sK0(sK2)),critical_point(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,sK1(sK0(sK2))) ),
inference(resolution,[],[f155,f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 03:21:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.50 % (5628)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.50 % (5620)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.50 % (5612)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (5611)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.51 TRYING [1]
% 0.21/0.51 TRYING [2]
% 0.21/0.51 % (5609)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 TRYING [3]
% 0.21/0.52 % (5620)First to succeed.
% 0.21/0.52 % (5624)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.52 TRYING [4]
% 0.21/0.52 % (5610)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (5608)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.52 % (5606)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.52 TRYING [1]
% 0.21/0.52 % (5610)Also succeeded, but the first one will report.
% 0.21/0.52 % (5616)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.52 TRYING [2]
% 0.21/0.52 TRYING [3]
% 0.21/0.53 % (5620)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (5620)------------------------------
% 0.21/0.53 % (5620)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (5620)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (5620)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (5620)Memory used [KB]: 5884
% 0.21/0.53 % (5620)Time elapsed: 0.019 s
% 0.21/0.53 % (5620)Instructions burned: 12 (million)
% 0.21/0.53 % (5620)------------------------------
% 0.21/0.53 % (5620)------------------------------
% 0.21/0.53 % (5605)Success in time 0.175 s
%------------------------------------------------------------------------------