↑ Up

SNARK---20120808r022.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n014.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 : Mon Jul 18 14:15:15 EDT 2022

% Result   : Theorem 0.11s 0.44s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   20 (  17 unt;   0 nHn;  13 RR)
%            Number of literals    :   23 (  15 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   13 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).

cnf(38,axiom,
    ~ ord_less_int(pls,pls),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_36_rel__simps_I2_J) ).

cnf(41,axiom,
    ( ~ ord_less_int(X,Y)
    | ord_less_int(plus_plus_int(X,Z),plus_plus_int(Y,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_39_zadd__strict__right__mono) ).

cnf(90,axiom,
    bit0(pls) = pls,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_77_Bit0__Pls) ).

cnf(91,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_78_Pls__def) ).

cnf(94,axiom,
    plus_plus_int(X,pls) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_80_add__Pls__right) ).

cnf(97,axiom,
    bit0(X) = plus_plus_int(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_83_Bit0__def) ).

cnf(101,axiom,
    ( power_power_int(X,number_number_of_nat(Y)) != zero_zero_int
    | X = zero_zero_int ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_power__eq__0__iff__number__of) ).

cnf(102,plain,
    ( power_power_int(X,number_number_of_nat(Y)) != pls
    | X = pls ),
    inference('REWRITE',[status(thm)],[101,91,theory(equality)]) ).

cnf(112,axiom,
    bit1(X) = plus_plus_int(one_one_int,plus_plus_int(X,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_99_Bit1__def) ).

cnf(113,plain,
    bit1(X) = plus_plus_int(one_one_int,bit0(X)),
    inference('REWRITE',[status(thm)],[112,97,theory(equality)]) ).

cnf(128,negated_conjecture,
    power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

cnf(129,plain,
    power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = pls,
    inference('REWRITE',[status(thm)],[128,91,theory(equality)]) ).

cnf(131,plain,
    ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
    inference('REWRITE',[status(thm)],[1,91,theory(equality)]) ).

cnf(156,plain,
    bit1(pls) = one_one_int,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[113,90,theory(equality)]),94,theory(equality)]) ).

cnf(174,plain,
    power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(one_one_int))) = pls,
    inference('REWRITE',[status(thm)],[129,156,theory(equality)]) ).

cnf(277,plain,
    ord_less_int(X,plus_plus_int(one_one_int,plus_plus_int(semiri1621563631at_int(n),X))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[41,131]),94,theory(equality)]) ).

cnf(291,plain,
    plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
    inference('HYPERRESOLVE',[status(thm)],[102,174]) ).

cnf(293,plain,
    ord_less_int(X,X),
    inference('REWRITE',[status(thm)],[277,94,291,theory(equality)]) ).

cnf(294,plain,
    $false,
    inference('REWRITE',[status(thm)],[38,293]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% 0.00/0.08  % Command  : run-snark %s %d
% 0.07/0.26  % Computer : n014.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 600
% 0.07/0.27  % DateTime : Tue Jul  5 06:50:38 EDT 2022
% 0.07/0.27  % CPUTime  : 
% 0.11/0.35  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.35  * 
% 0.11/0.35  * 
% 0.11/0.36  #<PACKAGE "SNARK-USER">
% 0.11/0.36  * 
% 0.11/0.36  SNARK-TPTP-OPTIONS
% 0.11/0.36  * 
% 0.11/0.36  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.11/0.36   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.11/0.36   (USE-FACTORING :POS)
% 0.11/0.36   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.11/0.36   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.11/0.36   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.11/0.36   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.11/0.36   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.11/0.36   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.11/0.36   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.11/0.36   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.11/0.36   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.11/0.36   (DECLARE-TPTP-SYMBOLS2))
% 0.11/0.36  * 
% 0.11/0.36  "."
% 0.11/0.36  * 
% 0.11/0.36  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-05T06:50:38
% 0.11/0.36  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-05T06:50:38
% 0.11/0.37  
% 0.11/0.37  ; Recognized associativity assertion (= (|plus_plus_int| (|plus_plus_int| ?X ?Y) ?Z) (|plus_plus_int| ?X (|plus_plus_int| ?Y ?Z))).
% 0.11/0.37  ; Recognized commutativity assertion (= (|plus_plus_int| ?X ?Y) (|plus_plus_int| ?Y ?X)).
% 0.11/0.37  ; Recognized right identity assertion (= (|plus_plus_int| ?X |pls|) ?X).
% 0.11/0.37  ; Recognized left identity assertion (= (|plus_plus_int| |pls| ?X) ?X).
% 0.11/0.37  ; Recognized right identity assertion (= (|plus_plus_int| ?X |zero_zero_int|) ?X).
% 0.11/0.37  ; Recognized left identity assertion (= (|plus_plus_int| |zero_zero_int| ?X) ?X).
% 0.11/0.37  ; Declaring plus_plus_int to be commutative.
% 0.11/0.37  WARNING:
% 0.11/0.37     |ord_less_nat| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 0.11/0.44  ; Declaring plus_plus_int to be associative-commutative.
% 0.11/0.44  
% 0.11/0.44  #||
% 0.11/0.44  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.44  % SZS output start Refutation
% See solution above
% 0.11/0.44  ||#
% 0.11/0.44  
% 0.11/0.44  ; Summary of computation:
% 0.11/0.44  ;      1275 formulas have been input or derived (from 83 formulas).
% 0.11/0.44  ;       294 (23%) were retained.  Of these,
% 0.11/0.44  ;           84 (29%) were simplified or subsumed later,
% 0.11/0.44  ;          210 (71%) are still being kept.
% 0.11/0.44  ; 
% 0.11/0.44  ; Run time in seconds excluding printing time:
% 0.11/0.44  ;     0.008  10%   Read assertion file          (1 call)
% 0.11/0.44  ;     0.002   3%   Assert                       (107 calls)
% 0.11/0.44  ;     0.015  19%   Process new row              (920 calls)
% 0.11/0.44  ;     0.005   6%   Resolution                   (164 calls)
% 0.11/0.44  ;     0.008  10%   Paramodulation               (82 calls)
% 0.11/0.44  ;     0.000   0%   Factoring                    (1 call)
% 0.11/0.44  ;     0.000   0%   Embedding                    (24 calls)
% 0.11/0.44  ;     0.001   1%   Condensing                   (196 calls)
% 0.11/0.44  ;     0.001   1%   Forward subsumption          (196 calls)
% 0.11/0.44  ;     0.001   1%   Backward subsumption         (134 calls)
% 0.11/0.44  ;     0.000   0%   Clause clause subsumption    (166 calls)
% 0.11/0.44  ;     0.014  18%   Forward simplification       (899 calls)
% 0.11/0.44  ;     0.002   3%   Backward simplification      (263 calls)
% 0.11/0.44  ;     0.001   1%   Ordering                     (738 calls)
% 0.11/0.44  ;     0.003   4%   Ordering ac                  (236 calls)
% 0.11/0.44  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.11/0.44  ;     0.000   0%   Purity testing               (1 call)
% 0.11/0.44  ;     0.016  21%   Other
% 0.11/0.44  ;     0.077        Total
% 0.11/0.44  ;     0.079        Real time
% 0.11/0.44  ; 
% 0.11/0.44  ; Term-hash-array has 463 terms in all.
% 0.11/0.44  ; Feature-vector-row-index has 101 entries (101 at peak, 134 added, 33 deleted).
% 0.11/0.44  ; Feature-vector-row-index has 354 nodes (354 at peak, 559 added, 205 deleted).
% 0.11/0.44  ;  Retrieved 203 possibly forward subsuming rows in 196 calls.
% 0.11/0.44  ;  Retrieved 28 possibly backward subsumed rows in 134 calls.
% 0.11/0.44  ; Path-index has 376 entries (385 at peak, 488 added, 112 deleted).
% 0.11/0.44  ; Path-index has 571 nodes (581 at peak, 668 added, 97 deleted).
% 0.11/0.44  ; Trie-index has 376 entries (385 at peak, 488 added, 112 deleted).
% 0.11/0.44  ; Trie-index has 521 nodes (535 at peak, 750 added, 229 deleted).
% 0.11/0.44  ; Retrieved 16,288 generalization terms in 5,260 calls.
% 0.11/0.44  ; Retrieved 256 instance terms in 135 calls.
% 0.11/0.44  ; Retrieved 4,649 unifiable terms in 584 calls.
% 0.11/0.44  ; 
% 0.11/0.44  ; The agenda of backward simplifiable rows to process has 5 entries:
% 0.11/0.44  ;     5 with value 0
% 0.11/0.44  ; The agenda of rows to process has 15 entries:
% 0.11/0.44  ;     1 with value 14              4 with value 17              10 with value 18
% 0.11/0.44  ; The agenda of input rows to give has 20 entries:
% 0.11/0.44  ;    11 with value 15              2 with value 21               2 with value 26
% 0.11/0.44  ;     3 with value 19              2 with value 22
% 0.11/0.44  ; The agenda of rows to give has 113 entries:
% 0.11/0.44  ;     2 with value (4 5)           6 with value (4 12)           7 with value (4 18)
% 0.11/0.44  ;     8 with value (4 7)           4 with value (4 13)           5 with value (4 19)
% 0.11/0.44  ;     7 with value (4 8)          10 with value (4 14)           4 with value (4 20)
% 0.11/0.44  ;     5 with value (4 9)          11 with value (4 15)           2 with value (4 22)
% 0.11/0.44  ;     6 with value (4 10)         11 with value (4 16)           3 with value (4 23)
% 0.11/0.44  ;    12 with value (4 11)         10 with value (4 17)
% 0.11/0.44  Evaluation took:
% 0.11/0.44    0.079 seconds of real time
% 0.11/0.44    0.071822 seconds of user run time
% 0.11/0.44    0.007295 seconds of system run time
% 0.11/0.44    0 calls to %EVAL
% 0.11/0.44    0 page faults and
% 0.11/0.44    8,664,144 bytes consed.
% 0.11/0.44  :PROOF-FOUND
% 0.11/0.44  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-05T06:50:38
% 0.11/0.44  :PROOF-FOUND
% 0.11/0.44  * 
%------------------------------------------------------------------------------