↑ Up

Vampire-SAT---5.0.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : MGT033-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n020.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:36 PM UTC 2026

% Result   : Satisfiable 0.16s 0.47s
% Output   : Saturation 0.16s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u54,negated_conjecture,
    appear(first_movers,sk2) != appear(an_organisation,sk2) ).

cnf(u59,negated_conjecture,
    greater(appear(first_movers,sk2),appear(an_organisation,sk2)) ).

cnf(u63,negated_conjecture,
    appear(first_movers,sk2) != start_time(sk2) ).

cnf(u68,negated_conjecture,
    greater(appear(first_movers,sk2),start_time(sk2)) ).

cnf(u72,negated_conjecture,
    sk3 != appear(first_movers,sk2) ).

cnf(u77,negated_conjecture,
    greater(sk3,appear(first_movers,sk2)) ).

cnf(u156,negated_conjecture,
    ~ in_environment(sk2,number_of_organizations(sk2,appear(first_movers,sk2))) ).

cnf(u161,negated_conjecture,
    ~ in_environment(sk2,number_of_organizations(e,appear(an_organisation,sk2))) ).

cnf(u168,negated_conjecture,
    ~ in_environment(sk2,number_of_organizations(sk2,appear(an_organisation,sk2))) ).

cnf(u183,negated_conjecture,
    zero != cardinality_at_time(first_movers,t) ).

cnf(u186,negated_conjecture,
    greater(zero,zero) ).

cnf(u192,negated_conjecture,
    ( ~ subpopulation(X0,sk2,appear(an_organisation,sk2))
    | selection_favors(first_movers,X0,appear(an_organisation,sk2))
    | zero != cardinality_at_time(X0,appear(an_organisation,sk2)) ) ).

cnf(u204,negated_conjecture,
    ~ in_environment(sk2,appear(efficient_producers,e)) ).

cnf(u216,negated_conjecture,
    ~ in_environment(sk2,appear(efficient_producers,sk2)) ).

cnf(u228,negated_conjecture,
    first_movers = sk1(appear(first_movers,sk2),sk2) ).

cnf(u231,negated_conjecture,
    efficient_producers != sk1(appear(first_movers,sk2),sk2) ).

cnf(u239,negated_conjecture,
    greater(number_of_organizations(sk2,appear(an_organisation,sk2)),zero) ).

cnf(u242,negated_conjecture,
    in_environment(sk2,appear(an_organisation,sk2)) ).

cnf(u255,negated_conjecture,
    greater(number_of_organizations(sk2,appear(first_movers,sk2)),zero) ).

cnf(u258,negated_conjecture,
    in_environment(sk2,appear(first_movers,sk2)) ).

cnf(u323,negated_conjecture,
    ~ in_environment(sk2,number_of_organizations(sk2,sk3)) ).

cnf(u358,negated_conjecture,
    first_movers != sk1(sk3,sk2) ).

cnf(u363,negated_conjecture,
    efficient_producers = sk1(sk3,sk2) ).

cnf(u401,negated_conjecture,
    first_movers != sk1(appear(an_organisation,sk2),sk2) ).

cnf(u406,negated_conjecture,
    efficient_producers = sk1(appear(an_organisation,sk2),sk2) ).

cnf(u444,negated_conjecture,
    ~ greater(appear(first_movers,sk2),sk3) ).

cnf(u519,negated_conjecture,
    ~ in_environment(sk2,cardinality_at_time(first_movers,appear(first_movers,sk2))) ).

cnf(u544,negated_conjecture,
    ~ in_environment(sk2,cardinality_at_time(first_movers,sk3)) ).

cnf(u556,negated_conjecture,
    zero != cardinality_at_time(first_movers,appear(first_movers,sk2)) ).

cnf(u575,negated_conjecture,
    zero != cardinality_at_time(first_movers,sk3) ).

cnf(u611,negated_conjecture,
    selection_favors(first_movers,efficient_producers,appear(first_movers,sk2)) ).

cnf(u614,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,appear(first_movers,sk2)) ).

cnf(u295,negated_conjecture,
    greater(appear(efficient_producers,sk2),start_time(sk2)) ).

cnf(mp_number_mean_non_empty_25,axiom,
    ( ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | subpopulation(sk1(X1,X0),X0,X1) ) ).

cnf(u476,negated_conjecture,
    subpopulation(efficient_producers,sk2,appear(first_movers,sk2)) ).

cnf(u810,negated_conjecture,
    selection_favors(first_movers,efficient_producers,start_time(sk2)) ).

cnf(a1_42,hypothesis,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater_or_equal(X1,appear(an_organisation,X0))
    | greater(number_of_organizations(X0,X1),zero) ) ).

cnf(u94,negated_conjecture,
    ( ~ greater(number_of_organizations(sk2,X0),zero)
    | greater(cardinality_at_time(sk1(X0,sk2),X0),zero) ) ).

cnf(u37,negated_conjecture,
    greater_or_equal(appear(first_movers,sk2),appear(an_organisation,sk2)) ).

cnf(u40,negated_conjecture,
    ( ~ in_environment(sk2,X0)
    | subpopulation(first_movers,sk2,X0) ) ).

cnf(u172,negated_conjecture,
    greater_or_equal(appear(efficient_producers,e),appear(an_organisation,sk2)) ).

cnf(u684,negated_conjecture,
    ( ~ greater(appear(an_organisation,sk2),X0)
    | greater(appear(efficient_producers,e),X0) ) ).

cnf(u343,negated_conjecture,
    greater_or_equal(appear(efficient_producers,sk2),appear(an_organisation,sk2)) ).

cnf(u756,negated_conjecture,
    ( ~ subpopulation(X0,sk2,start_time(sk2))
    | zero != cardinality_at_time(X0,start_time(sk2))
    | selection_favors(first_movers,X0,start_time(sk2)) ) ).

cnf(u814,negated_conjecture,
    selection_favors(first_movers,efficient_producers,appear(an_organisation,sk2)) ).

cnf(mp_durations_are_time_intervals_30,axiom,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ in_environment(X0,X2)
    | ~ greater_or_equal(X2,X3)
    | ~ greater_or_equal(X3,X1)
    | in_environment(X0,X3) ) ).

cnf(u829,negated_conjecture,
    selection_favors(efficient_producers,first_movers,start_time(sk2)) ).

cnf(u317,negated_conjecture,
    greater_or_equal(appear(efficient_producers,e),start_time(sk2)) ).

cnf(u597,negated_conjecture,
    first_movers != efficient_producers ).

cnf(u25,hypothesis,
    ( ~ environment(X0)
    | ~ subpopulation(X1,X0,X2)
    | ~ greater(cardinality_at_time(X1,X2),zero)
    | efficient_producers = X1
    | first_movers = X1 ) ).

cnf(u478,negated_conjecture,
    greater(cardinality_at_time(sk1(appear(first_movers,sk2),sk2),appear(first_movers,sk2)),zero) ).

cnf(u828,negated_conjecture,
    selection_favors(efficient_producers,efficient_producers,start_time(sk2)) ).

cnf(u44,negated_conjecture,
    ( ~ greater(sk3,X0)
    | greater(appear(efficient_producers,sk2),X0) ) ).

cnf(mp_FM_not_precede_first_34,axiom,
    ( ~ environment(X0)
    | greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0)) ) ).

cnf(u496,negated_conjecture,
    greater_or_equal(cardinality_at_time(first_movers,appear(first_movers,sk2)),zero) ).

cnf(u331,negated_conjecture,
    greater_or_equal(appear(efficient_producers,sk2),start_time(sk2)) ).

cnf(u123,negated_conjecture,
    ( ~ greater(appear(X0,sk2),sk3)
    | zero = cardinality_at_time(X0,sk3) ) ).

cnf(u732,negated_conjecture,
    ( ~ greater(appear(an_organisation,sk2),X0)
    | greater(appear(efficient_producers,sk2),X0) ) ).

cnf(u290,negated_conjecture,
    greater_or_equal(number_of_organizations(sk2,appear(first_movers,sk2)),zero) ).

cnf(u730,negated_conjecture,
    zero = cardinality_at_time(first_movers,appear(an_organisation,sk2)) ).

cnf(u293,negated_conjecture,
    greater(sk3,appear(an_organisation,sk2)) ).

cnf(prove_t2_48,negated_conjecture,
    greater(appear(efficient_producers,sk2),sk3) ).

cnf(u645,negated_conjecture,
    greater(appear(efficient_producers,sk2),appear(first_movers,sk2)) ).

cnf(u481,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(number_of_organizations(sk2,appear(first_movers,sk2)),X0) ) ).

cnf(u32,negated_conjecture,
    greater_or_equal(appear(efficient_producers,sk2),sk3) ).

cnf(u834,negated_conjecture,
    selection_favors(efficient_producers,efficient_producers,appear(first_movers,sk2)) ).

cnf(u838,negated_conjecture,
    selection_favors(efficient_producers,first_movers,appear(an_organisation,sk2)) ).

cnf(u294,negated_conjecture,
    greater(sk3,start_time(sk2)) ).

cnf(u755,negated_conjecture,
    ( ~ subpopulation(X0,sk2,sk3)
    | zero != cardinality_at_time(X0,sk3)
    | selection_favors(efficient_producers,X0,sk3) ) ).

cnf(u353,negated_conjecture,
    greater_or_equal(cardinality_at_time(sk1(sk3,sk2),sk3),zero) ).

cnf(u8,axiom,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater(appear(X2,X0),X1)
    | zero = cardinality_at_time(X2,X1) ) ).

cnf(u36,negated_conjecture,
    greater_or_equal(appear(efficient_producers,e),appear(first_movers,sk2)) ).

cnf(u31,negated_conjecture,
    in_environment(sk2,start_time(sk2)) ).

cnf(u43,negated_conjecture,
    ( ~ in_environment(sk2,X0)
    | subpopulation(efficient_producers,sk2,X0) ) ).

cnf(u652,negated_conjecture,
    subpopulation(first_movers,sk2,appear(an_organisation,sk2)) ).

cnf(u103,negated_conjecture,
    ( ~ greater(cardinality_at_time(X0,X1),zero)
    | ~ subpopulation(X0,sk2,X1)
    | efficient_producers = X0
    | first_movers = X0 ) ).

cnf(u724,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(cardinality_at_time(first_movers,appear(first_movers,sk2)),X0) ) ).

cnf(u34,negated_conjecture,
    greater_or_equal(appear(first_movers,sk2),start_time(sk2)) ).

cnf(u650,negated_conjecture,
    ( ~ greater(appear(X0,sk2),appear(an_organisation,sk2))
    | zero = cardinality_at_time(X0,appear(an_organisation,sk2)) ) ).

cnf(u678,negated_conjecture,
    greater_or_equal(appear(efficient_producers,sk2),appear(first_movers,sk2)) ).

cnf(u731,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,appear(an_organisation,sk2)) ).

cnf(u815,negated_conjecture,
    selection_favors(first_movers,first_movers,appear(an_organisation,sk2)) ).

cnf(u285,negated_conjecture,
    greater_or_equal(number_of_organizations(sk2,appear(an_organisation,sk2)),zero) ).

cnf(u665,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(number_of_organizations(sk2,sk3),X0) ) ).

cnf(u329,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,start_time(sk2)) ).

cnf(mp_no_FM_before_opening_32,axiom,
    ( ~ environment(X0)
    | greater_or_equal(appear(first_movers,X0),start_time(X0)) ) ).

cnf(u316,negated_conjecture,
    ( ~ greater(start_time(sk2),X0)
    | greater(appear(efficient_producers,e),X0) ) ).

cnf(u716,negated_conjecture,
    ( ~ subpopulation(X0,sk2,appear(first_movers,sk2))
    | zero != cardinality_at_time(X0,appear(first_movers,sk2))
    | selection_favors(sk1(appear(first_movers,sk2),sk2),X0,appear(first_movers,sk2)) ) ).

cnf(u311,negated_conjecture,
    greater(cardinality_at_time(sk1(sk3,sk2),sk3),zero) ).

cnf(mp_greater_or_equal_39,axiom,
    ( ~ greater_or_equal(X0,X1)
    | greater(X0,X1)
    | X0 = X1 ) ).

cnf(u712,negated_conjecture,
    zero != cardinality_at_time(sk1(appear(first_movers,sk2),sk2),t) ).

cnf(u38,negated_conjecture,
    greater(number_of_organizations(e,appear(an_organisation,sk2)),zero) ).

cnf(u654,negated_conjecture,
    ( ~ greater(appear(an_organisation,sk2),X0)
    | greater(sk3,X0) ) ).

cnf(u726,negated_conjecture,
    ( ~ subpopulation(X0,sk2,appear(first_movers,sk2))
    | zero != cardinality_at_time(X0,appear(first_movers,sk2))
    | selection_favors(first_movers,X0,appear(first_movers,sk2)) ) ).

cnf(u97,negated_conjecture,
    subpopulation(efficient_producers,sk2,sk3) ).

cnf(u713,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(cardinality_at_time(sk1(appear(first_movers,sk2),sk2),appear(first_movers,sk2)),X0) ) ).

cnf(u304,negated_conjecture,
    greater_or_equal(sk3,appear(an_organisation,sk2)) ).

cnf(a3_43,hypothesis,
    ( ~ environment(X0)
    | greater(appear(efficient_producers,e),appear(first_movers,X0)) ) ).

cnf(u475,negated_conjecture,
    ( ~ greater(appear(X0,sk2),appear(first_movers,sk2))
    | zero = cardinality_at_time(X0,appear(first_movers,sk2)) ) ).

cnf(prove_t2_45,negated_conjecture,
    environment(sk2) ).

cnf(u651,negated_conjecture,
    subpopulation(efficient_producers,sk2,appear(an_organisation,sk2)) ).

cnf(u86,negated_conjecture,
    ( ~ greater(number_of_organizations(sk2,X0),zero)
    | in_environment(sk2,X0) ) ).

cnf(u41,negated_conjecture,
    subpopulation(first_movers,sk2,sk3) ).

cnf(u302,negated_conjecture,
    greater(appear(efficient_producers,sk2),appear(an_organisation,sk2)) ).

cnf(u104,negated_conjecture,
    ( ~ greater_or_equal(X1,X2)
    | ~ in_environment(sk2,X1)
    | ~ in_environment(sk2,X0)
    | ~ greater_or_equal(X2,X0)
    | in_environment(sk2,X2) ) ).

cnf(mp_number_mean_non_empty_26,axiom,
    ( ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | greater(cardinality_at_time(sk1(X1,X0),X1),zero) ) ).

cnf(mp_opening_time_in_duration_31,axiom,
    ( ~ environment(X0)
    | in_environment(X0,start_time(X0)) ) ).

cnf(u2,axiom,
    ( ~ environment(X0)
    | ~ subpopulation(X1,X0,X2)
    | ~ subpopulation(X3,X0,X2)
    | ~ greater(cardinality_at_time(X1,X2),zero)
    | zero != cardinality_at_time(X3,X2)
    | selection_favors(X1,X3,X2) ) ).

cnf(prove_t2_49,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk3) ).

cnf(u646,negated_conjecture,
    ( ~ greater(appear(first_movers,sk2),X0)
    | greater(sk3,X0) ) ).

cnf(mp_subpopulations_37,axiom,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | subpopulation(efficient_producers,X0,X1) ) ).

cnf(u45,negated_conjecture,
    ( ~ greater(appear(first_movers,sk2),X0)
    | greater(appear(efficient_producers,e),X0) ) ).

cnf(u279,negated_conjecture,
    ( ~ greater(start_time(sk2),X0)
    | greater(appear(first_movers,sk2),X0) ) ).

cnf(u351,negated_conjecture,
    zero != cardinality_at_time(sk1(sk3,sk2),t) ).

cnf(u803,negated_conjecture,
    selection_favors(efficient_producers,efficient_producers,sk3) ).

cnf(u6,axiom,
    ( ~ greater(cardinality_at_time(X0,X1),zero)
    | zero != cardinality_at_time(X0,t) ) ).

cnf(u310,negated_conjecture,
    greater(number_of_organizations(sk2,sk3),zero) ).

cnf(u750,negated_conjecture,
    zero != cardinality_at_time(efficient_producers,t) ).

cnf(u643,negated_conjecture,
    ( ~ greater(start_time(sk2),X0)
    | greater(sk3,X0) ) ).

cnf(u297,negated_conjecture,
    greater_or_equal(sk3,start_time(sk2)) ).

cnf(mp_greater_or_equal_41,axiom,
    ( X0 != X1
    | greater_or_equal(X0,X1) ) ).

cnf(u33,axiom,
    greater_or_equal(X0,X0) ).

cnf(u93,negated_conjecture,
    ( ~ greater(number_of_organizations(sk2,X0),zero)
    | subpopulation(sk1(X0,sk2),sk2,X0) ) ).

cnf(u312,negated_conjecture,
    subpopulation(sk1(sk3,sk2),sk2,sk3) ).

cnf(u96,negated_conjecture,
    ( ~ in_environment(sk2,X0)
    | ~ greater(appear(X1,sk2),X0)
    | zero = cardinality_at_time(X1,X0) ) ).

cnf(u298,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,sk3) ).

cnf(u301,negated_conjecture,
    zero = cardinality_at_time(first_movers,start_time(sk2)) ).

cnf(mp_positive_and_sustains_29,axiom,
    ( ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | in_environment(X0,X1) ) ).

cnf(u477,negated_conjecture,
    subpopulation(first_movers,sk2,appear(first_movers,sk2)) ).

cnf(prove_t2_47,negated_conjecture,
    greater_or_equal(sk3,appear(first_movers,sk2)) ).

cnf(u35,negated_conjecture,
    greater(appear(efficient_producers,e),appear(first_movers,sk2)) ).

cnf(u95,negated_conjecture,
    ( ~ greater_or_equal(X0,appear(an_organisation,sk2))
    | ~ in_environment(sk2,X0)
    | greater(number_of_organizations(sk2,X0),zero) ) ).

cnf(u670,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(number_of_organizations(sk2,appear(an_organisation,sk2)),X0) ) ).

cnf(u98,negated_conjecture,
    subpopulation(efficient_producers,sk2,start_time(sk2)) ).

cnf(u714,negated_conjecture,
    greater_or_equal(cardinality_at_time(sk1(appear(first_movers,sk2),sk2),appear(first_movers,sk2)),zero) ).

cnf(u170,negated_conjecture,
    greater(appear(efficient_producers,e),appear(an_organisation,sk2)) ).

cnf(mp_FM_means_organisations_33,axiom,
    ( ~ environment(X0)
    | ~ in_environment(X0,appear(first_movers,X0))
    | in_environment(X0,appear(an_organisation,X0)) ) ).

cnf(u757,negated_conjecture,
    ( ~ subpopulation(X0,sk2,start_time(sk2))
    | zero != cardinality_at_time(X0,start_time(sk2))
    | selection_favors(efficient_producers,X0,start_time(sk2)) ) ).

cnf(mp_subpopulations_36,axiom,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | subpopulation(first_movers,X0,X1) ) ).

cnf(u315,negated_conjecture,
    greater_or_equal(number_of_organizations(sk2,sk3),zero) ).

cnf(u39,negated_conjecture,
    greater_or_equal(number_of_organizations(e,appear(an_organisation,sk2)),zero) ).

cnf(u484,negated_conjecture,
    greater(cardinality_at_time(first_movers,appear(first_movers,sk2)),zero) ).

cnf(u660,negated_conjecture,
    ( ~ greater(appear(an_organisation,sk2),X0)
    | greater(appear(first_movers,sk2),X0) ) ).

cnf(u479,negated_conjecture,
    subpopulation(sk1(appear(first_movers,sk2),sk2),sk2,appear(first_movers,sk2)) ).

cnf(u42,negated_conjecture,
    subpopulation(first_movers,sk2,start_time(sk2)) ).

cnf(u811,negated_conjecture,
    selection_favors(first_movers,first_movers,start_time(sk2)) ).

cnf(u278,negated_conjecture,
    greater(appear(efficient_producers,e),start_time(sk2)) ).

cnf(u837,negated_conjecture,
    selection_favors(efficient_producers,efficient_producers,appear(an_organisation,sk2)) ).

cnf(u770,negated_conjecture,
    ( ~ subpopulation(X0,sk2,appear(first_movers,sk2))
    | zero != cardinality_at_time(X0,appear(first_movers,sk2))
    | selection_favors(efficient_producers,X0,appear(first_movers,sk2)) ) ).

cnf(mp_positive_number_when_appear_35,axiom,
    ( ~ environment(X0)
    | greater(number_of_organizations(e,appear(an_organisation,X0)),zero) ) ).

cnf(mp_greater_or_equal_40,axiom,
    ( ~ greater(X0,X1)
    | greater_or_equal(X0,X1) ) ).

cnf(prove_t2_46,negated_conjecture,
    in_environment(sk2,sk3) ).

cnf(u775,negated_conjecture,
    ( ~ subpopulation(X0,sk2,appear(an_organisation,sk2))
    | zero != cardinality_at_time(X0,appear(an_organisation,sk2))
    | selection_favors(efficient_producers,X0,appear(an_organisation,sk2)) ) ).

cnf(mp_greater_transitivity_38,axiom,
    ( ~ greater(X0,X1)
    | ~ greater(X1,X2)
    | greater(X0,X2) ) ).

cnf(u46,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(number_of_organizations(e,appear(an_organisation,sk2)),X0) ) ).

cnf(u677,negated_conjecture,
    ( ~ greater(appear(first_movers,sk2),X0)
    | greater(appear(efficient_producers,sk2),X0) ) ).

cnf(u105,negated_conjecture,
    ( ~ greater(cardinality_at_time(X0,X1),zero)
    | ~ subpopulation(X2,sk2,X1)
    | ~ subpopulation(X0,sk2,X1)
    | zero != cardinality_at_time(X2,X1)
    | selection_favors(X0,X2,X1) ) ).

cnf(u687,negated_conjecture,
    ( ~ greater(start_time(sk2),X0)
    | greater(appear(efficient_producers,sk2),X0) ) ).

cnf(u124,negated_conjecture,
    ( ~ greater(appear(X0,sk2),start_time(sk2))
    | zero = cardinality_at_time(X0,start_time(sk2)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT033-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.38  % Computer : n020.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:21:34 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/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.16/0.47  % (3627372)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (3627382)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4261934713:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47  % (3627378)% WARNING: option uhcvi not known.
% 0.16/0.47  % (3627377)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3069594150_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47  % (3627378)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2614322422:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47  % (3627379)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2590541547:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47  % (3627381)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=403959589:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47  % (3627380)dis+10_1_sil=32000:sp=arity:random_seed=1285730037:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (3627383)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4115239562:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47  % TRYING [1]
% 0.16/0.47  % TRYING [2]
% 0.16/0.47  % (3627382) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3627372-3627382"...
% 0.16/0.47  % Finite Model Found!
% 0.16/0.47  % SZS status Satisfiable for theBenchmark
% 0.16/0.47  % (3627377) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3627372-3627377"...
% 0.16/0.47  % (3627382)...printing done.
% 0.16/0.47  % SZS status Satisfiable for theBenchmark
% 0.16/0.47  % SZS output start Saturation.
% See solution above
% 0.16/0.47  % SZS output start Definitions and Model Updates.
% 0.16/0.47  % SZS output end Definitions and Model Updates.
% 0.16/0.47  % (3627382)------------------------------
% 0.16/0.47  % (3627382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (3627382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (3627382)CaDiCaL version: 2.1.3
% 0.16/0.47  % (3627382)Termination reason: Satisfiable
% 0.16/0.47  % (3627382)Time elapsed: 0.012 s
% 0.16/0.47  % (3627382)Peak memory usage: 12 MB
% 0.16/0.47  % (3627382)Instructions burned: 31 (million)
% 0.16/0.47  % (3627372)Success in time 0.044 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------