TSTP Solution File: MGT027-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 34 ( 16 unt; 8 nHn; 34 RR)
% Number of literals : 76 ( 7 equ; 39 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_contracts_from_24,axiom,
( ~ environment(X)
| ~ stable(X)
| ~ in_environment(X,Y)
| greater(cardinality_at_time(first_movers,sk1(Y,X)),zero)
| contracts_from(Y,first_movers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from_24) ).
cnf(mp_contracts_from_25,axiom,
( ~ environment(X)
| ~ stable(X)
| ~ in_environment(X,Y)
| greater_or_equal(sk1(Y,X),Y)
| contracts_from(Y,first_movers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from_25) ).
cnf(mp_contracts_from_26,axiom,
( ~ environment(X)
| ~ stable(X)
| ~ in_environment(X,Y)
| ~ greater(zero,growth_rate(first_movers,sk1(Y,X)))
| contracts_from(Y,first_movers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from_26) ).
cnf(mp_non_empty_fm_and_ep_27,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_27) ).
cnf(mp_long_stable_environments_28,axiom,
( ~ environment(X)
| ~ stable(X)
| ~ in_environment(X,Y)
| ~ greater(Z,Y)
| in_environment(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_long_stable_environments_28) ).
cnf(mp_EP_in_stable_environments_29,axiom,
( ~ environment(X)
| ~ stable(X)
| in_environment(X,appear(efficient_producers,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_EP_in_stable_environments_29) ).
cnf(mp_greater_transitivity_30,axiom,
( ~ greater(X,Y)
| ~ greater(Y,Z)
| greater(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity_30) ).
cnf(mp_greater_or_equal_31,axiom,
( ~ greater_or_equal(X,Y)
| greater(X,Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_31) ).
cnf(mp_greater_or_equal_32,axiom,
( ~ greater(X,Y)
| greater_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_32) ).
cnf(t6_34,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_34) ).
cnf(l10_35,hypothesis,
( ~ environment(X)
| ~ stable(X)
| greater(sk2(X),appear(efficient_producers,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10_35) ).
cnf(l10_36,hypothesis,
( ~ environment(X)
| ~ stable(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ greater_or_equal(Y,sk2(X))
| greater(zero,growth_rate(first_movers,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10_36) ).
cnf(prove_l9_37,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9_37) ).
cnf(prove_l9_38,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9_38) ).
cnf(prove_l9_39,negated_conjecture,
( ~ greater(X,appear(efficient_producers,sk3))
| ~ contracts_from(X,first_movers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9_39) ).
cnf(18,plain,
in_environment(sk3,appear(efficient_producers,sk3)),
inference('HYPERRESOLVE',[status(thm)],[mp_EP_in_stable_environments_29,prove_l9_37,prove_l9_38]) ).
cnf(19,plain,
greater(sk2(sk3),appear(efficient_producers,sk3)),
inference('HYPERRESOLVE',[status(thm)],[l10_35,prove_l9_37,prove_l9_38]) ).
cnf(23,plain,
in_environment(sk3,sk2(sk3)),
inference('HYPERRESOLVE',[status(thm)],[mp_long_stable_environments_28,19,prove_l9_37,prove_l9_38,18]) ).
cnf(24,plain,
~ contracts_from(sk2(sk3),first_movers),
inference('UR-RESOLVE',[status(thm)],[prove_l9_39,19]) ).
cnf(25,plain,
greater_or_equal(sk2(sk3),appear(efficient_producers,sk3)),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_32,19]) ).
cnf(26,plain,
greater_or_equal(sk1(sk2(sk3),sk3),sk2(sk3)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp_contracts_from_25,23,prove_l9_37,prove_l9_38]),24]) ).
cnf(27,plain,
greater(cardinality_at_time(first_movers,sk1(sk2(sk3),sk3)),zero),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp_contracts_from_24,23,prove_l9_37,prove_l9_38]),24]) ).
cnf(28,plain,
~ greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3))),
inference('UR-RESOLVE',[status(thm)],[mp_contracts_from_26,24,prove_l9_37,prove_l9_38,23]) ).
cnf(29,plain,
greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero),
inference('HYPERRESOLVE',[status(thm)],[t6_34,25,prove_l9_37,23]) ).
cnf(32,plain,
( greater(sk1(sk2(sk3),sk3),sk2(sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_31,26]) ).
cnf(34,plain,
~ subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)),
inference('UR-RESOLVE',[status(thm)],[l10_36,28,prove_l9_37,prove_l9_38,26]) ).
cnf(37,plain,
( sk1(sk2(sk3),sk3) = sk2(sk3)
| in_environment(sk3,sk1(sk2(sk3),sk3)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_long_stable_environments_28,32,prove_l9_37,prove_l9_38,23]) ).
cnf(38,plain,
( sk1(sk2(sk3),sk3) = sk2(sk3)
| greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_transitivity_30,32,19]) ).
cnf(41,plain,
( sk1(sk2(sk3),sk3) = sk2(sk3)
| greater_or_equal(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_32,38]) ).
cnf(42,plain,
( sk1(sk2(sk3),sk3) = sk2(sk3)
| greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero) ),
inference('HYPERRESOLVE',[status(thm)],[t6_34,41,prove_l9_37,37]) ).
cnf(43,plain,
sk1(sk2(sk3),sk3) = sk2(sk3),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp_non_empty_fm_and_ep_27,42,prove_l9_37,37,27]),34]) ).
cnf(44,plain,
greater(cardinality_at_time(first_movers,sk2(sk3)),zero),
inference('REWRITE',[status(thm)],[27,43,theory(equality)]) ).
cnf(47,plain,
~ subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)),
inference('REWRITE',[status(thm)],[34,43,theory(equality)]) ).
cnf(48,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp_non_empty_fm_and_ep_27,44,prove_l9_37,23,29]),47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n025.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 09:30:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T09:30:05
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-09T09:30:05
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.51 ||#
% 0.20/0.51
% 0.20/0.51 ; Summary of computation:
% 0.20/0.51 ; 81 formulas have been input or derived (from 41 formulas).
% 0.20/0.51 ; 48 (59%) were retained. Of these,
% 0.20/0.51 ; 12 (25%) were simplified or subsumed later,
% 0.20/0.51 ; 36 (75%) are still being kept.
% 0.20/0.51 ;
% 0.20/0.51 ; Run time in seconds excluding printing time:
% 0.20/0.51 ; 0.004 10% Read assertion file (1 call)
% 0.20/0.51 ; 0.000 0% Assert (16 calls)
% 0.20/0.51 ; 0.005 12% Process new row (68 calls)
% 0.20/0.51 ; 0.004 10% Resolution (80 calls)
% 0.20/0.51 ; 0.000 0% Paramodulation (40 calls)
% 0.20/0.51 ; 0.000 0% Factoring (8 calls)
% 0.20/0.51 ; 0.000 0% Condensing (28 calls)
% 0.20/0.51 ; 0.001 2% Forward subsumption (28 calls)
% 0.20/0.51 ; 0.000 0% Backward subsumption (25 calls)
% 0.20/0.51 ; 0.000 0% Clause clause subsumption (4 calls)
% 0.20/0.51 ; 0.003 7% Forward simplification (67 calls)
% 0.20/0.51 ; 0.001 2% Backward simplification (48 calls)
% 0.20/0.51 ; 0.000 0% Ordering (51 calls)
% 0.20/0.51 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.51 ; 0.000 0% Purity testing (1 call)
% 0.20/0.51 ; 0.023 56% Other
% 0.20/0.51 ; 0.041 Total
% 0.20/0.51 ; 0.045 Real time
% 0.20/0.51 ;
% 0.20/0.51 ; Term-hash-array has 82 terms in all.
% 0.20/0.51 ; Feature-vector-row-index has 18 entries (25 at peak, 25 added, 7 deleted).
% 0.20/0.51 ; Feature-vector-row-index has 136 nodes (211 at peak, 211 added, 75 deleted).
% 0.20/0.51 ; Retrieved 6 possibly forward subsuming rows in 28 calls.
% 0.20/0.51 ; Retrieved 1 possibly backward subsumed row in 25 calls.
% 0.20/0.51 ; Path-index has 68 entries (80 at peak, 86 added, 18 deleted).
% 0.20/0.51 ; Path-index has 276 nodes (297 at peak, 304 added, 28 deleted).
% 0.20/0.51 ; Trie-index has 68 entries (80 at peak, 86 added, 18 deleted).
% 0.20/0.51 ; Trie-index has 202 nodes (268 at peak, 283 added, 81 deleted).
% 0.20/0.51 ; Retrieved 32 generalization terms in 57 calls.
% 0.20/0.51 ; Retrieved 26 instance terms in 22 calls.
% 0.20/0.51 ; Retrieved 1,085 unifiable terms in 668 calls.
% 0.20/0.51 ;
% 0.20/0.51 ; The agenda of rows to process has 1 entry:
% 0.20/0.51 ; 1 with value 13
% 0.20/0.51 ; The agenda of rows to give has 5 entries:
% 0.20/0.51 ; 2 with value (4 12) 1 with value (4 18) 1 with value (4 34)
% 0.20/0.51 ; 1 with value (4 13)
% 0.20/0.51 Evaluation took:
% 0.20/0.51 0.045 seconds of real time
% 0.20/0.51 0.040188 seconds of user run time
% 0.20/0.51 0.005228 seconds of system run time
% 0.20/0.51 0 calls to %EVAL
% 0.20/0.51 0 page faults and
% 0.20/0.51 4,671,536 bytes consed.
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T09:30:05
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 *
%------------------------------------------------------------------------------