↑ Up

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

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

% Computer : n027.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 : Sat Jul 16 01:27:31 EDT 2022

% Result   : Theorem 0.52s 0.69s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   20 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :  107 (  15 equ)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   81 (  81 fml;   0 var)
%            Number arithmetic     :   30 (   0 atm;   0 fun;  12 num;  18 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   0 usr;   3 con; 0-0 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?;  42   :)

% Comments : 
%------------------------------------------------------------------------------
tff(1,axiom,
    ! [X: $int,Y: list] : ( head(cons(X,Y)) = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).

tff(2,axiom,
    ! [X: $int,Y: list] : ( tail(cons(X,Y)) = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).

tff(3,axiom,
    ! [X: list] :
      ( ( X = nil )
      | ( X = cons(head(X),tail(X)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3) ).

tff(4,axiom,
    ! [X: $int,Y: list] : ( cons(X,Y) != nil ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).

tff(9,axiom,
    ! [X: $int,Y: list,Z: $int,U: list] :
      ( in(X,Y)
      | ( Y != cons(Z,U) )
      | ( X != Z ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).

tff(10,axiom,
    ! [X: $int,Y: list,Z: $int,U: list] :
      ( in(X,Y)
      | ( Y != cons(Z,U) )
      | ~ in(X,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).

tff(35,axiom,
    ! [X: list] : ( append(nil,X) = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_6) ).

tff(36,axiom,
    ! [X: $int,Y: list,Z: list] : ( append(cons(X,Y),Z) = cons(X,append(Y,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_7) ).

tff(39,negated_conjecture,
    ~ in(2,cons(1,cons(2,cons(3,nil)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

tff(46,plain,
    ! [X: $int,Y: list] : ( append(cons(X,nil),Y) = cons(X,Y) ),
    inference('PARAMODULATE',[status(thm)],[36,35,theory(equality)]) ).

tff(47,plain,
    ~ in(2,append(cons(1,nil),append(cons(2,nil),cons(3,nil)))),
    inference('REWRITE',[status(thm)],[39,46,theory(equality)]) ).

tff(49,plain,
    ! [X: list] :
      ( ( X = nil )
      | ( X = append(cons(head(X),nil),tail(X)) ) ),
    inference('REWRITE',[status(thm)],[3,46,theory(equality)]) ).

tff(54,plain,
    ! [X: $int,Y: list,Z: list] : ( append(cons(X,Y),Z) = append(cons(X,nil),append(Y,Z)) ),
    inference('REWRITE',[status(thm)],[36,46,theory(equality)]) ).

tff(63,plain,
    ! [X: $int,Y: $int,Z: list,U: list] : ( append(append(cons(X,nil),cons(Y,nil)),append(Z,U)) = append(cons(X,nil),append(cons(Y,Z),U)) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,54,theory(equality)]),46,theory(equality)]) ).

tff(64,plain,
    ~ in(2,append(append(cons(1,nil),cons(2,nil)),cons(3,nil))),
    inference('REWRITE',[status(thm)],[47,35,63,theory(equality)]) ).

tff(67,plain,
    ! [X: $int,Y: list] : in(X,append(cons(X,nil),Y)),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[9,49,theory(equality)]),2,1,4,theory(equality)]) ).

tff(90,plain,
    ! [X: $int,Y: list,Z: list] : in(X,append(cons(X,Y),Z)),
    inference('PARAMODULATE',[status(thm)],[67,54,theory(equality)]) ).

tff(109,plain,
    ! [X: $int,Y: $int,Z: list,U: list] : in(X,append(cons(Y,nil),append(cons(X,Z),U))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[10,90,theory(equality)]),46,theory(equality)]) ).

tff(252,plain,
    ! [X: $int,Y: $int,Z: list,U: list] : in(X,append(append(cons(Y,nil),cons(X,Z)),U)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[109,54,theory(equality)]),46,theory(equality)]) ).

cnf(253,plain,
    $false,
    inference('REWRITE',[status(thm)],[64,252]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT079_1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jul  1 20:09:53 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T20:09:53
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-07-01T20:09:53
% 0.52/0.69  
% 0.52/0.69  
% 0.52/0.69  #||
% 0.52/0.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.69  % SZS output start Refutation
% See solution above
% 0.52/0.69  ||#
% 0.52/0.69  
% 0.52/0.69  ; Summary of computation:
% 0.52/0.69  ;       994 formulas have been input or derived (from 90 formulas).
% 0.52/0.69  ;       253 (25%) were retained.  Of these,
% 0.52/0.69  ;           39 (15%) were simplified or subsumed later,
% 0.52/0.69  ;          214 (85%) are still being kept.
% 0.52/0.69  ; 
% 0.52/0.69  ; Run time in seconds excluding printing time:
% 0.52/0.69  ;     0.005   2%   Read assertion file          (1 call)
% 0.52/0.69  ;     0.000   0%   Assert                       (15 calls)
% 0.52/0.69  ;     0.033  15%   Process new row              (893 calls)
% 0.52/0.69  ;     0.025  12%   Resolution                   (178 calls)
% 0.52/0.69  ;     0.009   4%   Paramodulation               (89 calls)
% 0.52/0.69  ;     0.000   0%   Factoring                    (22 calls)
% 0.52/0.69  ;     0.003   1%   Condensing                   (307 calls)
% 0.52/0.69  ;     0.024  11%   Forward subsumption          (307 calls)
% 0.52/0.69  ;     0.006   3%   Backward subsumption         (162 calls)
% 0.52/0.69  ;     0.002   1%   Clause clause subsumption    (385 calls)
% 0.52/0.69  ;     0.052  24%   Forward simplification       (795 calls)
% 0.52/0.69  ;     0.003   1%   Backward simplification      (252 calls)
% 0.52/0.69  ;     0.017   8%   Ordering                     (4,026 calls)
% 0.52/0.69  ;     0.003   1%   Sortal reasoning             (2,768 calls)
% 0.52/0.69  ;     0.001   0%   Purity testing               (1 call)
% 0.52/0.69  ;     0.032  15%   Other
% 0.52/0.69  ;     0.215        Total
% 0.52/0.69  ;     0.218        Real time
% 0.52/0.69  ; 
% 0.52/0.69  ; Term-hash-array has 572 terms in all.
% 0.52/0.69  ; Feature-vector-row-index has 147 entries (147 at peak, 162 added, 15 deleted).
% 0.52/0.69  ; Feature-vector-row-index has 1,182 nodes (1,182 at peak, 1,317 added, 135 deleted).
% 0.52/0.69  ;  Retrieved 664 possibly forward subsuming rows in 307 calls.
% 0.52/0.69  ;  Retrieved 33 possibly backward subsumed rows in 162 calls.
% 0.52/0.69  ; Path-index has 512 entries (516 at peak, 626 added, 114 deleted).
% 0.52/0.69  ; Path-index has 2,157 nodes (2,166 at peak, 2,382 added, 225 deleted).
% 0.52/0.69  ; Trie-index has 512 entries (516 at peak, 626 added, 114 deleted).
% 0.52/0.69  ; Trie-index has 2,052 nodes (2,067 at peak, 2,522 added, 470 deleted).
% 0.52/0.69  ; Retrieved 4,589 generalization terms in 5,202 calls.
% 0.52/0.69  ; Retrieved 174 instance terms in 101 calls.
% 0.52/0.69  ; Retrieved 4,944 unifiable terms in 841 calls.
% 0.52/0.69  ; 
% 0.52/0.69  ; The agenda of rows to process has 23 entries:
% 0.52/0.69  ;     1 with value 17              1 with value 25               1 with value 42
% 0.52/0.69  ;     2 with value 19              1 with value 27               1 with value 59
% 0.52/0.69  ;     2 with value 21              1 with value 29               2 with value 64
% 0.52/0.69  ;     7 with value 22              1 with value 32               1 with value 88
% 0.52/0.69  ;     1 with value 24              1 with value 40
% 0.52/0.69  ; The agenda of rows to give has 133 entries:
% 0.52/0.69  ;     5 with value (4 18)          3 with value (4 30)           3 with value (4 44)
% 0.52/0.69  ;     8 with value (4 19)         11 with value (4 31)           4 with value (4 45)
% 0.52/0.69  ;    11 with value (4 20)          3 with value (4 32)           1 with value (4 46)
% 0.52/0.69  ;    13 with value (4 21)          4 with value (4 33)           1 with value (4 47)
% 0.52/0.69  ;    10 with value (4 22)          3 with value (4 34)           2 with value (4 53)
% 0.52/0.69  ;     6 with value (4 23)          2 with value (4 35)           3 with value (4 54)
% 0.52/0.69  ;     5 with value (4 24)          1 with value (4 37)           1 with value (4 56)
% 0.52/0.69  ;     1 with value (4 25)          1 with value (4 38)           3 with value (4 57)
% 0.52/0.69  ;     3 with value (4 26)          1 with value (4 39)           1 with value (4 61)
% 0.52/0.69  ;     6 with value (4 27)          1 with value (4 40)           1 with value (4 70)
% 0.52/0.69  ;     3 with value (4 28)          3 with value (4 42)           1 with value (4 73)
% 0.52/0.69  ;     6 with value (4 29)          1 with value (4 43)           1 with value (4 77)
% 0.52/0.69  Evaluation took:
% 0.52/0.69    0.219 seconds of real time
% 0.52/0.69    0.185748 seconds of user run time
% 0.52/0.69    0.031668 seconds of system run time
% 0.52/0.69    0 calls to %EVAL
% 0.52/0.69    0 page faults and
% 0.52/0.69    11,023,736 bytes consed.
% 0.52/0.69  :PROOF-FOUND
% 0.52/0.69  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T20:09:53
% 0.52/0.69  :PROOF-FOUND
% 0.52/0.69  * 
%------------------------------------------------------------------------------