TSTP Solution File: MGT031+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n019.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:28 EDT 2022
% Result : CounterSatisfiable 0.19s 0.51s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u103,negated_conjecture,
~ environment(e) ).
cnf(u66,negated_conjecture,
greater_or_equal(sF3,sF2) ).
cnf(u45,axiom,
( greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u53,axiom,
( ~ greater_or_equal(X0,X1)
| greater(X0,X1)
| X0 = X1 ) ).
cnf(u56,negated_conjecture,
in_environment(sK1,sF2) ).
cnf(u44,axiom,
( subpopulation(sK0(X0,X1),X1,X0)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X0),zero) ) ).
cnf(u88,hypothesis,
( ~ subpopulation(sK0(X1,X2),X0,X1)
| ~ environment(X2)
| efficient_producers = sK0(X1,X2)
| ~ greater(number_of_organizations(X2,X1),zero)
| first_movers = sK0(X1,X2)
| ~ environment(X0) ) ).
cnf(u75,negated_conjecture,
greater(sF3,sF2) ).
cnf(u43,axiom,
( greater(cardinality_at_time(sK0(X0,X1),X0),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X0),zero) ) ).
cnf(u62,negated_conjecture,
greater(number_of_organizations(e,sF2),zero) ).
cnf(u42,axiom,
( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
| ~ environment(X0) ) ).
cnf(u73,axiom,
( greater(appear(first_movers,X0),appear(an_organisation,X0))
| appear(an_organisation,X0) = appear(first_movers,X0)
| ~ environment(X0) ) ).
cnf(u77,negated_conjecture,
greater(appear(efficient_producers,e),sF2) ).
cnf(u60,negated_conjecture,
greater(appear(efficient_producers,e),sF3) ).
cnf(u91,hypothesis,
( greater(appear(efficient_producers,e),appear(an_organisation,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0) ) ).
cnf(u47,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u97,hypothesis,
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| efficient_producers = sK0(X1,X0)
| first_movers = sK0(X1,X0) ) ).
cnf(u46,hypothesis,
( ~ greater(cardinality_at_time(X2,X0),zero)
| ~ environment(X1)
| first_movers = X2
| efficient_producers = X2
| ~ subpopulation(X2,X1,X0) ) ).
cnf(u54,axiom,
( ~ greater(cardinality_at_time(efficient_producers,X0),zero)
| ~ in_environment(X1,X0)
| ~ greater(appear(efficient_producers,X1),X0)
| ~ environment(X1) ) ).
cnf(u52,axiom,
( ~ greater(cardinality_at_time(first_movers,X0),zero)
| ~ in_environment(X1,X0)
| ~ greater(appear(first_movers,X1),X0)
| ~ environment(X1) ) ).
cnf(u76,negated_conjecture,
( ~ greater(X0,sF3)
| greater(X0,sF2) ) ).
cnf(u80,axiom,
( ~ greater(X2,cardinality_at_time(sK0(X1,X0),X1))
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| greater(X2,zero) ) ).
cnf(u71,axiom,
( ~ greater(X3,number_of_organizations(e,appear(an_organisation,X4)))
| ~ environment(X4)
| greater(X3,zero) ) ).
cnf(u72,negated_conjecture,
( ~ greater(X5,number_of_organizations(e,sF2))
| greater(X5,zero) ) ).
cnf(u81,axiom,
( ~ greater(X1,appear(first_movers,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0)
| greater(X1,appear(an_organisation,X0)) ) ).
cnf(u70,negated_conjecture,
( ~ greater(X2,appear(efficient_producers,e))
| greater(X2,sF3) ) ).
cnf(u78,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,sF2) ) ).
cnf(u69,hypothesis,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u94,hypothesis,
( ~ greater(X1,appear(efficient_producers,e))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0)
| greater(X1,appear(an_organisation,X0)) ) ).
cnf(u51,axiom,
( ~ greater(X2,X1)
| greater(X0,X1)
| ~ greater(X0,X2) ) ).
cnf(u48,negated_conjecture,
environment(sK1) ).
cnf(u57,axiom,
sF3 = appear(first_movers,sK1) ).
cnf(u55,axiom,
sF2 = appear(an_organisation,sK1) ).
cnf(u58,negated_conjecture,
sF3 != sF2 ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT031+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.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 03:18:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (11001)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50 % (11009)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (11001)Refutation not found, incomplete strategy% (11001)------------------------------
% 0.19/0.50 % (11001)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (11001)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (11001)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (11001)Memory used [KB]: 5373
% 0.19/0.50 % (11001)Time elapsed: 0.101 s
% 0.19/0.50 % (11001)Instructions burned: 2 (million)
% 0.19/0.50 % (11001)------------------------------
% 0.19/0.50 % (11001)------------------------------
% 0.19/0.50 % (11007)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (11025)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.50 % (11025)First to succeed.
% 0.19/0.51 % SZS status CounterSatisfiable for theBenchmark
% 0.19/0.51 % (11025)# SZS output start Saturation.
% See solution above
% 0.19/0.51 % (11025)------------------------------
% 0.19/0.51 % (11025)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (11025)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (11025)Termination reason: Satisfiable
% 0.19/0.51
% 0.19/0.51 % (11025)Memory used [KB]: 5500
% 0.19/0.51 % (11025)Time elapsed: 0.108 s
% 0.19/0.51 % (11025)Instructions burned: 4 (million)
% 0.19/0.51 % (11025)------------------------------
% 0.19/0.51 % (11025)------------------------------
% 0.19/0.51 % (10999)Success in time 0.16 s
%------------------------------------------------------------------------------