TSTP Solution File: MGT024-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT024-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:46 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of clauses : 40 ( 14 unt; 17 nHn; 40 RR)
% Number of literals : 104 ( 19 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_time_point_occur_24,axiom,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| in_environment(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occur_24) ).
cnf(mp_positive_number_of_organizations_25,axiom,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| greater(number_of_organizations(X,Y),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_number_of_organizations_25) ).
cnf(mp_equilibrium_26,axiom,
( ~ environment(X)
| ~ greater_or_equal(Y,equilibrium(X))
| ~ greater(equilibrium(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_equilibrium_26) ).
cnf(a3_28,hypothesis,
( ~ environment(X)
| ~ in_environment(X,Y)
| ~ greater(number_of_organizations(X,Y),zero)
| greater(equilibrium(X),Y)
| constant(resources(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_28) ).
cnf(a6_30,hypothesis,
( ~ environment(X)
| ~ in_environment(X,Y)
| ~ constant(resources(X,Y))
| constant(number_of_organizations(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a6_30) ).
cnf(l7_32,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(first_movers,Y) = zero
| greater(growth_rate(first_movers,Y),zero)
| greater(zero,growth_rate(first_movers,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_32) ).
cnf(l7_33,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(first_movers,Y) = zero
| greater(zero,growth_rate(efficient_producers,Y))
| greater(growth_rate(efficient_producers,Y),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_33) ).
cnf(l7_35,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(efficient_producers,Y) = zero
| greater(growth_rate(first_movers,Y),zero)
| greater(growth_rate(efficient_producers,Y),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_35) ).
cnf(l7_36,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(efficient_producers,Y) = zero
| greater(growth_rate(first_movers,Y),zero)
| greater(zero,growth_rate(first_movers,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_36) ).
cnf(l7_37,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(efficient_producers,Y) = zero
| greater(zero,growth_rate(efficient_producers,Y))
| greater(growth_rate(efficient_producers,Y),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_37) ).
cnf(l7_38,hypothesis,
( ~ environment(X)
| ~ subpopulations(first_movers,efficient_producers,X,Y)
| ~ constant(number_of_organizations(X,Y))
| growth_rate(efficient_producers,Y) = zero
| greater(zero,growth_rate(efficient_producers,Y))
| greater(zero,growth_rate(first_movers,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_38) ).
cnf(prove_l6_39,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_39) ).
cnf(prove_l6_40,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_40) ).
cnf(prove_l6_41,negated_conjecture,
greater_or_equal(sk2,equilibrium(sk1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_41) ).
cnf(prove_l6_42,negated_conjecture,
( growth_rate(first_movers,sk2) != zero
| growth_rate(efficient_producers,sk2) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_42) ).
cnf(prove_l6_43,negated_conjecture,
( ~ greater(growth_rate(first_movers,sk2),zero)
| ~ greater(zero,growth_rate(efficient_producers,sk2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_43) ).
cnf(prove_l6_44,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,sk2),zero)
| ~ greater(zero,growth_rate(first_movers,sk2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_44) ).
cnf(22,plain,
in_environment(sk1,sk2),
inference('HYPERRESOLVE',[status(thm)],[mp_time_point_occur_24,prove_l6_39,prove_l6_40]) ).
cnf(23,plain,
~ greater(equilibrium(sk1),sk2),
inference('UR-RESOLVE',[status(thm)],[mp_equilibrium_26,prove_l6_39,prove_l6_41]) ).
cnf(24,plain,
greater(number_of_organizations(sk1,sk2),zero),
inference('HYPERRESOLVE',[status(thm)],[mp_positive_number_of_organizations_25,prove_l6_39,prove_l6_40]) ).
cnf(25,plain,
constant(resources(sk1,sk2)),
inference('UR-RESOLVE',[status(thm)],[a3_28,24,prove_l6_39,22,23]) ).
cnf(26,plain,
constant(number_of_organizations(sk1,sk2)),
inference('HYPERRESOLVE',[status(thm)],[a6_30,25,prove_l6_39,22]) ).
cnf(27,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2))
| greater(zero,growth_rate(first_movers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[l7_38,26,prove_l6_39,prove_l6_40]) ).
cnf(28,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2))
| greater(growth_rate(efficient_producers,sk2),zero) ),
inference('HYPERRESOLVE',[status(thm)],[l7_37,26,prove_l6_39,prove_l6_40]) ).
cnf(29,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[l7_36,26,prove_l6_39,prove_l6_40]) ).
cnf(30,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero)
| greater(growth_rate(efficient_producers,sk2),zero) ),
inference('HYPERRESOLVE',[status(thm)],[l7_35,26,prove_l6_39,prove_l6_40]) ).
cnf(32,plain,
( growth_rate(first_movers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2))
| greater(growth_rate(efficient_producers,sk2),zero) ),
inference('HYPERRESOLVE',[status(thm)],[l7_33,26,prove_l6_39,prove_l6_40]) ).
cnf(33,plain,
( growth_rate(first_movers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[l7_32,26,prove_l6_39,prove_l6_40]) ).
cnf(35,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[prove_l6_44,28,27]) ).
cnf(36,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(first_movers,sk2)) ),
inference('HYPERRESOLVE',[status(thm)],[prove_l6_43,29,35]) ).
cnf(37,plain,
( growth_rate(efficient_producers,sk2) = zero
| greater(growth_rate(efficient_producers,sk2),zero) ),
inference('HYPERRESOLVE',[status(thm)],[prove_l6_43,30,35]) ).
cnf(38,plain,
growth_rate(efficient_producers,sk2) = zero,
inference('HYPERRESOLVE',[status(thm)],[prove_l6_44,37,36]) ).
cnf(39,plain,
growth_rate(first_movers,sk2) != zero,
inference('REWRITE',[status(thm)],[prove_l6_42,38,theory(equality)]) ).
cnf(40,plain,
( greater(growth_rate(first_movers,sk2),zero)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference('REWRITE',[status(thm)],[33,39]) ).
cnf(41,plain,
( ~ greater(growth_rate(first_movers,sk2),zero)
| ~ greater(zero,zero) ),
inference('REWRITE',[status(thm)],[prove_l6_43,38,theory(equality)]) ).
cnf(42,plain,
( ~ greater(zero,zero)
| ~ greater(zero,growth_rate(first_movers,sk2)) ),
inference('REWRITE',[status(thm)],[prove_l6_44,38,theory(equality)]) ).
cnf(44,plain,
greater(zero,zero),
inference('REWRITE',[status(thm)],[32,39,38,theory(equality)]) ).
cnf(45,plain,
~ greater(growth_rate(first_movers,sk2),zero),
inference('REWRITE',[status(thm)],[41,44]) ).
cnf(46,plain,
greater(zero,growth_rate(first_movers,sk2)),
inference('REWRITE',[status(thm)],[40,45]) ).
cnf(47,plain,
$false,
inference('REWRITE',[status(thm)],[42,46,44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT024-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 09:38:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T09:38:38
% 0.20/0.47 ; 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-09T09:38:38
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 55 formulas have been input or derived (from 34 formulas).
% 0.20/0.52 ; 47 (85%) were retained. Of these,
% 0.20/0.52 ; 18 (38%) were simplified or subsumed later,
% 0.20/0.52 ; 29 (62%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.006 14% Read assertion file (1 call)
% 0.20/0.52 ; 0.001 2% Assert (21 calls)
% 0.20/0.52 ; 0.006 14% Process new row (48 calls)
% 0.20/0.52 ; 0.000 0% Resolution (66 calls)
% 0.20/0.52 ; 0.001 2% Paramodulation (33 calls)
% 0.20/0.52 ; 0.000 0% Factoring (7 calls)
% 0.20/0.52 ; 0.000 0% Condensing (33 calls)
% 0.20/0.52 ; 0.001 2% Forward subsumption (33 calls)
% 0.20/0.52 ; 0.002 5% Backward subsumption (33 calls)
% 0.20/0.52 ; 0.001 2% Clause clause subsumption (41 calls)
% 0.20/0.52 ; 0.001 2% Forward simplification (48 calls)
% 0.20/0.52 ; 0.001 2% Backward simplification (47 calls)
% 0.20/0.52 ; 0.000 0% Ordering (64 calls)
% 0.20/0.52 ; 0.002 5% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.021 49% Other
% 0.20/0.52 ; 0.043 Total
% 0.20/0.52 ; 0.048 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 41 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 15 entries (26 at peak, 33 added, 18 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 82 nodes (153 at peak, 186 added, 104 deleted).
% 0.20/0.52 ; Retrieved 15 possibly forward subsuming rows in 33 calls.
% 0.20/0.52 ; Retrieved 26 possibly backward subsumed rows in 33 calls.
% 0.20/0.52 ; Path-index has 44 entries (45 at peak, 49 added, 5 deleted).
% 0.20/0.52 ; Path-index has 125 nodes (125 at peak, 128 added, 3 deleted).
% 0.20/0.52 ; Trie-index has 44 entries (45 at peak, 49 added, 5 deleted).
% 0.20/0.52 ; Trie-index has 108 nodes (110 at peak, 115 added, 7 deleted).
% 0.20/0.52 ; Retrieved 5 generalization terms in 46 calls.
% 0.20/0.52 ; Retrieved 13 instance terms in 13 calls.
% 0.20/0.52 ; Retrieved 383 unifiable terms in 433 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.20/0.52 ; 4 with value 0
% 0.20/0.52 ; The agenda of input rows to give has 2 entries:
% 0.20/0.52 ; 2 with value 7
% 0.20/0.52 ; The agenda of rows to give has 3 entries:
% 0.20/0.52 ; 1 with value (4 8) 1 with value (4 11) 1 with value (4 14)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.048 seconds of real time
% 0.20/0.52 0.040129 seconds of user run time
% 0.20/0.52 0.007964 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 5,273,640 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T09:38:38
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------