TSTP Solution File: MGT031+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : MGT031+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 17:51:00 EDT 2022

% Result   : CounterSatisfiable 0.21s 0.48s
% Output   : Saturation 0.33s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u70,negated_conjecture,
    ~ greater(cardinality_at_time(first_movers,appear(an_organisation,sK1)),zero) ).

cnf(u91,negated_conjecture,
    greater(appear(first_movers,sK1),appear(an_organisation,sK1)) ).

cnf(u82,negated_conjecture,
    ~ greater(cardinality_at_time(efficient_producers,appear(an_organisation,sK1)),zero) ).

cnf(u128,negated_conjecture,
    ( ~ greater(number_of_organizations(sK1,X1),zero)
    | first_movers = sK0(sK1,X1)
    | efficient_producers = sK0(sK1,X1) ) ).

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

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

cnf(u52,negated_conjecture,
    in_environment(sK1,appear(an_organisation,sK1)) ).

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

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

cnf(u45,axiom,
    ( subpopulation(sK0(X0,X1),X0,X1)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | ~ environment(X0) ) ).

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

cnf(u59,negated_conjecture,
    ( greater(number_of_organizations(e,appear(an_organisation,sK1)),X1)
    | ~ greater(zero,X1) ) ).

cnf(u56,negated_conjecture,
    greater(number_of_organizations(e,appear(an_organisation,sK1)),zero) ).

cnf(u88,negated_conjecture,
    ( greater(cardinality_at_time(sK0(sK1,X0),X0),X1)
    | ~ greater(number_of_organizations(sK1,X0),zero)
    | ~ greater(zero,X1) ) ).

cnf(u63,negated_conjecture,
    ( greater(cardinality_at_time(sK0(sK1,X0),X0),zero)
    | ~ greater(number_of_organizations(sK1,X0),zero) ) ).

cnf(u58,negated_conjecture,
    ( greater(appear(efficient_producers,e),X0)
    | ~ greater(appear(first_movers,sK1),X0) ) ).

cnf(u118,negated_conjecture,
    ( greater(appear(efficient_producers,e),X0)
    | ~ greater(appear(an_organisation,sK1),X0) ) ).

cnf(u55,negated_conjecture,
    greater(appear(efficient_producers,e),appear(first_movers,sK1)) ).

cnf(u117,negated_conjecture,
    ( ~ greater(cardinality_at_time(sK0(sK1,X0),X0),zero)
    | ~ greater(number_of_organizations(sK1,X0),zero)
    | efficient_producers = sK0(sK1,X0)
    | first_movers = sK0(sK1,X0) ) ).

cnf(u87,negated_conjecture,
    ( ~ greater(zero,X0)
    | greater(number_of_organizations(e,appear(an_organisation,sK1)),X1)
    | ~ greater(X0,X1) ) ).

cnf(u89,negated_conjecture,
    ( ~ greater(number_of_organizations(sK1,X0),zero)
    | ~ greater(zero,X1)
    | ~ greater(X1,X2)
    | greater(cardinality_at_time(sK0(sK1,X0),X0),X2) ) ).

cnf(u119,negated_conjecture,
    ( ~ greater(appear(an_organisation,sK1),X1)
    | greater(appear(first_movers,sK1),X1) ) ).

cnf(u121,negated_conjecture,
    ( ~ greater(appear(an_organisation,sK1),X0)
    | greater(appear(efficient_producers,e),X1)
    | ~ greater(X0,X1) ) ).

cnf(u62,negated_conjecture,
    ( ~ greater(appear(first_movers,sK1),X0)
    | ~ greater(X0,X1)
    | greater(appear(efficient_producers,e),X1) ) ).

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

cnf(u54,negated_conjecture,
    environment(sK1) ).

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

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

cnf(u44,axiom,
    ( ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | greater(cardinality_at_time(sK0(X0,X1),X1),zero) ) ).

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

cnf(u61,hypothesis,
    ( ~ environment(X0)
    | ~ greater(cardinality_at_time(sK0(X0,X1),X1),zero)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | efficient_producers = sK0(X0,X1)
    | first_movers = sK0(X0,X1) ) ).

cnf(u53,negated_conjecture,
    appear(an_organisation,sK1) != appear(first_movers,sK1) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : MGT031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.13/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 03:19:54 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.46  % (7391)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.47  % (7391)Refutation not found, incomplete strategy% (7391)------------------------------
% 0.21/0.47  % (7391)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.47  % (7407)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.21/0.47  % (7391)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.47  % (7391)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.47  
% 0.21/0.47  % (7391)Memory used [KB]: 6012
% 0.21/0.47  % (7391)Time elapsed: 0.056 s
% 0.21/0.47  % (7391)Instructions burned: 2 (million)
% 0.21/0.47  % (7391)------------------------------
% 0.21/0.47  % (7391)------------------------------
% 0.21/0.47  % (7407)First to succeed.
% 0.21/0.48  % SZS status CounterSatisfiable for theBenchmark
% 0.21/0.48  % (7407)# SZS output start Saturation.
% See solution above
% 0.33/0.48  % (7407)------------------------------
% 0.33/0.48  % (7407)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.33/0.48  % (7407)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.33/0.48  % (7407)Termination reason: Satisfiable
% 0.33/0.48  
% 0.33/0.48  % (7407)Memory used [KB]: 6012
% 0.33/0.48  % (7407)Time elapsed: 0.069 s
% 0.33/0.48  % (7407)Instructions burned: 4 (million)
% 0.33/0.48  % (7407)------------------------------
% 0.33/0.48  % (7407)------------------------------
% 0.33/0.48  % (7379)Success in time 0.122 s
%------------------------------------------------------------------------------