TSTP Solution File: MGT033+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n006.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.19s 0.51s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u101,negated_conjecture,
in_environment(sK1,appear(first_movers,sK1)) ).
cnf(u124,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,sK0) ).
cnf(u127,negated_conjecture,
subpopulation(efficient_producers,sK1,sK0) ).
cnf(u131,negated_conjecture,
greater(zero,zero) ).
cnf(u148,negated_conjecture,
efficient_producers = sK2(sK0,sK1) ).
cnf(u151,negated_conjecture,
first_movers != sK2(sK0,sK1) ).
cnf(u165,negated_conjecture,
greater(number_of_organizations(sK1,sK0),zero) ).
cnf(u73,axiom,
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ) ).
cnf(u69,negated_conjecture,
greater_or_equal(sK0,appear(first_movers,sK1)) ).
cnf(u85,negated_conjecture,
( ~ greater_or_equal(X0,X1)
| ~ greater_or_equal(X2,X0)
| ~ in_environment(sK1,X1)
| in_environment(sK1,X0)
| ~ in_environment(sK1,X2) ) ).
cnf(u176,negated_conjecture,
( ~ greater_or_equal(X1,appear(first_movers,sK1))
| ~ in_environment(sK1,X1)
| greater(number_of_organizations(sK1,X1),zero) ) ).
cnf(u62,hypothesis,
( ~ greater_or_equal(X0,appear(an_organisation,X1))
| ~ in_environment(X1,X0)
| ~ environment(X1)
| greater(number_of_organizations(X1,X0),zero) ) ).
cnf(u76,axiom,
( in_environment(X0,appear(an_organisation,X0))
| ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u71,axiom,
( in_environment(X0,start_time(X0))
| ~ environment(X0) ) ).
cnf(u67,negated_conjecture,
in_environment(sK1,sK0) ).
cnf(u106,negated_conjecture,
( ~ in_environment(X0,sK0)
| ~ environment(X0)
| selection_favors(X1,efficient_producers,sK0)
| ~ greater(cardinality_at_time(X1,sK0),zero)
| ~ subpopulation(X1,X0,sK0) ) ).
cnf(u89,negated_conjecture,
( ~ in_environment(sK1,start_time(X2))
| ~ environment(X2)
| in_environment(sK1,appear(first_movers,X2))
| ~ greater_or_equal(X1,appear(first_movers,X2))
| ~ in_environment(sK1,X1) ) ).
cnf(u83,hypothesis,
( ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u81,hypothesis,
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u119,negated_conjecture,
( selection_favors(sK2(sK0,X0),efficient_producers,sK0)
| ~ subpopulation(sK2(sK0,X0),sK1,sK0)
| ~ greater(number_of_organizations(X0,sK0),zero)
| ~ environment(X0) ) ).
cnf(u66,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK0) ).
cnf(u70,negated_conjecture,
greater(appear(efficient_producers,sK1),sK0) ).
cnf(u75,axiom,
( greater(cardinality_at_time(sK2(X0,X1),X0),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X0),zero) ) ).
cnf(u77,axiom,
( ~ greater(number_of_organizations(X1,X0),zero)
| ~ environment(X1)
| in_environment(X1,X0) ) ).
cnf(u74,axiom,
( ~ greater(number_of_organizations(X1,X0),zero)
| ~ environment(X1)
| subpopulation(sK2(X0,X1),X1,X0) ) ).
cnf(u140,negated_conjecture,
( ~ greater(number_of_organizations(X1,X0),zero)
| efficient_producers = sK2(X0,X1)
| ~ subpopulation(sK2(X0,X1),sK1,X0)
| ~ environment(X1)
| first_movers = sK2(X0,X1) ) ).
cnf(u172,negated_conjecture,
( ~ greater(appear(first_movers,sK1),X0)
| zero = cardinality_at_time(an_organisation,X0)
| ~ in_environment(sK1,X0) ) ).
cnf(u84,negated_conjecture,
( ~ greater(appear(X1,sK1),X0)
| ~ in_environment(sK1,X0)
| zero = cardinality_at_time(X1,X0) ) ).
cnf(u139,negated_conjecture,
( ~ greater(cardinality_at_time(X0,X1),zero)
| ~ subpopulation(X0,sK1,X1)
| efficient_producers = X0
| first_movers = X0 ) ).
cnf(u113,negated_conjecture,
( ~ greater(cardinality_at_time(X0,sK0),zero)
| ~ subpopulation(X0,sK1,sK0)
| selection_favors(X0,efficient_producers,sK0) ) ).
cnf(u79,axiom,
( subpopulation(first_movers,X1,X0)
| ~ environment(X1)
| ~ in_environment(X1,X0) ) ).
cnf(u78,axiom,
( subpopulation(efficient_producers,X1,X0)
| ~ in_environment(X1,X0)
| ~ environment(X1) ) ).
cnf(u91,negated_conjecture,
( ~ subpopulation(efficient_producers,X0,sK0)
| ~ environment(X0)
| ~ greater(cardinality_at_time(X1,sK0),zero)
| selection_favors(X1,efficient_producers,sK0)
| ~ subpopulation(X1,X0,sK0) ) ).
cnf(u68,negated_conjecture,
environment(sK1) ).
cnf(u72,axiom,
( ~ environment(X1)
| ~ in_environment(X1,X0)
| zero = cardinality_at_time(X2,X0)
| ~ greater(appear(X2,X1),X0) ) ).
cnf(u65,axiom,
( ~ environment(X0)
| ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X1)
| ~ in_environment(X0,X2)
| in_environment(X0,X3) ) ).
cnf(u80,hypothesis,
( ~ environment(X1)
| efficient_producers = X2
| ~ greater(cardinality_at_time(X2,X0),zero)
| first_movers = X2
| ~ subpopulation(X2,X1,X0) ) ).
cnf(u158,negated_conjecture,
appear(first_movers,sK1) = appear(an_organisation,sK1) ).
cnf(u87,negated_conjecture,
zero = cardinality_at_time(efficient_producers,sK0) ).
cnf(u198,negated_conjecture,
first_movers != efficient_producers ).
cnf(u63,axiom,
( zero != cardinality_at_time(X3,X2)
| ~ environment(X0)
| ~ subpopulation(X1,X0,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X3,X0,X2)
| selection_favors(X1,X3,X2) ) ).
cnf(u64,axiom,
( zero != cardinality_at_time(X1,t)
| ~ greater(cardinality_at_time(X1,X0),zero) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT033+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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.13/0.34 % Computer : n006.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:15:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (28051)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.48 % (28050)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.48 % (28050)Instruction limit reached!
% 0.19/0.48 % (28050)------------------------------
% 0.19/0.48 % (28050)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (28050)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (28050)Termination reason: Unknown
% 0.19/0.48 % (28050)Termination phase: Saturation
% 0.19/0.48
% 0.19/0.48 % (28050)Memory used [KB]: 6012
% 0.19/0.48 % (28050)Time elapsed: 0.103 s
% 0.19/0.48 % (28050)Instructions burned: 3 (million)
% 0.19/0.48 % (28050)------------------------------
% 0.19/0.48 % (28050)------------------------------
% 0.19/0.49 % (28075)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.50 % (28057)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.50 % (28066)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (28052)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.50 % (28066)Instruction limit reached!
% 0.19/0.50 % (28066)------------------------------
% 0.19/0.50 % (28066)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (28066)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (28066)Termination reason: Unknown
% 0.19/0.50 % (28066)Termination phase: Finite model building preprocessing
% 0.19/0.50
% 0.19/0.50 % (28066)Memory used [KB]: 1407
% 0.19/0.50 % (28066)Time elapsed: 0.004 s
% 0.19/0.50 % (28066)Instructions burned: 3 (million)
% 0.19/0.50 % (28066)------------------------------
% 0.19/0.50 % (28066)------------------------------
% 0.19/0.50 % (28057)Refutation not found, incomplete strategy% (28057)------------------------------
% 0.19/0.50 % (28057)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (28075)First to succeed.
% 0.19/0.50 % (28059)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.19/0.50 % (28057)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (28057)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (28057)Memory used [KB]: 6012
% 0.19/0.50 % (28057)Time elapsed: 0.112 s
% 0.19/0.50 % (28057)Instructions burned: 5 (million)
% 0.19/0.50 % (28057)------------------------------
% 0.19/0.50 % (28057)------------------------------
% 0.19/0.51 % SZS status CounterSatisfiable for theBenchmark
% 0.19/0.51 % (28075)# SZS output start Saturation.
% See solution above
% 0.19/0.51 % (28075)------------------------------
% 0.19/0.51 % (28075)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (28075)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (28075)Termination reason: Satisfiable
% 0.19/0.51
% 0.19/0.51 % (28075)Memory used [KB]: 6012
% 0.19/0.51 % (28075)Time elapsed: 0.115 s
% 0.19/0.51 % (28075)Instructions burned: 6 (million)
% 0.19/0.51 % (28075)------------------------------
% 0.19/0.51 % (28075)------------------------------
% 0.19/0.51 % (28042)Success in time 0.154 s
%------------------------------------------------------------------------------