TSTP Solution File: MGT033+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT033+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_sat --cores 0 -t %d %s
% Computer : n003.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:29 EDT 2022
% Result : CounterSatisfiable 0.21s 0.50s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u66,axiom,
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ) ).
cnf(u75,negated_conjecture,
greater_or_equal(sK1,appear(first_movers,sK0)) ).
cnf(u100,axiom,
( ~ greater_or_equal(start_time(X2),X3)
| ~ environment(X4)
| ~ environment(X2)
| in_environment(X4,start_time(X2))
| ~ in_environment(X4,X3)
| ~ in_environment(X4,appear(first_movers,X2)) ) ).
cnf(u99,negated_conjecture,
( ~ greater_or_equal(appear(first_movers,sK0),X0)
| ~ in_environment(X1,X0)
| ~ environment(X1)
| ~ in_environment(X1,sK1)
| in_environment(X1,appear(first_movers,sK0)) ) ).
cnf(u70,axiom,
( ~ greater_or_equal(X3,X0)
| ~ greater_or_equal(X0,X1)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| in_environment(X2,X0)
| ~ in_environment(X2,X3) ) ).
cnf(u114,negated_conjecture,
( ~ greater_or_equal(X0,appear(first_movers,sK0))
| greater(number_of_organizations(sK0,X0),zero)
| ~ in_environment(sK0,X0) ) ).
cnf(u77,hypothesis,
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ) ).
cnf(u83,axiom,
( in_environment(X0,appear(an_organisation,X0))
| ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u80,axiom,
( in_environment(X0,start_time(X0))
| ~ environment(X0) ) ).
cnf(u106,negated_conjecture,
in_environment(sK0,appear(first_movers,sK0)) ).
cnf(u74,negated_conjecture,
in_environment(sK0,sK1) ).
cnf(u153,negated_conjecture,
( ~ in_environment(X0,sK1)
| ~ environment(X0)
| first_movers != efficient_producers ) ).
cnf(u102,negated_conjecture,
( ~ in_environment(X0,start_time(sK0))
| ~ in_environment(X0,sK1)
| in_environment(X0,appear(first_movers,sK0))
| ~ environment(X0) ) ).
cnf(u89,hypothesis,
( ~ in_environment(X0,appear(first_movers,X0))
| appear(first_movers,X0) = appear(an_organisation,X0)
| ~ environment(X0) ) ).
cnf(u65,hypothesis,
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u71,axiom,
( selection_favors(X3,X0,X1)
| ~ subpopulation(X3,X2,X1)
| ~ environment(X2)
| zero != cardinality_at_time(X0,X1)
| ~ subpopulation(X0,X2,X1)
| ~ greater(cardinality_at_time(X3,X1),zero) ) ).
cnf(u73,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK1) ).
cnf(u116,negated_conjecture,
greater(number_of_organizations(sK0,sK1),zero) ).
cnf(u72,negated_conjecture,
greater(appear(efficient_producers,sK0),sK1) ).
cnf(u129,negated_conjecture,
( greater(zero,zero)
| first_movers = sK2(sK0,sK1) ) ).
cnf(u139,negated_conjecture,
( greater(cardinality_at_time(first_movers,sK1),zero)
| first_movers != efficient_producers ) ).
cnf(u81,axiom,
( greater(cardinality_at_time(sK2(X0,X1),X1),zero)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u113,negated_conjecture,
( ~ greater(appear(first_movers,sK0),X1)
| ~ in_environment(sK0,X1)
| zero = cardinality_at_time(an_organisation,X1) ) ).
cnf(u79,axiom,
( ~ greater(appear(X2,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| zero = cardinality_at_time(X2,X1) ) ).
cnf(u98,negated_conjecture,
( ~ greater(zero,zero)
| zero != cardinality_at_time(efficient_producers,t) ) ).
cnf(u69,axiom,
( ~ greater(number_of_organizations(X0,X1),zero)
| in_environment(X0,X1)
| ~ environment(X0) ) ).
cnf(u94,hypothesis,
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| efficient_producers = sK2(X0,X1)
| first_movers = sK2(X0,X1) ) ).
cnf(u93,axiom,
( ~ greater(number_of_organizations(X2,X3),zero)
| ~ environment(X2)
| zero != cardinality_at_time(sK2(X2,X3),t) ) ).
cnf(u152,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,sK1),zero)
| ~ in_environment(X0,sK1)
| ~ environment(X0) ) ).
cnf(u91,hypothesis,
( ~ greater(cardinality_at_time(sK2(X0,X1),X1),zero)
| first_movers = sK2(X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| efficient_producers = sK2(X0,X1) ) ).
cnf(u64,axiom,
( ~ greater(cardinality_at_time(X1,X0),zero)
| zero != cardinality_at_time(X1,t) ) ).
cnf(u131,negated_conjecture,
( subpopulation(efficient_producers,sK0,sK1)
| first_movers = sK2(sK0,sK1) ) ).
cnf(u141,negated_conjecture,
( subpopulation(first_movers,sK0,sK1)
| first_movers != efficient_producers ) ).
cnf(u82,axiom,
( subpopulation(sK2(X0,X1),X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ) ).
cnf(u68,axiom,
( subpopulation(efficient_producers,X1,X0)
| ~ in_environment(X1,X0)
| ~ environment(X1) ) ).
cnf(u67,axiom,
( subpopulation(first_movers,X1,X0)
| ~ environment(X1)
| ~ in_environment(X1,X0) ) ).
cnf(u151,negated_conjecture,
( ~ subpopulation(first_movers,sK0,sK1)
| ~ greater(cardinality_at_time(first_movers,sK1),zero)
| first_movers = sK2(sK0,sK1) ) ).
cnf(u147,negated_conjecture,
( ~ subpopulation(efficient_producers,X0,sK1)
| ~ subpopulation(first_movers,X0,sK1)
| ~ environment(X0)
| ~ greater(cardinality_at_time(first_movers,sK1),zero) ) ).
cnf(u78,hypothesis,
( ~ subpopulation(X0,X2,X1)
| ~ environment(X2)
| ~ greater(cardinality_at_time(X0,X1),zero)
| first_movers = X0
| efficient_producers = X0 ) ).
cnf(u76,negated_conjecture,
environment(sK0) ).
cnf(u120,negated_conjecture,
( efficient_producers = sK2(sK0,sK1)
| first_movers = sK2(sK0,sK1) ) ).
cnf(u126,negated_conjecture,
( first_movers = sK2(sK0,sK1)
| first_movers != efficient_producers ) ).
cnf(u108,negated_conjecture,
appear(first_movers,sK0) = appear(an_organisation,sK0) ).
cnf(u97,negated_conjecture,
zero = cardinality_at_time(efficient_producers,sK1) ).
cnf(u157,negated_conjecture,
first_movers != efficient_producers ).
cnf(u134,negated_conjecture,
( zero != cardinality_at_time(first_movers,t)
| first_movers != efficient_producers ) ).
cnf(u122,negated_conjecture,
( zero != cardinality_at_time(efficient_producers,t)
| first_movers = sK2(sK0,sK1) ) ).
cnf(u121,negated_conjecture,
zero != cardinality_at_time(sK2(sK0,sK1),t) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT033+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 03:16:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.49 % (20181)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.49 % (20165)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.49 % (20181)First to succeed.
% 0.21/0.49 TRYING [1]
% 0.21/0.49 TRYING [2]
% 0.21/0.50 Finite Model Found!
% 0.21/0.50 % SZS status CounterSatisfiable for theBenchmark
% 0.21/0.50 % (20181)# SZS output start Saturation.
% See solution above
% 0.21/0.50 % (20181)------------------------------
% 0.21/0.50 % (20181)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (20181)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (20181)Termination reason: Satisfiable
% 0.21/0.50
% 0.21/0.50 % (20181)Memory used [KB]: 1023
% 0.21/0.50 % (20181)Time elapsed: 0.038 s
% 0.21/0.50 % (20181)Instructions burned: 6 (million)
% 0.21/0.50 % (20181)------------------------------
% 0.21/0.50 % (20181)------------------------------
% 0.21/0.50 % (20158)Success in time 0.145 s
%------------------------------------------------------------------------------