TSTP Solution File: MGT040+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT040+2 : 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 : n021.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:34 EDT 2022
% Result : CounterSatisfiable 0.19s 0.50s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u69,axiom,
( selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0)
| environment(sK0(X0)) ) ).
cnf(u72,axiom,
propagation_strategy(efficient_producers) ).
cnf(u76,axiom,
propagation_strategy(first_movers) ).
cnf(u81,axiom,
( selection_favors(efficient_producers,first_movers,X0)
| in_environment(X0,sK0(X0))
| ~ observational_period(X0) ) ).
cnf(u86,axiom,
( ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
| selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(X0) ) ).
cnf(u61,axiom,
( greater_or_equal(X1,appear(efficient_producers,X0))
| ~ in_environment(X0,X1)
| greater(appear(efficient_producers,X0),X1) ) ).
cnf(u47,axiom,
( greater_or_equal(end_time(X0),appear(an_organisation,X0))
| ~ environment(X0)
| empty(X0) ) ).
cnf(u66,hypothesis,
( ~ greater_or_equal(X1,appear(first_movers,X0))
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,X1)
| ~ in_environment(X0,X1)
| ~ greater(appear(efficient_producers,X0),X1) ) ).
cnf(u48,hypothesis,
( ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X0)
| ~ in_environment(X1,critical_point(X1))
| ~ greater(critical_point(X1),X0) ) ).
cnf(u63,axiom,
( ~ greater_or_equal(X1,appear(efficient_producers,X0))
| in_environment(X0,critical_point(X0))
| ~ greater(critical_point(X0),X1)
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).
cnf(u62,axiom,
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ) ).
cnf(u107,axiom,
( greater(appear(efficient_producers,X0),end_time(X0))
| ~ in_environment(X0,end_time(X0))
| in_environment(X0,critical_point(X0))
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).
cnf(u95,axiom,
( greater(appear(efficient_producers,X0),X1)
| greater(X1,appear(efficient_producers,X0))
| ~ in_environment(X0,X1)
| appear(efficient_producers,X0) = X1 ) ).
cnf(u58,axiom,
( greater(critical_point(X0),end_time(X0))
| ~ environment(X0)
| in_environment(X0,critical_point(X0)) ) ).
cnf(u89,axiom,
( greater(end_time(X0),appear(an_organisation,X0))
| appear(an_organisation,X0) = end_time(X0)
| empty(X0)
| ~ environment(X0) ) ).
cnf(u97,hypothesis,
( ~ greater(critical_point(X0),X1)
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,X1)
| greater(appear(efficient_producers,X0),X1)
| ~ in_environment(X0,X1)
| ~ in_environment(X0,critical_point(X0)) ) ).
cnf(u101,axiom,
( ~ greater(critical_point(X0),X1)
| selection_favors(first_movers,efficient_producers,end_time(X0))
| ~ environment(X0)
| greater(appear(efficient_producers,X0),X1)
| in_environment(X0,critical_point(X0))
| ~ in_environment(X0,X1) ) ).
cnf(u96,axiom,
( ~ empty(sK0(end_time(sK0(X0))))
| extreme(end_time(sK0(X0)))
| ~ environment(sK0(end_time(sK0(X0))))
| selection_favors(efficient_producers,first_movers,X0)
| ~ observational_period(end_time(sK0(X0)))
| ~ observational_period(X0) ) ).
cnf(u90,axiom,
( ~ empty(end_time(X0))
| ~ environment(end_time(X0))
| extreme(X0)
| ~ environment(X0)
| ~ observational_period(X0) ) ).
cnf(u57,negated_conjecture,
~ extreme(sK1) ).
cnf(u55,negated_conjecture,
rapid_change(sK1) ).
cnf(u92,axiom,
( selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ empty(sK0(X1))
| extreme(X1)
| ~ environment(sK0(X1)) ) ).
cnf(u56,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK1) ).
cnf(u93,axiom,
( in_environment(end_time(sK0(X0)),sK0(end_time(sK0(X0))))
| ~ observational_period(end_time(sK0(X0)))
| ~ observational_period(X0)
| selection_favors(efficient_producers,first_movers,X0) ) ).
cnf(u53,axiom,
( in_environment(X0,end_time(X0))
| ~ environment(X0) ) ).
cnf(u106,axiom,
( ~ in_environment(X1,appear(efficient_producers,X2))
| ~ environment(X1)
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| greater(appear(efficient_producers,X2),critical_point(X1))
| critical_point(X1) = appear(efficient_producers,X2)
| ~ in_environment(X2,critical_point(X1))
| greater(appear(efficient_producers,X1),appear(efficient_producers,X2)) ) ).
cnf(u103,hypothesis,
( ~ in_environment(X1,appear(efficient_producers,X2))
| greater(appear(efficient_producers,X1),appear(efficient_producers,X2))
| ~ in_environment(X1,critical_point(X1))
| critical_point(X1) = appear(efficient_producers,X2)
| greater(appear(efficient_producers,X2),critical_point(X1))
| ~ environment(X1)
| ~ in_environment(X2,critical_point(X1))
| selection_favors(first_movers,efficient_producers,appear(efficient_producers,X2)) ) ).
cnf(u60,axiom,
( ~ in_environment(X1,critical_point(X1))
| ~ environment(X1)
| ~ observational_period(X0)
| ~ in_environment(X0,X1)
| ~ rapid_change(X0) ) ).
cnf(u65,axiom,
( ~ in_environment(X0,X1)
| extreme(X0)
| ~ observational_period(X0)
| ~ empty(X1)
| ~ environment(X1) ) ).
cnf(u94,axiom,
( environment(sK0(end_time(sK0(X1))))
| ~ observational_period(end_time(sK0(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ) ).
cnf(u54,negated_conjecture,
observational_period(sK1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % 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.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 03:35:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (9453)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.49 % (9464)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.19/0.50 % (9444)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (9442)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 % (9453)First to succeed.
% 0.19/0.50 % (9441)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.50 TRYING [1]
% 0.19/0.50 % SZS status CounterSatisfiable for theBenchmark
% 0.19/0.50 % (9453)# SZS output start Saturation.
% See solution above
% 0.19/0.50 % (9453)------------------------------
% 0.19/0.50 % (9453)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (9453)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (9453)Termination reason: Satisfiable
% 0.19/0.50
% 0.19/0.50 % (9453)Memory used [KB]: 5500
% 0.19/0.50 % (9453)Time elapsed: 0.107 s
% 0.19/0.50 % (9453)Instructions burned: 3 (million)
% 0.19/0.50 % (9453)------------------------------
% 0.19/0.50 % (9453)------------------------------
% 0.19/0.50 % (9438)Success in time 0.161 s
%------------------------------------------------------------------------------