TSTP Solution File: MGT039+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% 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 : 600s
% DateTime : Sun Jul 17 22:25:33 EDT 2022
% Result : Theorem 0.18s 0.48s
% 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-1 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| environment('SKOLEMAAAO1'(X))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy) ).
cnf(2,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| in_environment(X,'SKOLEMAAAO1'(X))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy) ).
cnf(3,axiom,
( ~ observational_period(X)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time('SKOLEMAAAO1'(X)))
| selection_favors(efficient_producers,first_movers,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy) ).
cnf(4,axiom,
( ~ observational_period(X)
| ~ slow_change(X)
| ~ environment(Y)
| ~ in_environment(X,Y)
| in_environment(Y,'SKOLEMAAAO2'(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point) ).
cnf(5,axiom,
( ~ observational_period(X)
| ~ slow_change(X)
| ~ environment(Y)
| ~ in_environment(X,Y)
| greater('SKOLEMAAAO2'(Y),critical_point(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point) ).
cnf(6,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets1) ).
cnf(7,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets2) ).
cnf(8,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) ).
cnf(9,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) ).
cnf(10,axiom,
( ~ environment(X)
| greater_or_equal(critical_point(X),start_time(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_of_critical_point) ).
cnf(11,axiom,
( ~ greater(X,Y)
| ~ greater(Y,Z)
| greater(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity) ).
cnf(12,axiom,
( ~ greater_or_equal(X,Y)
| greater(X,Y)
| X = Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
cnf(13,axiom,
( greater_or_equal(X,Y)
| ~ greater(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
cnf(14,axiom,
( greater_or_equal(X,Y)
| X != Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
cnf(16,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) ).
cnf(17,negated_conjecture,
observational_period('SKOLEMAAAO3'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8) ).
cnf(18,negated_conjecture,
slow_change('SKOLEMAAAO3'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8) ).
cnf(19,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,'SKOLEMAAAO3'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8) ).
cnf(20,plain,
( ~ observational_period(X)
| environment('SKOLEMAAAO1'(X))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[1,7,6]) ).
cnf(21,plain,
( ~ observational_period(X)
| in_environment(X,'SKOLEMAAAO1'(X))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[2,7,6]) ).
cnf(22,plain,
( ~ observational_period(X)
| ~ selection_favors(efficient_producers,first_movers,end_time('SKOLEMAAAO1'(X)))
| selection_favors(efficient_producers,first_movers,X) ),
inference('REWRITE',[status(thm)],[3,7,6]) ).
cnf(23,plain,
greater_or_equal(X,X),
inference('HYPERRESOLVE',[status(thm)],[14,theory(equality)]) ).
cnf(24,plain,
environment('SKOLEMAAAO1'('SKOLEMAAAO3')),
inference('UR-RESOLVE',[status(thm)],[20,17,19]) ).
cnf(25,plain,
in_environment('SKOLEMAAAO3','SKOLEMAAAO1'('SKOLEMAAAO3')),
inference('UR-RESOLVE',[status(thm)],[21,17,19]) ).
cnf(26,plain,
~ selection_favors(efficient_producers,first_movers,end_time('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('UR-RESOLVE',[status(thm)],[22,17,19]) ).
cnf(27,plain,
greater_or_equal(critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')),start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('HYPERRESOLVE',[status(thm)],[10,24]) ).
cnf(28,plain,
in_environment('SKOLEMAAAO1'('SKOLEMAAAO3'),'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('HYPERRESOLVE',[status(thm)],[4,25,17,18,24]) ).
cnf(29,plain,
greater('SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')),critical_point('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('HYPERRESOLVE',[status(thm)],[5,25,17,18,24]) ).
cnf(30,plain,
greater_or_equal(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('HYPERRESOLVE',[status(thm)],[9,28,24]) ).
cnf(31,plain,
( greater(critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')),start_time('SKOLEMAAAO1'('SKOLEMAAAO3')))
| critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3')) ),
inference('HYPERRESOLVE',[status(thm)],[12,27]) ).
cnf(32,plain,
selection_favors(efficient_producers,first_movers,'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))),
inference('HYPERRESOLVE',[status(thm)],[16,29,24,28]) ).
cnf(34,plain,
( greater(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')))
| end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')) ),
inference('HYPERRESOLVE',[status(thm)],[12,30]) ).
cnf(35,plain,
( critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))
| greater('SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')),start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[11,31,29]) ).
cnf(37,plain,
( end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| greater(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),critical_point('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[11,34,29]) ).
cnf(39,plain,
( critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))
| end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| greater(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[11,35,34]) ).
cnf(40,plain,
( end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| greater_or_equal(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),critical_point('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[13,37]) ).
cnf(44,plain,
( critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))
| end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| greater_or_equal(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[13,39]) ).
cnf(46,plain,
( critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))
| end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| in_environment('SKOLEMAAAO1'('SKOLEMAAAO3'),end_time('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[8,44,24,23]) ).
cnf(47,plain,
( critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3'))
| end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,46,24,37]),26]) ).
cnf(48,plain,
critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')) = start_time('SKOLEMAAAO1'('SKOLEMAAAO3')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,47,theory(equality)]),26]) ).
cnf(49,plain,
( ~ greater_or_equal(X,critical_point('SKOLEMAAAO1'('SKOLEMAAAO3')))
| ~ greater_or_equal(end_time('SKOLEMAAAO1'('SKOLEMAAAO3')),X)
| in_environment('SKOLEMAAAO1'('SKOLEMAAAO3'),X) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,48,theory(equality)]),24]) ).
cnf(51,plain,
( end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3'))
| in_environment('SKOLEMAAAO1'('SKOLEMAAAO3'),end_time('SKOLEMAAAO1'('SKOLEMAAAO3'))) ),
inference('HYPERRESOLVE',[status(thm)],[49,40,23]) ).
cnf(52,plain,
end_time('SKOLEMAAAO1'('SKOLEMAAAO3')) = 'SKOLEMAAAO2'('SKOLEMAAAO1'('SKOLEMAAAO3')),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,51,24,37]),26]) ).
cnf(55,plain,
$false,
inference('REWRITE',[status(thm)],[32,26,52,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : run-snark %s %d
% 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 : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:51:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.45 #<PACKAGE "SNARK-USER">
% 0.18/0.45 *
% 0.18/0.45 SNARK-TPTP-OPTIONS
% 0.18/0.45 *
% 0.18/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45 (USE-FACTORING :POS)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45 *
% 0.18/0.45 "."
% 0.18/0.45 *
% 0.18/0.45 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T07:51:08
% 0.18/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-09T07:51:08
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 #||
% 0.18/0.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 ||#
% 0.18/0.48
% 0.18/0.48 ; Summary of computation:
% 0.18/0.48 ; 113 formulas have been input or derived (from 47 formulas).
% 0.18/0.48 ; 55 (49%) were retained. Of these,
% 0.18/0.48 ; 25 (45%) were simplified or subsumed later,
% 0.18/0.48 ; 30 (55%) are still being kept.
% 0.18/0.48 ;
% 0.18/0.48 ; Run time in seconds excluding printing time:
% 0.18/0.48 ; 0.002 7% Read assertion file (1 call)
% 0.18/0.48 ; 0.000 0% Assert (12 calls)
% 0.18/0.48 ; 0.003 11% Process new row (98 calls)
% 0.18/0.48 ; 0.001 4% Resolution (92 calls)
% 0.18/0.48 ; 0.001 4% Paramodulation (46 calls)
% 0.18/0.48 ; 0.000 0% Factoring (15 calls)
% 0.18/0.48 ; 0.000 0% Condensing (43 calls)
% 0.18/0.48 ; 0.002 7% Forward subsumption (43 calls)
% 0.18/0.48 ; 0.000 0% Backward subsumption (35 calls)
% 0.18/0.48 ; 0.000 0% Clause clause subsumption (20 calls)
% 0.18/0.48 ; 0.001 4% Forward simplification (87 calls)
% 0.18/0.48 ; 0.002 7% Backward simplification (55 calls)
% 0.18/0.48 ; 0.001 4% Ordering (143 calls)
% 0.18/0.48 ; 0.000 0% Sortal reasoning (32 calls)
% 0.18/0.48 ; 0.000 0% Purity testing (1 call)
% 0.18/0.48 ; 0.014 52% Other
% 0.18/0.48 ; 0.027 Total
% 0.18/0.48 ; 0.032 Real time
% 0.18/0.48 ;
% 0.18/0.48 ; Term-hash-array has 70 terms in all.
% 0.18/0.48 ; Feature-vector-row-index has 16 entries (28 at peak, 35 added, 19 deleted).
% 0.18/0.49 ; Feature-vector-row-index has 89 nodes (187 at peak, 257 added, 168 deleted).
% 0.18/0.49 ; Retrieved 38 possibly forward subsuming rows in 43 calls.
% 0.18/0.49 ; Retrieved 6 possibly backward subsumed rows in 35 calls.
% 0.18/0.49 ; Path-index has 56 entries (68 at peak, 84 added, 28 deleted).
% 0.18/0.49 ; Path-index has 135 nodes (147 at peak, 161 added, 26 deleted).
% 0.18/0.49 ; Trie-index has 56 entries (68 at peak, 84 added, 28 deleted).
% 0.18/0.49 ; Trie-index has 119 nodes (171 at peak, 210 added, 91 deleted).
% 0.18/0.49 ; Retrieved 50 generalization terms in 94 calls.
% 0.18/0.49 ; Retrieved 23 instance terms in 19 calls.
% 0.18/0.49 ; Retrieved 691 unifiable terms in 467 calls.
% 0.18/0.49 ;
% 0.18/0.49 ; The agenda of backward simplifiable rows to process has 6 entries:
% 0.18/0.49 ; 6 with value 0
% 0.18/0.49 ; The agenda of rows to process has 1 entry:
% 0.18/0.49 ; 1 with value 32
% 0.18/0.49 ; The agenda of rows to give has 4 entries:
% 0.18/0.49 ; 1 with value (4 11) 1 with value (4 22) 1 with value (4 34)
% 0.18/0.49 ; 1 with value (4 12)
% 0.18/0.49 Evaluation took:
% 0.18/0.49 0.032 seconds of real time
% 0.18/0.49 0.029968 seconds of user run time
% 0.18/0.49 0.001872 seconds of system run time
% 0.18/0.49 0 calls to %EVAL
% 0.18/0.49 0 page faults and
% 0.18/0.49 6,104,816 bytes consed.
% 0.18/0.49 :PROOF-FOUND
% 0.18/0.49 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T07:51:08
% 0.18/0.49 :PROOF-FOUND
% 0.18/0.49 *
%------------------------------------------------------------------------------