↑ Up

Vampire---5.0.1.SAT-Sat.s

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

% Computer : n014.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:11 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u35,axiom,
    ( ~ empty(sk1(end_time(sk1(X0))))
    | ~ observational_period(end_time(sk1(X0)))
    | extreme(end_time(sk1(X0)))
    | ~ observational_period(X0)
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(prove_t9_44,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2) ).

cnf(u29,axiom,
    ( greater(end_time(X0),appear(an_organisation,X0))
    | ~ environment(X0)
    | empty(X0)
    | end_time(X0) = appear(an_organisation,X0) ) ).

cnf(mp6_not_extreme_change_means_not_empty_27,axiom,
    ( ~ in_environment(X0,X1)
    | extreme(X0)
    | ~ environment(X1)
    | ~ observational_period(X0)
    | ~ empty(X1) ) ).

cnf(u34,axiom,
    ( environment(sk1(end_time(sk1(X0))))
    | selection_favors(efficient_producers,first_movers,X0)
    | ~ observational_period(X0)
    | ~ observational_period(end_time(sk1(X0))) ) ).

cnf(u39,axiom,
    ( greater(appear(efficient_producers,X0),X1)
    | greater(X1,appear(efficient_producers,X0))
    | ~ in_environment(X0,X1)
    | appear(efficient_producers,X0) = X1 ) ).

cnf(mp_appearance_of_EP_37,axiom,
    ( greater_or_equal(X1,appear(efficient_producers,X0))
    | greater(appear(efficient_producers,X0),X1)
    | ~ in_environment(X0,X1) ) ).

cnf(mp_non_empty_means_organisations_32,axiom,
    ( greater_or_equal(end_time(X0),appear(an_organisation,X0))
    | empty(X0)
    | ~ environment(X0) ) ).

cnf(mp5_rapid_change_is_non_critical_26,axiom,
    ( ~ in_environment(X1,critical_point(X1))
    | ~ rapid_change(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1)
    | ~ observational_period(X0) ) ).

cnf(u41,hypothesis,
    ( ~ environment(X0)
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | empty(X0) ) ).

cnf(t3_39,hypothesis,
    ( ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ in_environment(X0,critical_point(X0))
    | ~ environment(X0)
    | ~ greater(critical_point(X0),X1)
    | selection_favors(first_movers,efficient_producers,X1) ) ).

cnf(u28,axiom,
    ( ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X0)))
    | ~ observational_period(X0)
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(u27,axiom,
    ( in_environment(X0,sk1(X0))
    | ~ observational_period(X0)
    | selection_favors(efficient_producers,first_movers,X0) ) ).

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

cnf(u38,axiom,
    ( ~ empty(appear(an_organisation,X0))
    | empty(X0)
    | extreme(X0)
    | ~ environment(appear(an_organisation,X0))
    | ~ observational_period(X0)
    | ~ environment(X0) ) ).

cnf(prove_t9_43,negated_conjecture,
    ~ extreme(sk2) ).

cnf(t2_38,hypothesis,
    ( ~ greater_or_equal(X1,appear(first_movers,X0))
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | ~ greater(appear(efficient_producers,X0),X1)
    | selection_favors(first_movers,efficient_producers,X1) ) ).

cnf(mp_organizational_sets2_29,axiom,
    propagation_strategy(efficient_producers) ).

cnf(u50,axiom,
    ( ~ in_environment(X0,appear(efficient_producers,X1))
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0))
    | greater(appear(efficient_producers,X0),appear(efficient_producers,X1))
    | ~ environment(X0)
    | greater(appear(efficient_producers,X1),critical_point(X0))
    | ~ in_environment(X1,critical_point(X0))
    | critical_point(X0) = appear(efficient_producers,X1) ) ).

cnf(u26,axiom,
    ( selection_favors(efficient_producers,first_movers,X0)
    | environment(sk1(X0))
    | ~ observational_period(X0) ) ).

cnf(u33,axiom,
    ( selection_favors(efficient_producers,first_movers,X0)
    | ~ observational_period(X0)
    | ~ empty(sk1(X0))
    | extreme(X0) ) ).

cnf(mp_critical_point_not_before_opening_31,axiom,
    ( greater(critical_point(X0),end_time(X0))
    | in_environment(X0,critical_point(X0))
    | ~ environment(X0) ) ).

cnf(prove_t9_42,negated_conjecture,
    rapid_change(sk2) ).

cnf(u44,axiom,
    ( ~ greater(critical_point(X0),X1)
    | ~ environment(X0)
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0))
    | greater(appear(efficient_producers,X0),X1)
    | ~ in_environment(X0,X1) ) ).

cnf(u43,hypothesis,
    ( empty(sk1(end_time(sk1(X0))))
    | ~ observational_period(X0)
    | ~ observational_period(end_time(sk1(X0)))
    | appear(an_organisation,sk1(end_time(sk1(X0)))) = appear(first_movers,sk1(end_time(sk1(X0))))
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(prove_t9_41,negated_conjecture,
    observational_period(sk2) ).

cnf(u30,axiom,
    ( ~ empty(end_time(X0))
    | ~ environment(end_time(X0))
    | ~ observational_period(X0)
    | extreme(X0)
    | ~ environment(X0) ) ).

cnf(mp_organizational_sets1_28,axiom,
    propagation_strategy(first_movers) ).

cnf(u52,axiom,
    ( greater(appear(efficient_producers,X0),end_time(X0))
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0))
    | ~ environment(X0) ) ).

cnf(u54,hypothesis,
    ( ~ observational_period(end_time(sk1(X0)))
    | ~ observational_period(X0)
    | appear(an_organisation,sk1(end_time(sk1(X0)))) = appear(first_movers,sk1(end_time(sk1(X0))))
    | selection_favors(efficient_producers,first_movers,X0)
    | extreme(end_time(sk1(X0))) ) ).

cnf(u37,axiom,
    ( in_environment(X0,appear(an_organisation,X0))
    | ~ environment(X0)
    | empty(X0) ) ).

cnf(mp_endpoint_in_environment_30,axiom,
    ( in_environment(X0,end_time(X0))
    | ~ environment(X0) ) ).

cnf(u47,hypothesis,
    ( ~ in_environment(X0,appear(efficient_producers,X1))
    | ~ in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,appear(efficient_producers,X1))
    | greater(appear(efficient_producers,X0),appear(efficient_producers,X1))
    | ~ environment(X0)
    | greater(appear(efficient_producers,X1),critical_point(X0))
    | ~ in_environment(X1,critical_point(X0))
    | critical_point(X0) = appear(efficient_producers,X1) ) ).

cnf(u42,hypothesis,
    ( ~ greater(critical_point(X0),X1)
    | ~ environment(X0)
    | ~ in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,X1)
    | greater(appear(efficient_producers,X0),X1)
    | ~ in_environment(X0,X1) ) ).

cnf(l13_40,hypothesis,
    ( ~ in_environment(X0,appear(an_organisation,X0))
    | ~ environment(X0)
    | appear(an_organisation,X0) = appear(first_movers,X0) ) ).

cnf(mp_selection_favours_in_time_34,axiom,
    ( ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0)
    | ~ greater(critical_point(X0),X1)
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).

cnf(mp_appearance_before_end_holds_33,axiom,
    ( ~ greater_or_equal(end_time(X0),appear(an_organisation,X0))
    | ~ environment(X0)
    | in_environment(X0,appear(an_organisation,X0)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT040-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n014.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 17:25:01 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/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
% 3.61/1.48  % (1041252)Input is clausal, will run a generic CNF schedule.
% 3.61/1.48  % (1041259)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4054038267:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.61/1.48  % (1041260)lrs+10_1_sil=8000:sp=occurrence:random_seed=252787206:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.61/1.48  % (1041258)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1303283446:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.61/1.48  % (1041263)dis-21_1_sil=8000:lcm=predicate:random_seed=2415939033:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.61/1.48  % (1041261)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2332459708:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.61/1.48  % (1041257)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=4097642360:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.61/1.48  % (1041262)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2414460827:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.61/1.48  % (1041261)Refutation not found, incomplete strategy
% 3.61/1.48  % (1041261)------------------------------
% 3.61/1.48  % (1041261)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (1041261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (1041261)CaDiCaL version: 2.1.3
% 3.61/1.48  % (1041261)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48  % (1041261)Time elapsed: 0.001 s
% 3.61/1.48  % (1041261)Peak memory usage: 86 MB
% 3.61/1.48  % (1041263)Refutation not found, incomplete strategy
% 3.61/1.48  % (1041263)------------------------------
% 3.61/1.48  % (1041263)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (1041263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (1041263)CaDiCaL version: 2.1.3
% 3.61/1.48  % (1041263)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48  % (1041263)Time elapsed: 0.002 s
% 3.61/1.48  % (1041263)Peak memory usage: 88 MB
% 3.61/1.48  % (1041263)Instructions burned: 1 (million)
% 3.61/1.48  % (1041260)First to succeed.
% 3.61/1.48  % (1041260)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1041252"
% 3.61/1.48  % (1041262)Refutation not found, incomplete strategy
% 3.61/1.48  % (1041262)------------------------------
% 3.61/1.48  % (1041262)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (1041262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (1041262)CaDiCaL version: 2.1.3
% 3.61/1.48  % (1041262)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48  % (1041262)Time elapsed: 0.004 s
% 3.61/1.48  % (1041262)Peak memory usage: 88 MB
% 3.61/1.48  % (1041262)Instructions burned: 4 (million)
% 3.61/1.48  % (1041262)------------------------------
% 3.61/1.48  % (1041262)------------------------------
% 3.61/1.48  % (1041261)------------------------------
% 3.61/1.48  % (1041261)------------------------------
% 3.61/1.48  % (1041263)------------------------------
% 3.61/1.48  % (1041263)------------------------------
% 3.61/1.48  % SZS status Satisfiable for theBenchmark
% 3.61/1.48  % SZS output start Saturation.
% See solution above
% 3.61/1.48  % SZS output start Definitions and Model Updates.
% 3.61/1.48  % SZS output end Definitions and Model Updates.
% 3.61/1.48  % (1041260)------------------------------
% 3.61/1.48  % (1041260)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (1041260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (1041260)CaDiCaL version: 2.1.3
% 3.61/1.48  % (1041260)Termination reason: Satisfiable
% 3.61/1.48  % (1041260)Time elapsed: 0.003 s
% 3.61/1.48  % (1041260)Peak memory usage: 88 MB
% 3.61/1.48  % (1041260)Instructions burned: 3 (million)
% 3.61/1.48  % (1041260)------------------------------
% 3.61/1.48  % (1041260)------------------------------
% 3.61/1.48  % (1041252)Success in time 0.429 s
% 3.61/1.48  % Vampire exiting
%------------------------------------------------------------------------------