TSTP Solution File: MGT020-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : MGT020-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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 : Unsatisfiable 0.19s 0.49s
% Output : Refutation 0.19s
% 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(l3_22,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_22) ).
cnf(mp_earliest_time_point_23,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_23) ).
cnf(mp_earliest_time_point_24,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_24) ).
cnf(mp_positive_function_difference_25,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_25) ).
cnf(mp_time_point_occurs_26,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_26) ).
cnf(mp_initial_time_27,axiom,
( ~ environment(X)
| greater_or_equal(initial_FM_EP(X),start_time(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_initial_time_27) ).
cnf(mp_times_in_order_28,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_28) ).
cnf(mp_greater_or_equal_30,axiom,
( ~ greater_or_equal(X,Y)
| greater(X,Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_30) ).
cnf(a8_31,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_31) ).
cnf(prove_l2_33,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2_33) ).
cnf(prove_l2_34,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2_34) ).
cnf(prove_l2_35,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l2_35) ).
cnf(15,plain,
greater_or_equal(initial_FM_EP(sk1),start_time(sk1)),
inference('HYPERRESOLVE',[status(thm)],[mp_initial_time_27,prove_l2_33]) ).
cnf(16,plain,
in_environment(sk1,sk2),
inference('HYPERRESOLVE',[status(thm)],[mp_time_point_occurs_26,prove_l2_33,prove_l2_34]) ).
cnf(17,plain,
greater_or_equal(sk2,initial_FM_EP(sk1)),
inference('HYPERRESOLVE',[status(thm)],[mp_earliest_time_point_24,prove_l2_33,prove_l2_34]) ).
cnf(18,plain,
greater(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1))),
inference('HYPERRESOLVE',[status(thm)],[a8_31,prove_l2_33]) ).
cnf(19,plain,
~ decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
inference('UR-RESOLVE',[status(thm)],[l3_22,prove_l2_33,prove_l2_34]) ).
cnf(20,plain,
( greater(sk2,initial_FM_EP(sk1))
| sk2 = initial_FM_EP(sk1) ),
inference('HYPERRESOLVE',[status(thm)],[mp_greater_or_equal_30,17]) ).
cnf(22,plain,
~ greater_or_equal(sk2,sk2),
inference('UR-RESOLVE',[status(thm)],[mp_positive_function_difference_25,18,prove_l2_33,17,prove_l2_34,19,prove_l2_35]) ).
cnf(23,plain,
( sk2 = initial_FM_EP(sk1)
| in_environment(sk1,initial_FM_EP(sk1)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_times_in_order_28,20,prove_l2_33,15,16]) ).
cnf(24,plain,
( sk2 = initial_FM_EP(sk1)
| subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_earliest_time_point_23,23,prove_l2_33]) ).
cnf(26,plain,
( sk2 = initial_FM_EP(sk1)
| greater_or_equal(initial_FM_EP(sk1),initial_FM_EP(sk1)) ),
inference('HYPERRESOLVE',[status(thm)],[mp_earliest_time_point_24,24,prove_l2_33]) ).
cnf(27,plain,
( sk2 = initial_FM_EP(sk1)
| decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[mp_positive_function_difference_25,26,prove_l2_33,17,prove_l2_34,18]),prove_l2_35]) ).
cnf(28,plain,
sk2 = initial_FM_EP(sk1),
inference('HYPERRESOLVE',[status(thm)],[l3_22,27,prove_l2_33,24]) ).
cnf(30,plain,
$false,
inference('REWRITE',[status(thm)],[17,22,28,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT020-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n026.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 12:25:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:25:03
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-09T12:25:03
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 #||
% 0.19/0.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 49 formulas have been input or derived (from 28 formulas).
% 0.19/0.50 ; 30 (61%) were retained. Of these,
% 0.19/0.50 ; 10 (33%) were simplified or subsumed later,
% 0.19/0.50 ; 20 (67%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.004 11% Read assertion file (1 call)
% 0.19/0.50 ; 0.001 3% Assert (14 calls)
% 0.19/0.50 ; 0.002 6% Process new row (34 calls)
% 0.19/0.50 ; 0.002 6% Resolution (54 calls)
% 0.19/0.50 ; 0.000 0% Paramodulation (27 calls)
% 0.19/0.50 ; 0.000 0% Factoring (7 calls)
% 0.19/0.50 ; 0.001 3% Condensing (20 calls)
% 0.19/0.50 ; 0.000 0% Forward subsumption (20 calls)
% 0.19/0.50 ; 0.000 0% Backward subsumption (18 calls)
% 0.19/0.50 ; 0.000 0% Clause clause subsumption (4 calls)
% 0.19/0.50 ; 0.003 9% Forward simplification (34 calls)
% 0.19/0.50 ; 0.001 3% Backward simplification (30 calls)
% 0.19/0.50 ; 0.000 0% Ordering (57 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.021 60% Other
% 0.19/0.50 ; 0.035 Total
% 0.19/0.50 ; 0.039 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 62 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 11 entries (18 at peak, 18 added, 7 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 82 nodes (151 at peak, 151 added, 69 deleted).
% 0.19/0.50 ; Retrieved 4 possibly forward subsuming rows in 20 calls.
% 0.19/0.50 ; Retrieved 0 possibly backward subsumed rows in 18 calls.
% 0.19/0.50 ; Path-index has 52 entries (65 at peak, 67 added, 15 deleted).
% 0.19/0.50 ; Path-index has 124 nodes (140 at peak, 142 added, 18 deleted).
% 0.19/0.50 ; Trie-index has 52 entries (65 at peak, 67 added, 15 deleted).
% 0.19/0.50 ; Trie-index has 104 nodes (145 at peak, 148 added, 44 deleted).
% 0.19/0.50 ; Retrieved 3 generalization terms in 18 calls.
% 0.19/0.50 ; Retrieved 11 instance terms in 11 calls.
% 0.19/0.50 ; Retrieved 648 unifiable terms in 393 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of backward simplifiable rows to process has 8 entries:
% 0.19/0.50 ; 8 with value 0
% 0.19/0.50 ; The agenda of rows to give has 2 entries:
% 0.19/0.50 ; 1 with value (4 7) 1 with value (4 13)
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.039 seconds of real time
% 0.19/0.50 0.031933 seconds of user run time
% 0.19/0.50 0.006922 seconds of system run time
% 0.19/0.50 0 calls to %EVAL
% 0.19/0.50 0 page faults and
% 0.19/0.50 3,525,120 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:25:03
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------