TSTP Solution File: MGT020+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n032.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:44 EDT 2022

% Result   : Theorem 0.14s 0.40s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   25 (  11 unt;   7 nHn;  25 RR)
%            Number of literals    :   52 (   7 equ;  24 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ environment(X)
    | ~ subpopulations(first_movers,efficient_producers,X,Y)
    | ~ decreases(difference(disbanding_rate(first_movers,Y),disbanding_rate(efficient_producers,Y))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3) ).

cnf(2,axiom,
    ( ~ environment(X)
    | ~ in_environment(X,initial_FM_EP(X))
    | subpopulations(first_movers,efficient_producers,X,initial_FM_EP(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_earliest_time_point) ).

cnf(3,axiom,
    ( ~ environment(X)
    | ~ subpopulations(first_movers,efficient_producers,X,Y)
    | greater_or_equal(Y,initial_FM_EP(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_earliest_time_point) ).

cnf(4,axiom,
    ( ~ environment(X)
    | ~ greater_or_equal(Y,Z)
    | ~ greater_or_equal(U,Y)
    | ~ subpopulations(first_movers,efficient_producers,X,U)
    | ~ greater(disbanding_rate(first_movers,Z),disbanding_rate(efficient_producers,Z))
    | decreases(difference(disbanding_rate(first_movers,Y),disbanding_rate(efficient_producers,Y)))
    | greater(disbanding_rate(first_movers,U),disbanding_rate(efficient_producers,U)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_function_difference) ).

cnf(5,axiom,
    ( ~ environment(X)
    | ~ subpopulations(first_movers,efficient_producers,X,Y)
    | in_environment(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occurs) ).

cnf(6,axiom,
    ( ~ environment(X)
    | greater_or_equal(initial_FM_EP(X),start_time(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_initial_time) ).

cnf(7,axiom,
    ( ~ environment(X)
    | ~ greater_or_equal(Y,start_time(X))
    | ~ greater(Z,Y)
    | ~ in_environment(X,Z)
    | in_environment(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_times_in_order) ).

cnf(9,axiom,
    ( ~ greater_or_equal(X,Y)
    | greater(X,Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal) ).

cnf(10,hypothesis,
    ( ~ environment(X)
    | greater(disbanding_rate(first_movers,initial_FM_EP(X)),disbanding_rate(efficient_producers,initial_FM_EP(X))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a8) ).

cnf(12,negated_conjecture,
    environment('SKOLEMAAAN1'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2) ).

cnf(13,negated_conjecture,
    subpopulations(first_movers,efficient_producers,'SKOLEMAAAN1','SKOLEMAAAN2'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2) ).

cnf(14,negated_conjecture,
    ~ greater(disbanding_rate(first_movers,'SKOLEMAAAN2'),disbanding_rate(efficient_producers,'SKOLEMAAAN2')),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2) ).

cnf(15,plain,
    greater_or_equal(initial_FM_EP('SKOLEMAAAN1'),start_time('SKOLEMAAAN1')),
    inference('HYPERRESOLVE',[status(thm)],[6,12]) ).

cnf(16,plain,
    in_environment('SKOLEMAAAN1','SKOLEMAAAN2'),
    inference('HYPERRESOLVE',[status(thm)],[5,12,13]) ).

cnf(17,plain,
    greater_or_equal('SKOLEMAAAN2',initial_FM_EP('SKOLEMAAAN1')),
    inference('HYPERRESOLVE',[status(thm)],[3,12,13]) ).

cnf(18,plain,
    greater(disbanding_rate(first_movers,initial_FM_EP('SKOLEMAAAN1')),disbanding_rate(efficient_producers,initial_FM_EP('SKOLEMAAAN1'))),
    inference('HYPERRESOLVE',[status(thm)],[10,12]) ).

cnf(19,plain,
    ~ decreases(difference(disbanding_rate(first_movers,'SKOLEMAAAN2'),disbanding_rate(efficient_producers,'SKOLEMAAAN2'))),
    inference('UR-RESOLVE',[status(thm)],[1,12,13]) ).

cnf(20,plain,
    ( greater('SKOLEMAAAN2',initial_FM_EP('SKOLEMAAAN1'))
    | 'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1') ),
    inference('HYPERRESOLVE',[status(thm)],[9,17]) ).

cnf(22,plain,
    ~ greater_or_equal('SKOLEMAAAN2','SKOLEMAAAN2'),
    inference('UR-RESOLVE',[status(thm)],[4,18,12,17,13,19,14]) ).

cnf(23,plain,
    ( 'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1')
    | in_environment('SKOLEMAAAN1',initial_FM_EP('SKOLEMAAAN1')) ),
    inference('HYPERRESOLVE',[status(thm)],[7,20,12,15,16]) ).

cnf(24,plain,
    ( 'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1')
    | subpopulations(first_movers,efficient_producers,'SKOLEMAAAN1',initial_FM_EP('SKOLEMAAAN1')) ),
    inference('HYPERRESOLVE',[status(thm)],[2,23,12]) ).

cnf(26,plain,
    ( 'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1')
    | greater_or_equal(initial_FM_EP('SKOLEMAAAN1'),initial_FM_EP('SKOLEMAAAN1')) ),
    inference('HYPERRESOLVE',[status(thm)],[3,24,12]) ).

cnf(27,plain,
    ( 'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1')
    | decreases(difference(disbanding_rate(first_movers,initial_FM_EP('SKOLEMAAAN1')),disbanding_rate(efficient_producers,initial_FM_EP('SKOLEMAAAN1')))) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[4,26,12,17,13,18]),14]) ).

cnf(28,plain,
    'SKOLEMAAAN2' = initial_FM_EP('SKOLEMAAAN1'),
    inference('HYPERRESOLVE',[status(thm)],[1,27,12,24]) ).

cnf(30,plain,
    $false,
    inference('REWRITE',[status(thm)],[17,22,28,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.10  % Command  : run-snark %s %d
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Thu Jun  9 12:28:07 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.14/0.36  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37  * 
% 0.14/0.37  * 
% 0.14/0.38  #<PACKAGE "SNARK-USER">
% 0.14/0.38  * 
% 0.14/0.38  SNARK-TPTP-OPTIONS
% 0.14/0.38  * 
% 0.14/0.38  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.38   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.38   (USE-FACTORING :POS)
% 0.14/0.38   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.38   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.38   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.38   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.38   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.38   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.38   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.38   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.38   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.38   (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.38  * 
% 0.14/0.38  "."
% 0.14/0.38  * 
% 0.14/0.38  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:28:07
% 0.14/0.38  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-09T12:28:07
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  #||
% 0.14/0.40  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40  % SZS output start Refutation
% See solution above
% 0.14/0.40  ||#
% 0.14/0.40  
% 0.14/0.40  ; Summary of computation:
% 0.14/0.40  ;        49 formulas have been input or derived (from 28 formulas).
% 0.14/0.40  ;        30 (61%) were retained.  Of these,
% 0.14/0.40  ;           10 (33%) were simplified or subsumed later,
% 0.14/0.40  ;           20 (67%) are still being kept.
% 0.14/0.40  ; 
% 0.14/0.40  ; Run time in seconds excluding printing time:
% 0.14/0.40  ;     0.002  10%   Read assertion file          (1 call)
% 0.14/0.40  ;     0.001   5%   Assert                       (11 calls)
% 0.14/0.40  ;     0.001   5%   Process new row              (34 calls)
% 0.14/0.40  ;     0.001   5%   Resolution                   (54 calls)
% 0.14/0.40  ;     0.000   0%   Paramodulation               (27 calls)
% 0.14/0.40  ;     0.000   0%   Factoring                    (7 calls)
% 0.14/0.40  ;     0.000   0%   Condensing                   (20 calls)
% 0.14/0.40  ;     0.001   5%   Forward subsumption          (20 calls)
% 0.14/0.40  ;     0.000   0%   Backward subsumption         (18 calls)
% 0.14/0.40  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.14/0.40  ;     0.000   0%   Forward simplification       (34 calls)
% 0.14/0.40  ;     0.000   0%   Backward simplification      (30 calls)
% 0.14/0.40  ;     0.001   5%   Ordering                     (57 calls)
% 0.14/0.40  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.14/0.40  ;     0.000   0%   Purity testing               (1 call)
% 0.14/0.40  ;     0.014  67%   Other
% 0.14/0.40  ;     0.021        Total
% 0.14/0.40  ;     0.024        Real time
% 0.14/0.40  ; 
% 0.14/0.40  ; Term-hash-array has 62 terms in all.
% 0.14/0.40  ; Feature-vector-row-index has 11 entries (18 at peak, 18 added, 7 deleted).
% 0.14/0.40  ; Feature-vector-row-index has 82 nodes (151 at peak, 151 added, 69 deleted).
% 0.14/0.40  ;  Retrieved 4 possibly forward subsuming rows in 20 calls.
% 0.14/0.40  ;  Retrieved 0 possibly backward subsumed rows in 18 calls.
% 0.14/0.40  ; Path-index has 52 entries (65 at peak, 67 added, 15 deleted).
% 0.14/0.40  ; Path-index has 124 nodes (140 at peak, 142 added, 18 deleted).
% 0.14/0.40  ; Trie-index has 52 entries (65 at peak, 67 added, 15 deleted).
% 0.14/0.40  ; Trie-index has 104 nodes (145 at peak, 148 added, 44 deleted).
% 0.14/0.40  ; Retrieved 3 generalization terms in 18 calls.
% 0.14/0.40  ; Retrieved 11 instance terms in 11 calls.
% 0.14/0.40  ; Retrieved 648 unifiable terms in 393 calls.
% 0.14/0.40  ; 
% 0.14/0.40  ; The agenda of backward simplifiable rows to process has 8 entries:
% 0.14/0.40  ;     8 with value 0
% 0.14/0.40  ; The agenda of rows to give has 2 entries:
% 0.14/0.40  ;     1 with value (4 7)           1 with value (4 13)
% 0.14/0.40  Evaluation took:
% 0.14/0.40    0.024 seconds of real time
% 0.14/0.40    0.020636 seconds of user run time
% 0.14/0.40    0.003179 seconds of system run time
% 0.14/0.40    0 calls to %EVAL
% 0.14/0.40    0 page faults and
% 0.14/0.40    3,672,496 bytes consed.
% 0.14/0.40  :PROOF-FOUND
% 0.14/0.40  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:28:07
% 0.14/0.40  :PROOF-FOUND
% 0.14/0.40  * 
%------------------------------------------------------------------------------