↑ Up

Vampire---5.0.1.CSA-Sat.s

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

% Computer : n006.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 3.72s 1.49s
% Output   : Saturation 3.72s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u57,hypothesis,
    ~ environment(e) ).

cnf(u35,negated_conjecture,
    environment(sK0) ).

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

cnf(u48,axiom,
    ( ~ greater(X2,cardinality_at_time(sK1(X0,X1),X1))
    | ~ greater(number_of_organizations(X0,X1),zero)
    | ~ environment(X0)
    | greater(X2,zero) ) ).

cnf(u39,axiom,
    ( ~ greater(cardinality_at_time(first_movers,X1),zero)
    | ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater(appear(first_movers,X0),X1) ) ).

cnf(u63,hypothesis,
    ( greater(appear(efficient_producers,e),appear(an_organisation,X0))
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | ~ environment(X0) ) ).

cnf(u34,negated_conjecture,
    in_environment(sK0,appear(an_organisation,sK0)) ).

cnf(u41,axiom,
    ( greater(cardinality_at_time(sK1(X0,X1),X1),zero)
    | ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero) ) ).

cnf(u52,hypothesis,
    ( ~ greater(number_of_organizations(X0,X1),zero)
    | first_movers = sK1(X0,X1)
    | efficient_producers = sK1(X0,X1)
    | ~ environment(X0) ) ).

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

cnf(u45,axiom,
    ( greater(appear(first_movers,X0),appear(an_organisation,X0))
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | ~ environment(X0) ) ).

cnf(u40,axiom,
    ( ~ greater(cardinality_at_time(efficient_producers,X1),zero)
    | ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater(appear(efficient_producers,X0),X1) ) ).

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

cnf(u50,hypothesis,
    ( ~ subpopulation(sK1(X0,X1),X2,X1)
    | ~ environment(X2)
    | first_movers = sK1(X0,X1)
    | efficient_producers = sK1(X0,X1)
    | ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero) ) ).

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

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

cnf(u64,hypothesis,
    ( ~ greater(X1,appear(efficient_producers,e))
    | ~ environment(X0)
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | greater(X1,appear(an_organisation,X0)) ) ).

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

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

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

cnf(u42,axiom,
    ( subpopulation(sK1(X0,X1),X0,X1)
    | ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero) ) ).

cnf(u49,axiom,
    ( ~ greater(X1,appear(first_movers,X0))
    | ~ environment(X0)
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | greater(X1,appear(an_organisation,X0)) ) ).

cnf(u36,negated_conjecture,
    appear(an_organisation,sK0) != appear(first_movers,sK0) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT031+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n006.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:20:55 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.72/1.49  % (3193783)Detected formulas, will run a generic FOF schedule.
% 3.72/1.49  % (3193794)dis-21_1_sil=8000:lcm=predicate:random_seed=1898941407: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)
% 3.72/1.49  % (3193794)Instruction limit reached! 
% 3.72/1.49  % (3193794)------------------------------
% 3.72/1.49  % (3193794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193794)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193794)Termination reason: Instruction limit
% 3.72/1.49  % (3193794)Termination phase: Saturation
% 3.72/1.49  % (3193794)Time elapsed: 0.034 s
% 3.72/1.49  % (3193794)Peak memory usage: 88 MB
% 3.72/1.49  % (3193794)Instructions burned: 131 (million)
% 3.72/1.49  % (3193792)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1440739025:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.72/1.49  % (3193790)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=1679395745:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.72/1.49  % (3193789)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=1151643180:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.72/1.49  % (3193791)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2451779910:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.72/1.49  % (3193788)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=2942066420:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.72/1.49  % (3193793)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2128017841:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.72/1.49  % (3193791)Refutation not found, incomplete strategy
% 3.72/1.49  % (3193791)------------------------------
% 3.72/1.49  % (3193791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193791)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193791)Termination reason: Refutation not found, incomplete strategy
% 3.72/1.49  % (3193791)Time elapsed: 0.002 s
% 3.72/1.49  % (3193791)Peak memory usage: 88 MB
% 3.72/1.49  % (3193791)Instructions burned: 1 (million)
% 3.72/1.49  % (3193792)Instruction limit reached! 
% 3.72/1.49  % (3193792)------------------------------
% 3.72/1.49  % (3193792)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193792)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193792)Termination reason: Instruction limit
% 3.72/1.49  % (3193792)Termination phase: Saturation
% 3.72/1.49  % (3193792)Time elapsed: 0.055 s
% 3.72/1.49  % (3193792)Peak memory usage: 88 MB
% 3.72/1.49  % (3193792)Instructions burned: 120 (million)
% 3.72/1.49  % (3193793)Instruction limit reached! 
% 3.72/1.49  % (3193793)------------------------------
% 3.72/1.49  % (3193793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193793)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193793)Termination reason: Instruction limit
% 3.72/1.49  % (3193793)Termination phase: Saturation
% 3.72/1.49  % (3193793)Time elapsed: 0.061 s
% 3.72/1.49  % (3193793)Peak memory usage: 88 MB
% 3.72/1.49  % (3193793)Instructions burned: 140 (million)
% 3.72/1.49  % (3193796)lrs+10_1_sil=8000:sp=occurrence:random_seed=1369168567:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.72/1.49  % (3193796)First to succeed.
% 3.72/1.49  % (3193796)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3193783"
% 3.72/1.49  % (3193804)lrs+1011_1_sil=32000:sp=occurrence:random_seed=368099607:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.72/1.49  % (3193803)lrs+10_1_sil=32000:urr=on:br=off:random_seed=287375082:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.72/1.49  % (3193803)Refutation not found, incomplete strategy
% 3.72/1.49  % (3193803)------------------------------
% 3.72/1.49  % (3193803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193803)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193803)Termination reason: Refutation not found, incomplete strategy
% 3.72/1.49  % (3193803)Time elapsed: 0.002 s
% 3.72/1.49  % (3193803)Peak memory usage: 88 MB
% 3.72/1.49  % (3193803)Instructions burned: 1 (million)
% 3.72/1.49  % (3193791)------------------------------
% 3.72/1.49  % (3193791)------------------------------
% 3.72/1.49  % SZS status CounterSatisfiable for theBenchmark
% 3.72/1.49  % SZS output start Saturation.
% See solution above
% 3.72/1.49  % SZS output start Definitions and Model Updates.
% 3.72/1.49  for all groundings,
% 3.72/1.49      whenever greater(X0,X1) | X0 = X1 is true, set greater_or_equal(X0,X1) to true
% 3.72/1.49  % SZS output end Definitions and Model Updates.
% 3.72/1.49  % (3193796)------------------------------
% 3.72/1.49  % (3193796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.49  % (3193796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.49  % (3193796)CaDiCaL version: 2.1.3
% 3.72/1.49  % (3193796)Termination reason: Satisfiable
% 3.72/1.49  % (3193796)Time elapsed: 0.002 s
% 3.72/1.49  % (3193796)Peak memory usage: 88 MB
% 3.72/1.50  % (3193796)Instructions burned: 2 (million)
% 3.72/1.50  % (3193796)------------------------------
% 3.72/1.50  % (3193796)------------------------------
% 3.72/1.50  % (3193783)Success in time 0.447 s
% 3.72/1.50  % Vampire exiting
%------------------------------------------------------------------------------