TSTP Solution File: MGT026-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT026-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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 : 600s
% DateTime : Sun Jul 17 22:24:47 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of clauses : 37 ( 16 unt; 9 nHn; 37 RR)
% Number of literals : 80 ( 16 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp1_high_growth_rates_28,axiom,
( ~ environment(X)
| ~ subpopulations(Y,Z,X,U)
| ~ greater(growth_rate(Z,U),growth_rate(Y,U))
| selection_favors(Z,Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1_high_growth_rates_28) ).
cnf(mp2_favour_members_29,axiom,
( ~ environment(X)
| ~ subpopulation(Y,X,Z)
| ~ subpopulation(U,X,Z)
| ~ greater(cardinality_at_time(Y,Z),zero)
| cardinality_at_time(U,Z) != zero
| selection_favors(Y,U,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp2_favour_members_29) ).
cnf(mp_non_empty_fm_and_ep_30,axiom,
( ~ environment(X)
| ~ in_environment(X,Y)
| ~ greater(cardinality_at_time(first_movers,Y),zero)
| ~ greater(cardinality_at_time(efficient_producers,Y),zero)
| subpopulations(first_movers,efficient_producers,X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep_30) ).
cnf(mp_first_movers_exist_31,axiom,
( ~ environment(X)
| ~ in_environment(X,Y)
| greater_or_equal(cardinality_at_time(first_movers,Y),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_first_movers_exist_31) ).
cnf(mp_subpopulations_32,axiom,
( ~ environment(X)
| ~ in_environment(X,Y)
| subpopulation(first_movers,X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_32) ).
cnf(mp_subpopulations_33,axiom,
( ~ environment(X)
| ~ in_environment(X,Y)
| subpopulation(efficient_producers,X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_33) ).
cnf(mp_critical_point_after_EP_34,axiom,
( ~ environment(X)
| greater_or_equal(critical_point(X),appear(efficient_producers,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_critical_point_after_EP_34) ).
cnf(mp_greater_transitivity_35,axiom,
( ~ greater(X,Y)
| ~ greater(Y,Z)
| greater(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity_35) ).
cnf(mp_greater_or_equal_36,axiom,
( ~ greater_or_equal(X,Y)
| greater(X,Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_36) ).
cnf(mp_greater_or_equal_37,axiom,
( ~ greater(X,Y)
| greater_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_37) ).
cnf(d1_40,hypothesis,
( ~ environment(X)
| Y != critical_point(X)
| ~ subpopulations(first_movers,efficient_producers,X,Z)
| ~ greater(Z,Y)
| greater(growth_rate(efficient_producers,Z),growth_rate(first_movers,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_40) ).
cnf(t6_41,hypothesis,
( ~ environment(X)
| ~ in_environment(X,Y)
| ~ greater_or_equal(Y,appear(efficient_producers,X))
| greater(cardinality_at_time(efficient_producers,Y),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_41) ).
cnf(prove_l8_42,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_42) ).
cnf(prove_l8_43,negated_conjecture,
in_environment(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_43) ).
cnf(prove_l8_44,negated_conjecture,
greater(sk2,critical_point(sk1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_44) ).
cnf(prove_l8_45,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_45) ).
cnf(19,plain,
greater_or_equal(sk2,critical_point(sk1)),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_37,prove_l8_44]) ).
cnf(21,plain,
greater_or_equal(critical_point(sk1),appear(efficient_producers,sk1)),
inference('HYPERRESOLVE',[status(thm)],[mp_critical_point_after_EP_34,prove_l8_42]) ).
cnf(22,plain,
subpopulation(first_movers,sk1,sk2),
inference('HYPERRESOLVE',[status(thm)],[mp_subpopulations_32,prove_l8_42,prove_l8_43]) ).
cnf(23,plain,
subpopulation(efficient_producers,sk1,sk2),
inference('HYPERRESOLVE',[status(thm)],[mp_subpopulations_33,prove_l8_42,prove_l8_43]) ).
cnf(24,plain,
greater_or_equal(cardinality_at_time(first_movers,sk2),zero),
inference('HYPERRESOLVE',[status(thm)],[mp_first_movers_exist_31,prove_l8_42,prove_l8_43]) ).
cnf(26,plain,
( greater(cardinality_at_time(first_movers,sk2),zero)
| cardinality_at_time(first_movers,sk2) = zero ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_36,24]) ).
cnf(27,plain,
( greater(critical_point(sk1),appear(efficient_producers,sk1))
| critical_point(sk1) = appear(efficient_producers,sk1) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_36,21]) ).
cnf(28,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| greater(sk2,appear(efficient_producers,sk1)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_transitivity_35,27,prove_l8_44]) ).
cnf(29,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| greater_or_equal(sk2,appear(efficient_producers,sk1)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_37,28]) ).
cnf(30,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| greater(cardinality_at_time(efficient_producers,sk2),zero) ),
inference('HYPERRESOLVE',[status(thm)],[t6_41,29,prove_l8_42,prove_l8_43]) ).
cnf(32,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| cardinality_at_time(first_movers,sk2) = zero
| subpopulations(first_movers,efficient_producers,sk1,sk2) ),
inference('HYPERRESOLVE',[status(thm)],[mp_non_empty_fm_and_ep_30,30,prove_l8_42,prove_l8_43,26]) ).
cnf(33,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| cardinality_at_time(first_movers,sk2) = zero
| greater(growth_rate(efficient_producers,sk2),growth_rate(first_movers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[d1_40,32,prove_l8_42,prove_l8_44,theory(equality)]) ).
cnf(34,plain,
( critical_point(sk1) = appear(efficient_producers,sk1)
| cardinality_at_time(first_movers,sk2) = zero ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp1_high_growth_rates_28,33,prove_l8_42,32]),prove_l8_45]) ).
cnf(35,plain,
critical_point(sk1) = appear(efficient_producers,sk1),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp2_favour_members_29,34,prove_l8_42,23,22,30]),prove_l8_45]) ).
cnf(36,plain,
( ~ in_environment(sk1,X)
| ~ greater_or_equal(X,critical_point(sk1))
| greater(cardinality_at_time(efficient_producers,X),zero) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[t6_41,35,theory(equality)]),prove_l8_42]) ).
cnf(37,plain,
greater(cardinality_at_time(efficient_producers,sk2),zero),
inference('HYPERRESOLVE',[status(thm)],[36,prove_l8_43,19]) ).
cnf(39,plain,
cardinality_at_time(first_movers,sk2) != zero,
inference('UR-RESOLVE',[status(thm)],[mp2_favour_members_29,37,prove_l8_42,23,22,prove_l8_45]) ).
cnf(40,plain,
greater(cardinality_at_time(first_movers,sk2),zero),
inference('REWRITE',[status(thm)],[26,39]) ).
cnf(41,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference('HYPERRESOLVE',[status(thm)],[mp_non_empty_fm_and_ep_30,40,prove_l8_42,prove_l8_43,37]) ).
cnf(42,plain,
greater(growth_rate(efficient_producers,sk2),growth_rate(first_movers,sk2)),
inference('HYPERRESOLVE',[status(thm)],[d1_40,41,prove_l8_42,prove_l8_44,theory(equality)]) ).
cnf(43,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[mp1_high_growth_rates_28,41,prove_l8_42,prove_l8_45]),42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT026-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n023.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:57:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T08:57:08
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-09T08:57:08
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 #||
% 0.19/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.52 % SZS output start Refutation
% See solution above
% 0.19/0.53 ||#
% 0.19/0.53
% 0.19/0.53 ; Summary of computation:
% 0.19/0.53 ; 85 formulas have been input or derived (from 40 formulas).
% 0.19/0.53 ; 43 (51%) were retained. Of these,
% 0.19/0.53 ; 10 (23%) were simplified or subsumed later,
% 0.19/0.53 ; 33 (77%) are still being kept.
% 0.19/0.53 ;
% 0.19/0.53 ; Run time in seconds excluding printing time:
% 0.19/0.53 ; 0.004 10% Read assertion file (1 call)
% 0.19/0.53 ; 0.001 2% Assert (18 calls)
% 0.19/0.53 ; 0.002 5% Process new row (75 calls)
% 0.19/0.53 ; 0.007 17% Resolution (78 calls)
% 0.19/0.53 ; 0.001 2% Paramodulation (39 calls)
% 0.19/0.53 ; 0.000 0% Factoring (9 calls)
% 0.19/0.53 ; 0.001 2% Condensing (26 calls)
% 0.19/0.53 ; 0.000 0% Forward subsumption (26 calls)
% 0.19/0.53 ; 0.000 0% Backward subsumption (24 calls)
% 0.19/0.53 ; 0.000 0% Clause clause subsumption (5 calls)
% 0.19/0.53 ; 0.001 2% Forward simplification (66 calls)
% 0.19/0.53 ; 0.000 0% Backward simplification (43 calls)
% 0.19/0.53 ; 0.001 2% Ordering (56 calls)
% 0.19/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.53 ; 0.000 0% Purity testing (1 call)
% 0.19/0.53 ; 0.024 57% Other
% 0.19/0.53 ; 0.042 Total
% 0.19/0.53 ; 0.047 Real time
% 0.19/0.53 ;
% 0.19/0.53 ; Term-hash-array has 73 terms in all.
% 0.19/0.53 ; Feature-vector-row-index has 15 entries (22 at peak, 24 added, 9 deleted).
% 0.19/0.53 ; Feature-vector-row-index has 88 nodes (184 at peak, 209 added, 121 deleted).
% 0.19/0.53 ; Retrieved 3 possibly forward subsuming rows in 26 calls.
% 0.19/0.53 ; Retrieved 2 possibly backward subsumed rows in 24 calls.
% 0.19/0.53 ; Path-index has 74 entries (74 at peak, 86 added, 12 deleted).
% 0.19/0.53 ; Path-index has 157 nodes (162 at peak, 168 added, 11 deleted).
% 0.19/0.53 ; Trie-index has 74 entries (74 at peak, 86 added, 12 deleted).
% 0.19/0.53 ; Trie-index has 159 nodes (171 at peak, 190 added, 31 deleted).
% 0.19/0.53 ; Retrieved 35 generalization terms in 53 calls.
% 0.19/0.53 ; Retrieved 23 instance terms in 18 calls.
% 0.19/0.53 ; Retrieved 972 unifiable terms in 545 calls.
% 0.19/0.53 ;
% 0.19/0.53 ; The agenda of rows to give has 3 entries:
% 0.19/0.53 ; 2 with value (4 19) 1 with value (4 22)
% 0.19/0.53 Evaluation took:
% 0.19/0.53 0.047 seconds of real time
% 0.19/0.53 0.03527 seconds of user run time
% 0.19/0.53 0.011577 seconds of system run time
% 0.19/0.53 0 calls to %EVAL
% 0.19/0.53 0 page faults and
% 0.19/0.53 4,672,024 bytes consed.
% 0.19/0.53 :PROOF-FOUND
% 0.19/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T08:57:08
% 0.19/0.53 :PROOF-FOUND
% 0.19/0.53 *
%------------------------------------------------------------------------------