%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT038-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:38 PM UTC 2026
% Result : Satisfiable 0.10s 0.45s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp7_first_movers_exist_17,axiom,
finite_set(first_movers) = true ).
cnf(u100,negated_conjecture,
true = ifeq(greater(sk2(sk3),sk2(sk3)),true,true,true) ).
cnf(u82,negated_conjecture,
true = in_environment(sk3,appear(first_movers,sk3)) ).
cnf(u13,axiom,
true = ifeq(greater(X0,X1),true,ifeq(greater(X2,X0),true,greater(X2,X1),true),true) ).
cnf(u5,axiom,
true = ifeq(environment(X0),true,ifeq(stable(X0),true,in_environment(X0,appear(first_movers,X0)),true),true) ).
cnf(u94,negated_conjecture,
true = ifeq(greater(X0,appear(efficient_producers,sk3)),true,ifeq(greater(sk2(sk3),X0),true,true,true),true) ).
cnf(u7,axiom,
true = ifeq(finite_set(X0),true,ifeq(contracts_from(X1,X0),true,greater(sk1(X1,X0),X1),true),true) ).
cnf(u200,negated_conjecture,
true = ifeq(in_environment(X0,sk2(sk3)),true,ifeq(environment(X0),true,ifeq(stable(X0),true,in_environment(X0,sk1(sk2(sk3),first_movers)),true),true),true) ).
cnf(u248,negated_conjecture,
true = ifeq(in_environment(sk3,appear(efficient_producers,sk3)),true,in_environment(sk3,sk2(sk3)),true) ).
cnf(u127,negated_conjecture,
true = ifeq(greater(X0,sk2(sk3)),true,ifeq(greater(sk1(sk2(sk3),first_movers),X0),true,true,true),true) ).
cnf(u46,negated_conjecture,
tuple(zero,true,true) != tuple(cardinality_at_time(first_movers,to),in_environment(sk3,appear(efficient_producers,e)),true) ).
cnf(u160,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,sk3),sk2(sk3)),true,true,true) ).
cnf(u84,negated_conjecture,
tuple(zero,true,true) != tuple(cardinality_at_time(first_movers,to),true,greater(appear(first_movers,sk3),appear(first_movers,sk3))) ).
cnf(prove_t7_28,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),in_environment(sk3,X0),greater(X0,appear(first_movers,sk3))) != tuple(zero,true,true) ).
cnf(u201,negated_conjecture,
true = ifeq(in_environment(X0,appear(efficient_producers,sk3)),true,ifeq(environment(X0),true,ifeq(stable(X0),true,in_environment(X0,sk1(sk2(sk3),first_movers)),true),true),true) ).
cnf(u246,negated_conjecture,
true = ifeq(in_environment(sk3,sk2(sk3)),true,in_environment(sk3,sk1(sk2(sk3),first_movers)),true) ).
cnf(u214,negated_conjecture,
true = ifeq(greater(X0,appear(first_movers,sk3)),true,in_environment(sk3,X0),true) ).
cnf(u195,axiom,
true = ifeq(greater(appear(first_movers,X0),X1),true,ifeq(in_environment(X0,X1),true,true,true),true) ).
cnf(u70,negated_conjecture,
zero = ifeq2(contracts_from(X0,first_movers),true,zero,zero) ).
cnf(u30,negated_conjecture,
true = greater(appear(efficient_producers,e),appear(first_movers,sk3)) ).
cnf(u217,negated_conjecture,
true = in_environment(sk3,appear(efficient_producers,e)) ).
cnf(u147,negated_conjecture,
true = ifeq(greater(sk1(sk2(sk3),first_movers),sk1(sk2(sk3),first_movers)),true,true,true) ).
cnf(u97,negated_conjecture,
true = ifeq(greater(X0,sk2(sk3)),true,greater(X0,appear(efficient_producers,sk3)),true) ).
cnf(u99,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,sk3),appear(efficient_producers,sk3)),true,true,true) ).
cnf(u209,negated_conjecture,
true = ifeq(greater(X0,X1),true,ifeq(in_environment(sk3,X1),true,in_environment(sk3,X0),true),true) ).
cnf(u141,negated_conjecture,
true = ifeq(greater(X0,sk1(sk2(sk3),first_movers)),true,greater(X0,appear(efficient_producers,sk3)),true) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X0,X0,X1,X2) = X1 ).
cnf(u103,negated_conjecture,
true = ifeq(greater(appear(first_movers,sk3),appear(first_movers,sk3)),true,true,true) ).
cnf(u234,negated_conjecture,
true = ifeq(greater(appear(first_movers,sk3),appear(efficient_producers,e)),true,true,true) ).
cnf(u95,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,sk3),X0),true,greater(sk2(sk3),X0),true) ).
cnf(u218,negated_conjecture,
tuple(zero,true,true) != tuple(cardinality_at_time(first_movers,to),true,true) ).
cnf(u202,negated_conjecture,
true = ifeq(in_environment(X0,appear(efficient_producers,sk3)),true,ifeq(environment(X0),true,ifeq(stable(X0),true,in_environment(X0,sk2(sk3)),true),true),true) ).
cnf(u131,negated_conjecture,
true = ifeq(greater(sk2(sk3),X0),true,greater(sk1(sk2(sk3),first_movers),X0),true) ).
cnf(u54,negated_conjecture,
true = greater(sk2(sk3),appear(efficient_producers,sk3)) ).
cnf(u133,negated_conjecture,
true = greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)) ).
cnf(u212,negated_conjecture,
true = ifeq(greater(appear(first_movers,sk3),X0),true,ifeq(in_environment(sk3,X0),true,true,true),true) ).
cnf(u93,negated_conjecture,
true = ifeq(greater(X0,appear(first_movers,sk3)),true,ifeq(greater(appear(efficient_producers,e),X0),true,true,true),true) ).
cnf(u122,axiom,
true = ifeq(contracts_from(X0,first_movers),true,greater(sk1(X0,first_movers),X0),true) ).
cnf(u35,negated_conjecture,
true = contracts_from(sk2(sk3),first_movers) ).
cnf(u232,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,e),X0),true,ifeq(in_environment(sk3,X0),true,true,true),true) ).
cnf(u124,negated_conjecture,
true = greater(sk1(sk2(sk3),first_movers),sk2(sk3)) ).
cnf(u138,negated_conjecture,
true = ifeq(greater(X0,appear(efficient_producers,sk3)),true,ifeq(greater(sk1(sk2(sk3),first_movers),X0),true,true,true),true) ).
cnf(u66,negated_conjecture,
zero = ifeq2(finite_set(X0),true,ifeq2(contracts_from(X1,X0),true,zero,zero),zero) ).
cnf(u65,negated_conjecture,
cardinality_at_time(s,t2) = zero ).
cnf(u25,negated_conjecture,
true = ifeq(true,true,greater(appear(efficient_producers,e),appear(first_movers,sk3)),true) ).
cnf(u142,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,sk3),X0),true,greater(sk1(sk2(sk3),first_movers),X0),true) ).
cnf(u247,negated_conjecture,
true = ifeq(in_environment(sk3,appear(efficient_producers,sk3)),true,in_environment(sk3,sk1(sk2(sk3),first_movers)),true) ).
cnf(u17,hypothesis,
true = ifeq(environment(X0),true,ifeq(stable(X0),true,contracts_from(sk2(X0),first_movers),true),true) ).
cnf(u19,hypothesis,
true = ifeq(environment(X0),true,greater(appear(efficient_producers,e),appear(first_movers,X0)),true) ).
cnf(u98,negated_conjecture,
true = ifeq(greater(X0,appear(efficient_producers,e)),true,greater(X0,appear(first_movers,sk3)),true) ).
cnf(u233,negated_conjecture,
true = ifeq(greater(X0,appear(efficient_producers,e)),true,in_environment(sk3,X0),true) ).
cnf(u28,negated_conjecture,
true = ifeq(true,true,ifeq(true,true,contracts_from(sk2(sk3),first_movers),true),true) ).
cnf(u21,negated_conjecture,
true = environment(sk3) ).
cnf(u144,negated_conjecture,
true = ifeq(greater(sk2(sk3),sk1(sk2(sk3),first_movers)),true,true,true) ).
cnf(u23,negated_conjecture,
true = stable(sk3) ).
cnf(u203,negated_conjecture,
true = ifeq(in_environment(X0,appear(first_movers,sk3)),true,ifeq(environment(X0),true,ifeq(stable(X0),true,in_environment(X0,appear(efficient_producers,e)),true),true),true) ).
cnf(u15,hypothesis,
true = ifeq(environment(X0),true,ifeq(stable(X0),true,greater(sk2(X0),appear(efficient_producers,X0)),true),true) ).
cnf(u96,negated_conjecture,
true = ifeq(greater(appear(first_movers,sk3),X0),true,greater(appear(efficient_producers,e),X0),true) ).
cnf(u9,axiom,
zero = ifeq2(finite_set(X0),true,ifeq2(contracts_from(X1,X0),true,cardinality_at_time(s,t2),zero),zero) ).
cnf(u104,negated_conjecture,
true = ifeq(greater(appear(efficient_producers,e),appear(efficient_producers,e)),true,true,true) ).
cnf(u130,negated_conjecture,
true = ifeq(greater(X0,sk1(sk2(sk3),first_movers)),true,greater(X0,sk2(sk3)),true) ).
cnf(u11,axiom,
true = ifeq(greater(X0,X1),true,ifeq(in_environment(X2,X1),true,ifeq(environment(X2),true,ifeq(stable(X2),true,in_environment(X2,X0),true),true),true),true) ).
cnf(ifeq_axiom,axiom,
ifeq2(X0,X0,X1,X2) = X1 ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT038-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n019.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:23:34 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.10/0.45 % (3289267)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3289279)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4177686656:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (3289278)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3289279) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3289267-3289279"...
% 0.10/0.45 % (3289277)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1618493268_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (3289280)dis+10_1_sil=32000:sp=arity:random_seed=253656604:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3289278)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4004187418:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (3289279)...printing done.
% 0.10/0.45 % (3289282)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2199718508:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (3289281)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2094098841:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (3289283)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3743323574:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % SZS status Satisfiable for theBenchmark
% 0.10/0.45 % SZS output start Saturation.
% See solution above
% 0.10/0.45 % SZS output start Definitions and Model Updates.
% 0.10/0.45 % SZS output end Definitions and Model Updates.
% 0.10/0.45 % (3289279)------------------------------
% 0.10/0.45 % (3289279)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3289279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3289279)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3289279)Termination reason: Satisfiable
% 0.10/0.45 % (3289279)Time elapsed: 0.007 s
% 0.10/0.45 % (3289279)Peak memory usage: 11 MB
% 0.10/0.45 % (3289279)Instructions burned: 22 (million)
% 0.10/0.45 % (3289267)Success in time 0.025 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------