%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT033+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:06 PM UTC 2026
% Result : CounterSatisfiable 2.67s 1.36s
% Output : Saturation 3.99s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u92,negated_conjecture,
~ greater(sK1,appear(first_movers,sK0)) ).
cnf(u97,negated_conjecture,
sK1 = appear(first_movers,sK0) ).
cnf(u113,axiom,
~ environment(e) ).
cnf(u119,negated_conjecture,
greater(sK1,start_time(sK0)) ).
cnf(u136,negated_conjecture,
greater(sK1,appear(an_organisation,sK0)) ).
cnf(u139,negated_conjecture,
sK1 != appear(an_organisation,sK0) ).
cnf(u186,negated_conjecture,
greater(appear(efficient_producers,e),start_time(sK0)) ).
cnf(u189,negated_conjecture,
( ~ greater(appear(first_movers,X0),sK1)
| ~ environment(X0) ) ).
cnf(u198,negated_conjecture,
~ greater(sK1,sK1) ).
cnf(u206,negated_conjecture,
~ greater(zero,sK1) ).
cnf(u255,negated_conjecture,
~ greater(start_time(sK0),sK1) ).
cnf(u329,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,sK1) ).
cnf(u335,negated_conjecture,
greater(zero,zero) ).
cnf(u365,negated_conjecture,
efficient_producers = sK2(sK0,sK1) ).
cnf(u368,negated_conjecture,
first_movers != sK2(sK0,sK1) ).
cnf(u374,negated_conjecture,
zero = cardinality_at_time(first_movers,start_time(sK0)) ).
cnf(u401,negated_conjecture,
in_environment(sK0,appear(an_organisation,sK0)) ).
cnf(u404,negated_conjecture,
in_environment(sK0,start_time(sK0)) ).
cnf(u435,negated_conjecture,
( greater(X0,appear(an_organisation,sK0))
| ~ greater(X0,sK1) ) ).
cnf(u717,negated_conjecture,
first_movers = sK2(sK0,appear(an_organisation,sK0)) ).
cnf(u767,negated_conjecture,
greater(number_of_organizations(sK0,appear(an_organisation,sK0)),zero) ).
cnf(u772,negated_conjecture,
subpopulation(first_movers,sK0,appear(an_organisation,sK0)) ).
cnf(u808,negated_conjecture,
greater(appear(efficient_producers,e),appear(an_organisation,sK0)) ).
cnf(u844,negated_conjecture,
~ in_environment(sK0,appear(efficient_producers,e)) ).
cnf(u855,negated_conjecture,
selection_favors(first_movers,first_movers,start_time(sK0)) ).
cnf(u894,negated_conjecture,
selection_favors(efficient_producers,first_movers,start_time(sK0)) ).
cnf(u950,negated_conjecture,
selection_favors(first_movers,first_movers,appear(an_organisation,sK0)) ).
cnf(u958,negated_conjecture,
selection_favors(efficient_producers,first_movers,appear(an_organisation,sK0)) ).
cnf(u1041,negated_conjecture,
selection_favors(first_movers,efficient_producers,start_time(sK0)) ).
cnf(u1046,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,start_time(sK0)) ).
cnf(u1098,negated_conjecture,
selection_favors(first_movers,efficient_producers,appear(an_organisation,sK0)) ).
cnf(u1103,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,appear(an_organisation,sK0)) ).
cnf(u228,hypothesis,
( greater_or_equal(number_of_organizations(X0,appear(first_movers,X0)),zero)
| ~ environment(X0)
| ~ in_environment(X0,appear(first_movers,X0)) ) ).
cnf(u1032,negated_conjecture,
( ~ subpopulation(sK2(X0,start_time(sK0)),X1,start_time(sK0))
| ~ subpopulation(efficient_producers,X1,start_time(sK0))
| ~ environment(X1)
| selection_favors(sK2(X0,start_time(sK0)),efficient_producers,start_time(sK0))
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,start_time(sK0)),zero) ) ).
cnf(u752,negated_conjecture,
( ~ in_environment(X1,appear(an_organisation,sK0))
| ~ environment(X1)
| ~ greater(appear(X0,X1),sK1)
| zero = cardinality_at_time(X0,appear(an_organisation,sK0)) ) ).
cnf(u75,axiom,
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ) ).
cnf(u923,negated_conjecture,
( ~ in_environment(sK0,appear(first_movers,X0))
| ~ greater(appear(an_organisation,X0),sK1)
| in_environment(sK0,appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u870,negated_conjecture,
( ~ greater(X1,number_of_organizations(sK0,X0))
| ~ greater(X0,sK1)
| ~ in_environment(sK0,X0)
| greater(X1,zero) ) ).
cnf(u66,axiom,
( zero != cardinality_at_time(X2,X3)
| ~ environment(X0)
| ~ subpopulation(X1,X0,X3)
| ~ subpopulation(X2,X0,X3)
| ~ greater(cardinality_at_time(X1,X3),zero)
| selection_favors(X1,X2,X3) ) ).
cnf(u81,axiom,
( greater_or_equal(number_of_organizations(e,appear(an_organisation,X0)),zero)
| ~ environment(X0) ) ).
cnf(u153,negated_conjecture,
zero = cardinality_at_time(efficient_producers,sK1) ).
cnf(u1131,negated_conjecture,
( selection_favors(sK2(X0,start_time(sK0)),efficient_producers,start_time(sK0))
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,start_time(sK0))
| ~ greater(number_of_organizations(X0,start_time(sK0)),zero) ) ).
cnf(u63,axiom,
( zero != cardinality_at_time(X0,t)
| ~ greater(cardinality_at_time(X0,X1),zero) ) ).
cnf(u216,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,start_time(sK0)) ) ).
cnf(u860,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,e))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X1)
| ~ in_environment(X1,start_time(X0))
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,appear(efficient_producers,e)) ) ).
cnf(u872,negated_conjecture,
( ~ in_environment(sK0,X0)
| ~ greater(X0,sK1)
| first_movers = sK2(sK0,X0)
| efficient_producers = sK2(sK0,X0) ) ).
cnf(u904,negated_conjecture,
( ~ greater(X1,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| ~ greater(start_time(X0),sK1)
| greater(X1,appear(an_organisation,sK0)) ) ).
cnf(u519,negated_conjecture,
( ~ greater_or_equal(X1,number_of_organizations(sK0,sK1))
| ~ in_environment(X0,zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,number_of_organizations(sK0,sK1)) ) ).
cnf(u302,hypothesis,
( ~ in_environment(X0,appear(efficient_producers,e))
| ~ in_environment(X0,appear(an_organisation,X1))
| ~ environment(X0)
| in_environment(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u754,negated_conjecture,
( ~ greater(cardinality_at_time(X1,appear(an_organisation,sK0)),zero)
| ~ subpopulation(X1,X0,appear(an_organisation,sK0))
| ~ subpopulation(first_movers,X0,appear(an_organisation,sK0))
| ~ environment(X0)
| selection_favors(X1,first_movers,appear(an_organisation,sK0)) ) ).
cnf(u70,axiom,
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ) ).
cnf(u142,axiom,
( ~ greater(X2,cardinality_at_time(sK2(X0,X1),X1))
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| greater(X2,zero) ) ).
cnf(u1085,negated_conjecture,
( ~ greater(X1,number_of_organizations(sK0,appear(first_movers,X0)))
| ~ greater(appear(an_organisation,X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| greater(X1,zero) ) ).
cnf(u58,negated_conjecture,
environment(sK0) ).
cnf(u88,axiom,
( greater(appear(first_movers,X0),start_time(X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u568,hypothesis,
( greater_or_equal(appear(efficient_producers,e),appear(an_organisation,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u160,axiom,
( ~ greater_or_equal(X2,appear(first_movers,X1))
| ~ in_environment(X0,appear(an_organisation,X1))
| ~ in_environment(X0,X2)
| ~ environment(X0)
| in_environment(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u220,hypothesis,
( ~ greater(X1,number_of_organizations(X0,appear(an_organisation,X0)))
| ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| greater(X1,zero) ) ).
cnf(u848,negated_conjecture,
( ~ subpopulation(sK2(X0,start_time(sK0)),X1,start_time(sK0))
| ~ subpopulation(first_movers,X1,start_time(sK0))
| ~ environment(X1)
| selection_favors(sK2(X0,start_time(sK0)),first_movers,start_time(sK0))
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,start_time(sK0)),zero) ) ).
cnf(u871,negated_conjecture,
( greater_or_equal(number_of_organizations(sK0,X0),zero)
| ~ greater(X0,sK1)
| ~ in_environment(sK0,X0) ) ).
cnf(u802,negated_conjecture,
( greater(appear(first_movers,X0),appear(an_organisation,sK0))
| ~ greater(appear(an_organisation,X0),sK1)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u227,hypothesis,
( ~ greater(X1,number_of_organizations(X0,appear(first_movers,X0)))
| ~ environment(X0)
| ~ in_environment(X0,appear(first_movers,X0))
| greater(X1,zero) ) ).
cnf(u1140,negated_conjecture,
( ~ in_environment(X1,appear(efficient_producers,e))
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,start_time(sK0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ greater(appear(an_organisation,X0),sK1)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u212,axiom,
( ~ greater_or_equal(X2,number_of_organizations(e,appear(an_organisation,X0)))
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,number_of_organizations(e,appear(an_organisation,X0))) ) ).
cnf(u73,axiom,
( in_environment(X0,start_time(X0))
| ~ environment(X0) ) ).
cnf(u469,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,sK1) ) ).
cnf(u1075,negated_conjecture,
( ~ in_environment(sK0,appear(first_movers,X0))
| ~ greater(start_time(X0),sK1)
| ~ environment(X0)
| start_time(X0) = appear(first_movers,X0)
| first_movers = sK2(sK0,appear(first_movers,X0))
| efficient_producers = sK2(sK0,appear(first_movers,X0)) ) ).
cnf(u55,negated_conjecture,
greater(appear(efficient_producers,sK0),sK1) ).
cnf(u834,negated_conjecture,
( ~ greater_or_equal(X1,appear(efficient_producers,e))
| ~ in_environment(X0,appear(an_organisation,sK0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,appear(efficient_producers,e)) ) ).
cnf(u567,hypothesis,
( ~ greater(X1,appear(efficient_producers,e))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| greater(X1,appear(an_organisation,X0)) ) ).
cnf(u159,axiom,
( ~ greater_or_equal(X2,appear(first_movers,X1))
| ~ in_environment(X0,start_time(X1))
| ~ in_environment(X0,X2)
| ~ environment(X0)
| in_environment(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u847,negated_conjecture,
( ~ greater(appear(X0,sK0),sK1)
| zero = cardinality_at_time(X0,appear(an_organisation,sK0)) ) ).
cnf(u82,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,sK0))
| greater(X0,sK1) ) ).
cnf(u231,negated_conjecture,
( greater(appear(first_movers,X0),start_time(sK0))
| ~ environment(X0)
| ~ greater(start_time(X0),sK1)
| start_time(X0) = appear(first_movers,X0) ) ).
cnf(u162,negated_conjecture,
( greater_or_equal(X0,start_time(sK0))
| ~ greater(X0,sK1) ) ).
cnf(u338,hypothesis,
( ~ greater_or_equal(X2,number_of_organizations(X0,appear(an_organisation,X0)))
| ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,number_of_organizations(X0,appear(an_organisation,X0))) ) ).
cnf(u969,hypothesis,
( ~ greater(X1,number_of_organizations(X0,appear(efficient_producers,e)))
| ~ in_environment(X0,appear(efficient_producers,e))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| greater(X1,zero) ) ).
cnf(u413,hypothesis,
( greater(appear(efficient_producers,e),start_time(X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u77,axiom,
( ~ greater(X0,X1)
| greater_or_equal(X0,X1) ) ).
cnf(u68,axiom,
( greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u80,hypothesis,
( greater_or_equal(appear(efficient_producers,e),appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u548,negated_conjecture,
( ~ greater(cardinality_at_time(X1,start_time(sK0)),zero)
| ~ subpopulation(X1,X0,start_time(sK0))
| ~ subpopulation(first_movers,X0,start_time(sK0))
| ~ environment(X0)
| selection_favors(X1,first_movers,start_time(sK0)) ) ).
cnf(u416,negated_conjecture,
in_environment(sK0,appear(first_movers,sK0)) ).
cnf(u1072,negated_conjecture,
( ~ greater(X1,number_of_organizations(sK0,appear(first_movers,X0)))
| ~ greater(start_time(X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| greater(X1,zero) ) ).
cnf(u147,hypothesis,
( greater(number_of_organizations(X0,appear(first_movers,X0)),zero)
| ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u62,axiom,
( ~ greater(appear(X1,X0),X2)
| ~ environment(X0)
| ~ in_environment(X0,X2)
| zero = cardinality_at_time(X1,X2) ) ).
cnf(u166,negated_conjecture,
( ~ in_environment(X1,start_time(sK0))
| ~ environment(X1)
| ~ greater(X0,sK1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,X0)
| in_environment(X1,X0) ) ).
cnf(u342,hypothesis,
( ~ greater_or_equal(X2,number_of_organizations(X0,appear(first_movers,X0)))
| ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,number_of_organizations(X0,appear(first_movers,X0))) ) ).
cnf(u1088,negated_conjecture,
( ~ in_environment(sK0,appear(first_movers,X0))
| ~ greater(appear(an_organisation,X0),sK1)
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| first_movers = sK2(sK0,appear(first_movers,X0))
| efficient_producers = sK2(sK0,appear(first_movers,X0)) ) ).
cnf(u1089,negated_conjecture,
( ~ subpopulation(sK2(X0,appear(an_organisation,sK0)),X1,appear(an_organisation,sK0))
| ~ subpopulation(efficient_producers,X1,appear(an_organisation,sK0))
| ~ environment(X1)
| selection_favors(sK2(X0,appear(an_organisation,sK0)),efficient_producers,appear(an_organisation,sK0))
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,appear(an_organisation,sK0)),zero) ) ).
cnf(u84,axiom,
( ~ greater(X0,number_of_organizations(e,appear(an_organisation,X1)))
| greater(X0,zero)
| ~ environment(X1) ) ).
cnf(u828,negated_conjecture,
greater_or_equal(appear(efficient_producers,e),appear(an_organisation,sK0)) ).
cnf(u464,negated_conjecture,
( ~ in_environment(X1,appear(an_organisation,sK0))
| ~ greater_or_equal(X0,sK1)
| ~ in_environment(X1,X0)
| ~ environment(X1)
| in_environment(X1,sK1) ) ).
cnf(u79,negated_conjecture,
greater_or_equal(appear(efficient_producers,sK0),sK1) ).
cnf(u559,negated_conjecture,
( selection_favors(sK2(X0,sK1),efficient_producers,sK1)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sK1)
| ~ greater(number_of_organizations(X0,sK1),zero) ) ).
cnf(u712,negated_conjecture,
zero = cardinality_at_time(first_movers,appear(an_organisation,sK0)) ).
cnf(u60,axiom,
( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
| ~ environment(X0) ) ).
cnf(u886,negated_conjecture,
zero = cardinality_at_time(efficient_producers,start_time(sK0)) ).
cnf(u1011,negated_conjecture,
( greater_or_equal(appear(first_movers,X0),start_time(sK0))
| ~ greater(appear(an_organisation,X0),sK1)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u1002,negated_conjecture,
( ~ greater_or_equal(X2,appear(first_movers,X0))
| ~ environment(X0)
| ~ greater(start_time(X0),sK1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,sK0))
| ~ in_environment(X1,X2)
| start_time(X0) = appear(first_movers,X0)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u154,hypothesis,
( ~ subpopulation(sK2(X0,X1),X2,X1)
| ~ environment(X2)
| first_movers = sK2(X0,X1)
| efficient_producers = sK2(X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u53,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u1005,negated_conjecture,
( greater(number_of_organizations(sK0,appear(first_movers,X0)),zero)
| ~ environment(X0)
| ~ greater(start_time(X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0) ) ).
cnf(u1017,negated_conjecture,
( ~ greater_or_equal(X2,appear(first_movers,X0))
| ~ environment(X0)
| ~ greater(appear(an_organisation,X0),sK1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,sK0))
| ~ in_environment(X1,X2)
| appear(first_movers,X0) = appear(an_organisation,X0)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u125,negated_conjecture,
( greater(X0,start_time(sK0))
| ~ greater(X0,sK1) ) ).
cnf(u56,negated_conjecture,
greater_or_equal(sK1,appear(first_movers,sK0)) ).
cnf(u292,negated_conjecture,
( in_environment(X0,appear(first_movers,sK0))
| ~ in_environment(X0,sK1)
| ~ environment(X0)
| ~ in_environment(X0,start_time(sK0)) ) ).
cnf(u232,axiom,
( ~ greater(X1,appear(first_movers,X0))
| ~ environment(X0)
| start_time(X0) = appear(first_movers,X0)
| greater(X1,start_time(X0)) ) ).
cnf(u359,hypothesis,
( ~ in_environment(X0,appear(first_movers,X0))
| efficient_producers = sK2(X0,appear(first_movers,X0))
| ~ environment(X0)
| first_movers = sK2(X0,appear(first_movers,X0)) ) ).
cnf(u920,negated_conjecture,
( ~ in_environment(sK0,appear(first_movers,X0))
| ~ greater(start_time(X0),sK1)
| in_environment(sK0,start_time(X0))
| ~ environment(X0) ) ).
cnf(u67,axiom,
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ) ).
cnf(u830,negated_conjecture,
( ~ greater_or_equal(X1,number_of_organizations(sK0,appear(an_organisation,sK0)))
| ~ in_environment(X0,zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,number_of_organizations(sK0,appear(an_organisation,sK0))) ) ).
cnf(u1086,negated_conjecture,
( greater_or_equal(number_of_organizations(sK0,appear(first_movers,X0)),zero)
| ~ greater(appear(an_organisation,X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u1112,negated_conjecture,
( ~ in_environment(X1,appear(efficient_producers,e))
| ~ greater(start_time(X0),sK1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,sK0))
| ~ environment(X0)
| start_time(X0) = appear(first_movers,X0)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u934,negated_conjecture,
( greater_or_equal(appear(first_movers,X0),appear(an_organisation,sK0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| ~ greater(appear(an_organisation,X0),sK1) ) ).
cnf(u1119,negated_conjecture,
( ~ greater_or_equal(X2,number_of_organizations(sK0,appear(first_movers,X0)))
| ~ in_environment(sK0,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ greater(appear(an_organisation,X0),sK1)
| in_environment(X1,number_of_organizations(sK0,appear(first_movers,X0))) ) ).
cnf(u889,negated_conjecture,
( ~ greater(cardinality_at_time(X1,start_time(sK0)),zero)
| ~ subpopulation(X1,X0,start_time(sK0))
| ~ subpopulation(efficient_producers,X0,start_time(sK0))
| ~ environment(X0)
| selection_favors(X1,efficient_producers,start_time(sK0)) ) ).
cnf(u711,negated_conjecture,
first_movers != efficient_producers ).
cnf(u158,negated_conjecture,
( ~ greater_or_equal(X1,appear(efficient_producers,sK0))
| ~ in_environment(X0,sK1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,appear(efficient_producers,sK0)) ) ).
cnf(u993,negated_conjecture,
( greater_or_equal(appear(first_movers,X0),start_time(sK0))
| ~ greater(start_time(X0),sK1)
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u145,hypothesis,
( greater(number_of_organizations(X0,appear(an_organisation,X0)),zero)
| ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u173,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,e))
| ~ environment(X1)
| ~ in_environment(X1,appear(first_movers,X0))
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,appear(efficient_producers,e)) ) ).
cnf(u283,axiom,
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| zero = cardinality_at_time(first_movers,appear(an_organisation,X0)) ) ).
cnf(u217,negated_conjecture,
greater_or_equal(appear(efficient_producers,e),start_time(sK0)) ).
cnf(u104,negated_conjecture,
greater(appear(efficient_producers,e),sK1) ).
cnf(u801,negated_conjecture,
( greater(appear(first_movers,X0),appear(an_organisation,sK0))
| ~ greater(start_time(X0),sK1)
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u992,negated_conjecture,
( ~ greater(X1,appear(first_movers,X0))
| ~ greater(start_time(X0),sK1)
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| greater(X1,start_time(sK0)) ) ).
cnf(u65,axiom,
( subpopulation(sK2(X0,X1),X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u303,negated_conjecture,
( ~ in_environment(X0,appear(an_organisation,sK0))
| ~ in_environment(X0,sK1)
| ~ environment(X0)
| in_environment(X0,appear(first_movers,sK0)) ) ).
cnf(u272,axiom,
( ~ greater_or_equal(X3,cardinality_at_time(sK2(X0,X1),X1))
| ~ environment(X0)
| ~ environment(X2)
| ~ in_environment(X2,zero)
| ~ in_environment(X2,X3)
| ~ greater(number_of_organizations(X0,X1),zero)
| in_environment(X2,cardinality_at_time(sK2(X0,X1),X1)) ) ).
cnf(u71,axiom,
( subpopulation(efficient_producers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ) ).
cnf(u900,negated_conjecture,
( ~ greater_or_equal(X1,X0)
| ~ in_environment(sK0,X1)
| ~ greater(X0,sK1)
| in_environment(sK0,X0) ) ).
cnf(u878,negated_conjecture,
( ~ greater(cardinality_at_time(X1,appear(an_organisation,sK0)),zero)
| ~ subpopulation(X1,X0,appear(an_organisation,sK0))
| ~ subpopulation(efficient_producers,X0,appear(an_organisation,sK0))
| ~ environment(X0)
| selection_favors(X1,efficient_producers,appear(an_organisation,sK0)) ) ).
cnf(u821,negated_conjecture,
( ~ greater(X0,number_of_organizations(sK0,appear(an_organisation,sK0)))
| greater(X0,zero) ) ).
cnf(u74,axiom,
( ~ greater_or_equal(X3,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ in_environment(X0,X2)
| ~ greater_or_equal(X2,X3)
| in_environment(X0,X3) ) ).
cnf(u89,axiom,
( greater(appear(first_movers,X0),appear(an_organisation,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u1077,negated_conjecture,
( ~ greater_or_equal(X2,number_of_organizations(sK0,appear(first_movers,X0)))
| ~ in_environment(sK0,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ greater(start_time(X0),sK1)
| in_environment(X1,number_of_organizations(sK0,appear(first_movers,X0))) ) ).
cnf(u221,hypothesis,
( greater_or_equal(number_of_organizations(X0,appear(an_organisation,X0)),zero)
| ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0)) ) ).
cnf(u279,negated_conjecture,
( greater(appear(first_movers,X0),start_time(sK0))
| ~ environment(X0)
| ~ greater(appear(an_organisation,X0),sK1)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u323,negated_conjecture,
( ~ subpopulation(sK2(X0,sK1),X1,sK1)
| ~ subpopulation(efficient_producers,X1,sK1)
| ~ environment(X1)
| selection_favors(sK2(X0,sK1),efficient_producers,sK1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,sK1),zero) ) ).
cnf(u997,negated_conjecture,
( ~ greater_or_equal(X2,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,start_time(sK0))
| ~ in_environment(X1,X2)
| ~ greater(start_time(X0),sK1)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u863,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,e))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,X0))
| ~ in_environment(X1,X2)
| ~ environment(X0)
| in_environment(X1,appear(efficient_producers,e)) ) ).
cnf(u972,hypothesis,
( ~ in_environment(X0,appear(efficient_producers,e))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| first_movers = sK2(X0,appear(efficient_producers,e))
| efficient_producers = sK2(X0,appear(efficient_producers,e)) ) ).
cnf(u750,negated_conjecture,
( ~ greater(X1,X0)
| ~ greater(X0,sK1)
| greater(X1,appear(an_organisation,sK0)) ) ).
cnf(u78,axiom,
greater_or_equal(X1,X1) ).
cnf(u297,negated_conjecture,
greater_or_equal(number_of_organizations(sK0,sK1),zero) ).
cnf(u970,hypothesis,
( greater_or_equal(number_of_organizations(X0,appear(efficient_producers,e)),zero)
| ~ in_environment(X0,appear(efficient_producers,e))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u486,negated_conjecture,
( ~ greater_or_equal(X1,appear(efficient_producers,e))
| ~ in_environment(X0,sK1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,appear(efficient_producers,e)) ) ).
cnf(u429,hypothesis,
( greater(appear(efficient_producers,e),appear(an_organisation,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u360,hypothesis,
( ~ in_environment(X0,appear(an_organisation,X0))
| efficient_producers = sK2(X0,appear(an_organisation,X0))
| ~ environment(X0)
| first_movers = sK2(X0,appear(an_organisation,X0)) ) ).
cnf(u52,hypothesis,
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u873,negated_conjecture,
( ~ greater_or_equal(X2,number_of_organizations(sK0,X0))
| ~ in_environment(sK0,X0)
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ greater(X0,sK1)
| in_environment(X1,number_of_organizations(sK0,X0)) ) ).
cnf(u1129,negated_conjecture,
( ~ in_environment(X1,appear(efficient_producers,e))
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,start_time(sK0))
| start_time(X0) = appear(first_movers,X0)
| ~ greater(start_time(X0),sK1)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u564,hypothesis,
( greater_or_equal(appear(efficient_producers,e),start_time(X0))
| ~ environment(X0)
| start_time(X0) = appear(first_movers,X0) ) ).
cnf(u156,negated_conjecture,
( ~ in_environment(X0,start_time(sK0))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater_or_equal(X1,sK1)
| in_environment(X0,sK1) ) ).
cnf(u784,negated_conjecture,
( ~ in_environment(X1,appear(an_organisation,sK0))
| ~ environment(X1)
| ~ greater(X0,sK1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,X0)
| in_environment(X1,X0) ) ).
cnf(u59,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK1) ).
cnf(u786,negated_conjecture,
( greater(number_of_organizations(sK0,X0),zero)
| ~ in_environment(sK0,X0)
| ~ greater(X0,sK1) ) ).
cnf(u163,negated_conjecture,
( ~ greater(appear(X0,X1),sK1)
| ~ environment(X1)
| ~ in_environment(X1,start_time(sK0))
| zero = cardinality_at_time(X0,start_time(sK0)) ) ).
cnf(u223,negated_conjecture,
( ~ greater_or_equal(X1,appear(efficient_producers,e))
| ~ in_environment(X0,start_time(sK0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,appear(efficient_producers,e)) ) ).
cnf(u235,axiom,
( ~ environment(X0)
| start_time(X0) = appear(first_movers,X0)
| zero = cardinality_at_time(first_movers,start_time(X0)) ) ).
cnf(u462,negated_conjecture,
( ~ in_environment(sK0,X0)
| ~ greater(sK1,X0)
| zero = cardinality_at_time(first_movers,X0) ) ).
cnf(u69,axiom,
( ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0)
| in_environment(X0,appear(an_organisation,X0)) ) ).
cnf(u1073,negated_conjecture,
( greater_or_equal(number_of_organizations(sK0,appear(first_movers,X0)),zero)
| ~ greater(start_time(X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u72,axiom,
( subpopulation(first_movers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ) ).
cnf(u1163,negated_conjecture,
( selection_favors(sK2(X0,appear(an_organisation,sK0)),efficient_producers,appear(an_organisation,sK0))
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,appear(an_organisation,sK0))
| ~ greater(number_of_organizations(X0,appear(an_organisation,sK0)),zero) ) ).
cnf(u271,negated_conjecture,
greater(number_of_organizations(sK0,sK1),zero) ).
cnf(u1020,negated_conjecture,
( greater(number_of_organizations(sK0,appear(first_movers,X0)),zero)
| ~ environment(X0)
| ~ greater(appear(an_organisation,X0),sK1)
| ~ in_environment(sK0,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u1054,negated_conjecture,
( selection_favors(sK2(X0,appear(an_organisation,sK0)),first_movers,appear(an_organisation,sK0))
| ~ environment(X0)
| ~ subpopulation(first_movers,X0,appear(an_organisation,sK0))
| ~ greater(number_of_organizations(X0,appear(an_organisation,sK0)),zero) ) ).
cnf(u933,negated_conjecture,
( ~ greater(appear(an_organisation,X0),sK1)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| ~ greater(X1,appear(first_movers,X0))
| greater(X1,appear(an_organisation,sK0)) ) ).
cnf(u54,hypothesis,
( ~ greater(cardinality_at_time(X1,X2),zero)
| first_movers = X1
| ~ environment(X0)
| ~ subpopulation(X1,X0,X2)
| efficient_producers = X1 ) ).
cnf(u964,negated_conjecture,
( selection_favors(sK2(X0,start_time(sK0)),first_movers,start_time(sK0))
| ~ environment(X0)
| ~ subpopulation(first_movers,X0,start_time(sK0))
| ~ greater(number_of_organizations(X0,start_time(sK0)),zero) ) ).
cnf(u126,negated_conjecture,
greater_or_equal(sK1,start_time(sK0)) ).
cnf(u751,negated_conjecture,
( greater_or_equal(X0,appear(an_organisation,sK0))
| ~ greater(X0,sK1) ) ).
cnf(u905,negated_conjecture,
( greater_or_equal(appear(first_movers,X0),appear(an_organisation,sK0))
| start_time(X0) = appear(first_movers,X0)
| ~ environment(X0)
| ~ greater(start_time(X0),sK1) ) ).
cnf(u465,negated_conjecture,
( ~ greater(X0,number_of_organizations(sK0,sK1))
| greater(X0,zero) ) ).
cnf(u308,hypothesis,
( ~ greater(number_of_organizations(X0,X1),zero)
| first_movers = sK2(X0,X1)
| efficient_producers = sK2(X0,X1)
| ~ environment(X0) ) ).
cnf(u827,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,appear(an_organisation,sK0)) ) ).
cnf(u83,hypothesis,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u563,hypothesis,
( ~ greater(X1,appear(efficient_producers,e))
| ~ environment(X0)
| start_time(X0) = appear(first_movers,X0)
| greater(X1,start_time(X0)) ) ).
cnf(u143,axiom,
( greater_or_equal(cardinality_at_time(sK2(X0,X1),X1),zero)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ) ).
cnf(u155,negated_conjecture,
( ~ in_environment(X0,appear(first_movers,sK0))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater_or_equal(X1,sK1)
| in_environment(X0,sK1) ) ).
cnf(u865,hypothesis,
( greater(number_of_organizations(X0,appear(efficient_producers,e)),zero)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ in_environment(X0,appear(efficient_producers,e))
| ~ environment(X0) ) ).
cnf(u532,negated_conjecture,
subpopulation(efficient_producers,sK0,sK1) ).
cnf(u1022,negated_conjecture,
( ~ greater_or_equal(X2,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0)
| ~ environment(X1)
| ~ in_environment(X1,start_time(sK0))
| ~ in_environment(X1,X2)
| ~ greater(appear(an_organisation,X0),sK1)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u57,negated_conjecture,
in_environment(sK0,sK1) ).
cnf(u161,negated_conjecture,
( ~ greater(X1,X0)
| ~ greater(X0,sK1)
| greater(X1,start_time(sK0)) ) ).
cnf(u64,axiom,
( greater(cardinality_at_time(sK2(X0,X1),X1),zero)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u291,hypothesis,
( ~ in_environment(X0,appear(efficient_producers,e))
| ~ in_environment(X0,start_time(X1))
| ~ environment(X0)
| in_environment(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u1056,hypothesis,
( ~ greater_or_equal(X2,number_of_organizations(X0,appear(efficient_producers,e)))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X1)
| ~ in_environment(X1,zero)
| ~ in_environment(X1,X2)
| ~ in_environment(X0,appear(efficient_producers,e))
| in_environment(X1,number_of_organizations(X0,appear(efficient_producers,e))) ) ).
cnf(u875,negated_conjecture,
zero = cardinality_at_time(efficient_producers,appear(an_organisation,sK0)) ).
cnf(u822,negated_conjecture,
greater_or_equal(number_of_organizations(sK0,appear(an_organisation,sK0)),zero) ).
cnf(u131,negated_conjecture,
greater_or_equal(appear(efficient_producers,e),sK1) ).
cnf(u1117,negated_conjecture,
( ~ in_environment(X1,appear(efficient_producers,e))
| ~ greater(appear(an_organisation,X0),sK1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,sK0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| in_environment(X1,appear(first_movers,X0)) ) ).
cnf(u941,negated_conjecture,
( ~ subpopulation(sK2(X0,appear(an_organisation,sK0)),X1,appear(an_organisation,sK0))
| ~ subpopulation(first_movers,X1,appear(an_organisation,sK0))
| ~ environment(X1)
| selection_favors(sK2(X0,appear(an_organisation,sK0)),first_movers,appear(an_organisation,sK0))
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,appear(an_organisation,sK0)),zero) ) ).
cnf(u61,axiom,
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| in_environment(X0,X1) ) ).
cnf(u105,negated_conjecture,
greater_or_equal(sK1,appear(an_organisation,sK0)) ).
cnf(u1010,negated_conjecture,
( ~ greater(appear(an_organisation,X0),sK1)
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ greater(X1,appear(first_movers,X0))
| greater(X1,start_time(sK0)) ) ).
cnf(u165,negated_conjecture,
( ~ greater(cardinality_at_time(X1,sK1),zero)
| ~ subpopulation(X1,X0,sK1)
| ~ subpopulation(efficient_producers,X0,sK1)
| ~ environment(X0)
| selection_favors(X1,efficient_producers,sK1) ) ).
cnf(u280,axiom,
( ~ greater(X1,appear(first_movers,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0)
| greater(X1,appear(an_organisation,X0)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n016.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 27 17:25:47 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/1.36 % (2869629)Detected formulas, will run a generic FOF schedule.
% 2.67/1.36 % (2869637)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4255985910:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.36 % (2869635)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4127237705:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.36 % (2869638)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1621846356:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.36 % (2869640)dis-21_1_sil=8000:lcm=predicate:random_seed=2421833972:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.67/1.36 % (2869634)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3921838815:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.36 % (2869636)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=985956492:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.36 % (2869639)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2326651117:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.36 % (2869637)Instruction limit reached!
% 2.67/1.36 % (2869637)------------------------------
% 2.67/1.36 % (2869637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869637)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869637)Termination reason: Instruction limit
% 2.67/1.36 % (2869637)Termination phase: Saturation
% 2.67/1.36 % (2869637)Time elapsed: 0.037 s
% 2.67/1.36 % (2869637)Peak memory usage: 89 MB
% 2.67/1.36 % (2869637)Instructions burned: 111 (million)
% 2.67/1.36 % (2869639)Instruction limit reached!
% 2.67/1.36 % (2869639)------------------------------
% 2.67/1.36 % (2869639)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869639)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869639)Termination reason: Instruction limit
% 2.67/1.36 % (2869639)Termination phase: Saturation
% 2.67/1.36 % (2869639)Time elapsed: 0.069 s
% 2.67/1.36 % (2869639)Peak memory usage: 88 MB
% 2.67/1.36 % (2869639)Instructions burned: 139 (million)
% 2.67/1.36 % (2869638)Instruction limit reached!
% 2.67/1.36 % (2869638)------------------------------
% 2.67/1.36 % (2869638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869638)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869638)Termination reason: Instruction limit
% 2.67/1.36 % (2869638)Termination phase: Saturation
% 2.67/1.36 % (2869638)Time elapsed: 0.071 s
% 2.67/1.36 % (2869638)Peak memory usage: 88 MB
% 2.67/1.36 % (2869638)Instructions burned: 121 (million)
% 2.67/1.36 % (2869640)Instruction limit reached!
% 2.67/1.36 % (2869640)------------------------------
% 2.67/1.36 % (2869640)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869640)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869640)Termination reason: Instruction limit
% 2.67/1.36 % (2869640)Termination phase: Saturation
% 2.67/1.36 % (2869640)Time elapsed: 0.075 s
% 2.67/1.36 % (2869640)Peak memory usage: 88 MB
% 2.67/1.36 % (2869640)Instructions burned: 130 (million)
% 2.67/1.36 % (2869648)lrs+10_1_sil=8000:sp=occurrence:random_seed=1426613306:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.67/1.36 % (2869648)First to succeed.
% 2.67/1.36 % (2869648)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2869629"
% 2.67/1.36 % (2869651)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2412819400:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 2.67/1.36 % (2869650)lrs+1011_1_sil=32000:sp=occurrence:random_seed=277650788:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.67/1.36 % (2869649)lrs+10_1_sil=32000:urr=on:br=off:random_seed=412025949:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.67/1.36 % (2869649)Refutation not found, incomplete strategy
% 2.67/1.36 % (2869649)------------------------------
% 2.67/1.36 % (2869649)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869649)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869649)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.36 % (2869649)Time elapsed: 0.005 s
% 2.67/1.36 % (2869649)Peak memory usage: 88 MB
% 2.67/1.36 % (2869649)Instructions burned: 6 (million)
% 2.67/1.36 % (2869651)Refutation not found, incomplete strategy
% 2.67/1.36 % (2869651)------------------------------
% 2.67/1.36 % (2869651)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (2869651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (2869651)CaDiCaL version: 2.1.3
% 2.67/1.36 % (2869651)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.36 % (2869651)Time elapsed: 0.007 s
% 2.67/1.36 % (2869651)Peak memory usage: 88 MB
% 2.67/1.36 % (2869651)Instructions burned: 8 (million)
% 2.67/1.36 % SZS status CounterSatisfiable for theBenchmark
% 2.67/1.36 % SZS output start Saturation.
% See solution above
% 3.99/1.47 % SZS output start Definitions and Model Updates.
% 3.99/1.47 % SZS output end Definitions and Model Updates.
% 3.99/1.47 % (2869648)------------------------------
% 3.99/1.47 % (2869648)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.47 % (2869648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.47 % (2869648)CaDiCaL version: 2.1.3
% 3.99/1.47 % (2869648)Termination reason: Satisfiable
% 3.99/1.47 % (2869648)Time elapsed: 0.018 s
% 3.99/1.47 % (2869648)Peak memory usage: 89 MB
% 3.99/1.47 % (2869648)Instructions burned: 43 (million)
% 3.99/1.47 % (2869648)------------------------------
% 3.99/1.47 % (2869648)------------------------------
% 3.99/1.47 % (2869629)Success in time 0.494 s
% 3.99/1.47 % Vampire exiting
%------------------------------------------------------------------------------