TSTP Solution File: MGT039-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:25:33 EDT 2022
% Result : Unsatisfiable 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 44 ( 17 unt; 15 nHn; 43 RR)
% Number of literals : 100 ( 18 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp3_favoured_trategy_20,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| environment(sk1(X))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy_20) ).
cnf(mp3_favoured_trategy_21,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| in_environment(X,sk1(X))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy_21) ).
cnf(mp3_favoured_trategy_22,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X)))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy_22) ).
cnf(mp4_critical_point_23,axiom,
( ~ observational_period(X)
| ~ slow_change(X)
| ~ environment(Y)
| ~ in_environment(X,Y)
| in_environment(Y,sk2(Y,X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point_23) ).
cnf(mp4_critical_point_24,axiom,
( ~ observational_period(X)
| ~ slow_change(X)
| ~ environment(Y)
| ~ in_environment(X,Y)
| greater(sk2(Y,X),critical_point(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point_24) ).
cnf(mp_organizational_sets1_25,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets1_25) ).
cnf(mp_organizational_sets2_26,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets2_26) ).
cnf(mp_time_in_environment_27,axiom,
( ~ environment(X)
| ~ greater_or_equal(Y,start_time(X))
| ~ greater_or_equal(end_time(X),Y)
| in_environment(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_in_environment_27) ).
cnf(mp_environment_end_point_28,axiom,
( ~ environment(X)
| ~ in_environment(X,Y)
| greater_or_equal(end_time(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_end_point_28) ).
cnf(mp_time_of_critical_point_29,axiom,
( ~ environment(X)
| greater_or_equal(critical_point(X),start_time(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_of_critical_point_29) ).
cnf(mp_greater_transitivity_30,axiom,
( ~ greater(X,Y)
| ~ greater(Y,Z)
| greater(X,Z) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_32) ).
cnf(mp_greater_or_equal_33,axiom,
( X != Y
| greater_or_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_33) ).
cnf(l8_35,hypothesis,
( ~ environment(X)
| ~ in_environment(X,Y)
| ~ greater(Y,critical_point(X))
| selection_favors(efficient_producers,first_movers,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_35) ).
cnf(prove_t8_36,negated_conjecture,
observational_period(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8_36) ).
cnf(prove_t8_37,negated_conjecture,
slow_change(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8_37) ).
cnf(prove_t8_38,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8_38) ).
cnf(20,plain,
( ~ observational_period(X)
| environment(sk1(X))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[mp3_favoured_trategy_20,mp_organizational_sets2_26,mp_organizational_sets1_25]) ).
cnf(21,plain,
( ~ observational_period(X)
| in_environment(X,sk1(X))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[mp3_favoured_trategy_21,mp_organizational_sets2_26,mp_organizational_sets1_25]) ).
cnf(22,plain,
( ~ observational_period(X)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X)))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[mp3_favoured_trategy_22,mp_organizational_sets2_26,mp_organizational_sets1_25]) ).
cnf(23,plain,
greater_or_equal(X,X),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_33,theory(equality)]) ).
cnf(24,plain,
environment(sk1(sk3)),
inference('UR-RESOLVE',[status(thm)],[20,prove_t8_36,prove_t8_38]) ).
cnf(25,plain,
in_environment(sk3,sk1(sk3)),
inference('UR-RESOLVE',[status(thm)],[21,prove_t8_36,prove_t8_38]) ).
cnf(26,plain,
~ selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))),
inference('UR-RESOLVE',[status(thm)],[22,prove_t8_36,prove_t8_38]) ).
cnf(27,plain,
greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))),
inference('HYPERRESOLVE',[status(thm)],[mp_time_of_critical_point_29,24]) ).
cnf(28,plain,
in_environment(sk1(sk3),sk2(sk1(sk3),sk3)),
inference('HYPERRESOLVE',[status(thm)],[mp4_critical_point_23,25,prove_t8_36,prove_t8_37,24]) ).
cnf(29,plain,
greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))),
inference('HYPERRESOLVE',[status(thm)],[mp4_critical_point_24,25,prove_t8_36,prove_t8_37,24]) ).
cnf(30,plain,
( greater(critical_point(sk1(sk3)),start_time(sk1(sk3)))
| critical_point(sk1(sk3)) = start_time(sk1(sk3)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_31,27]) ).
cnf(31,plain,
greater_or_equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)),
inference('HYPERRESOLVE',[status(thm)],[mp_environment_end_point_28,28,24]) ).
cnf(32,plain,
selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)),
inference('HYPERRESOLVE',[status(thm)],[l8_35,29,24,28]) ).
cnf(34,plain,
( greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3))
| end_time(sk1(sk3)) = sk2(sk1(sk3),sk3) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_31,31]) ).
cnf(35,plain,
( critical_point(sk1(sk3)) = start_time(sk1(sk3))
| greater(sk2(sk1(sk3),sk3),start_time(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_transitivity_30,30,29]) ).
cnf(38,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| greater(end_time(sk1(sk3)),critical_point(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_transitivity_30,34,29]) ).
cnf(39,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| critical_point(sk1(sk3)) = start_time(sk1(sk3))
| greater(end_time(sk1(sk3)),start_time(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_transitivity_30,34,35]) ).
cnf(40,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_32,38]) ).
cnf(44,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| critical_point(sk1(sk3)) = start_time(sk1(sk3))
| greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_32,39]) ).
cnf(46,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| critical_point(sk1(sk3)) = start_time(sk1(sk3))
| in_environment(sk1(sk3),end_time(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[mp_time_in_environment_27,44,24,23]) ).
cnf(47,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| critical_point(sk1(sk3)) = start_time(sk1(sk3)) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[l8_35,46,24,38]),26]) ).
cnf(48,plain,
critical_point(sk1(sk3)) = start_time(sk1(sk3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,47,theory(equality)]),26]) ).
cnf(49,plain,
( ~ greater_or_equal(X,critical_point(sk1(sk3)))
| ~ greater_or_equal(end_time(sk1(sk3)),X)
| in_environment(sk1(sk3),X) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[mp_time_in_environment_27,48,theory(equality)]),24]) ).
cnf(51,plain,
( end_time(sk1(sk3)) = sk2(sk1(sk3),sk3)
| in_environment(sk1(sk3),end_time(sk1(sk3))) ),
inference('HYPERRESOLVE',[status(thm)],[49,40,23]) ).
cnf(52,plain,
end_time(sk1(sk3)) = sk2(sk1(sk3),sk3),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[l8_35,51,24,38]),26]) ).
cnf(55,plain,
$false,
inference('REWRITE',[status(thm)],[32,26,52,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:57:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T09:57:21
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-09T09:57:21
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 #||
% 0.18/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.51 % SZS output start Refutation
% See solution above
% 0.18/0.51 ||#
% 0.18/0.51
% 0.18/0.51 ; Summary of computation:
% 0.18/0.51 ; 113 formulas have been input or derived (from 47 formulas).
% 0.18/0.51 ; 55 (49%) were retained. Of these,
% 0.18/0.51 ; 25 (45%) were simplified or subsumed later,
% 0.18/0.51 ; 30 (55%) are still being kept.
% 0.18/0.51 ;
% 0.18/0.51 ; Run time in seconds excluding printing time:
% 0.18/0.51 ; 0.004 9% Read assertion file (1 call)
% 0.18/0.51 ; 0.001 2% Assert (19 calls)
% 0.18/0.51 ; 0.006 13% Process new row (98 calls)
% 0.18/0.51 ; 0.003 7% Resolution (92 calls)
% 0.18/0.51 ; 0.000 0% Paramodulation (46 calls)
% 0.18/0.51 ; 0.000 0% Factoring (15 calls)
% 0.18/0.51 ; 0.000 0% Condensing (43 calls)
% 0.18/0.51 ; 0.003 7% Forward subsumption (43 calls)
% 0.18/0.51 ; 0.003 7% Backward subsumption (35 calls)
% 0.18/0.51 ; 0.000 0% Clause clause subsumption (20 calls)
% 0.18/0.51 ; 0.000 0% Forward simplification (87 calls)
% 0.18/0.51 ; 0.001 2% Backward simplification (55 calls)
% 0.18/0.51 ; 0.000 0% Ordering (128 calls)
% 0.18/0.51 ; 0.001 2% Sortal reasoning (32 calls)
% 0.18/0.51 ; 0.000 0% Purity testing (1 call)
% 0.18/0.51 ; 0.024 52% Other
% 0.18/0.51 ; 0.046 Total
% 0.18/0.51 ; 0.053 Real time
% 0.18/0.51 ;
% 0.18/0.51 ; Term-hash-array has 70 terms in all.
% 0.18/0.51 ; Feature-vector-row-index has 16 entries (28 at peak, 35 added, 19 deleted).
% 0.18/0.51 ; Feature-vector-row-index has 89 nodes (207 at peak, 270 added, 181 deleted).
% 0.18/0.51 ; Retrieved 33 possibly forward subsuming rows in 43 calls.
% 0.18/0.51 ; Retrieved 6 possibly backward subsumed rows in 35 calls.
% 0.18/0.51 ; Path-index has 56 entries (68 at peak, 84 added, 28 deleted).
% 0.18/0.51 ; Path-index has 156 nodes (174 at peak, 188 added, 32 deleted).
% 0.18/0.51 ; Trie-index has 56 entries (68 at peak, 84 added, 28 deleted).
% 0.18/0.51 ; Trie-index has 124 nodes (182 at peak, 221 added, 97 deleted).
% 0.18/0.51 ; Retrieved 50 generalization terms in 94 calls.
% 0.18/0.51 ; Retrieved 23 instance terms in 19 calls.
% 0.18/0.51 ; Retrieved 693 unifiable terms in 468 calls.
% 0.18/0.51 ;
% 0.18/0.51 ; The agenda of backward simplifiable rows to process has 6 entries:
% 0.18/0.51 ; 6 with value 0
% 0.18/0.51 ; The agenda of rows to process has 1 entry:
% 0.18/0.51 ; 1 with value 33
% 0.18/0.51 ; The agenda of rows to give has 4 entries:
% 0.18/0.51 ; 1 with value (4 11) 1 with value (4 23) 1 with value (4 34)
% 0.18/0.51 ; 1 with value (4 12)
% 0.18/0.51 Evaluation took:
% 0.18/0.51 0.053 seconds of real time
% 0.18/0.51 0.043177 seconds of user run time
% 0.18/0.51 0.010041 seconds of system run time
% 0.18/0.51 0 calls to %EVAL
% 0.18/0.51 0 page faults and
% 0.18/0.51 5,695,208 bytes consed.
% 0.18/0.51 :PROOF-FOUND
% 0.18/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T09:57:21
% 0.18/0.51 :PROOF-FOUND
% 0.18/0.51 *
%------------------------------------------------------------------------------