TSTP Solution File: DAT085_1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : DAT085_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n013.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:33 EDT 2022

% Result   : Theorem 0.47s 0.69s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$SUM')

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

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

tff(29,axiom,
    length(nil) = 0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

tff(30,axiom,
    ! [X: $int,Y: list] : ( length(cons(X,Y)) = $sum(1,length(Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).

tff(39,negated_conjecture,
    ! [X: list,Y: list] :
      ( ( length(X) != length(Y) )
      | ( X = Y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

tff(42,plain,
    ! [X: list] : ( length(X) != -1 ),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[39,4]),'CODE-FOR-$$SUM',29,30,theory(equality)]) ).

tff(44,plain,
    ! [X: list,Y: list,Z: $int] :
      ( ( length(X) != $sum(1,length(Y)) )
      | ( X = cons(Z,Y) ) ),
    inference('PARAMODULATE',[status(thm)],[39,30,theory(equality)]) ).

tff(75,plain,
    ! [X: list] : ( length(X) != -2 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(86,plain,
    ! [X: list] : ( length(X) != -3 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[75,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(89,plain,
    ! [X: list] : ( length(X) != -4 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[86,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(92,plain,
    ! [X: list] : ( length(X) != -5 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[89,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(100,plain,
    ! [X: list] : ( length(X) != -6 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(126,plain,
    ! [X: list] : ( length(X) != -7 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[100,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(146,plain,
    ! [X: list] : ( length(X) != -8 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[126,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(159,plain,
    ! [X: list] : ( length(X) != -9 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[146,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(176,plain,
    ! [X: list] : ( length(X) != -10 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[159,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(210,plain,
    ! [X: list] : ( length(X) != -11 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[176,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(284,plain,
    ! [X: list] : ( length(X) != -12 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[210,30,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(299,plain,
    ! [X: $int,Y: list,Z: $int] : ( cons(X,Y) = cons(Z,Y) ),
    inference('HYPERRESOLVE',[status(thm)],[44,30]) ).

tff(305,plain,
    ! [X: $int,Y: $int] : ( X = Y ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,299,theory(equality)]),1,theory(equality)]) ).

cnf(306,plain,
    $false,
    inference('REWRITE',[status(thm)],[284,305,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : DAT085_1 : TPTP v8.1.0. Released v6.1.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jul  1 17:17:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 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.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:17:14
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-07-01T17:17:14
% 0.47/0.69  
% 0.47/0.69  
% 0.47/0.69  #||
% 0.47/0.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.69  % SZS output start Refutation
% See solution above
% 0.47/0.69  ||#
% 0.47/0.69  
% 0.47/0.69  ; Summary of computation:
% 0.47/0.69  ;      1648 formulas have been input or derived (from 110 formulas).
% 0.47/0.69  ;       306 (19%) were retained.  Of these,
% 0.47/0.69  ;          163 (53%) were simplified or subsumed later,
% 0.47/0.69  ;          143 (47%) are still being kept.
% 0.47/0.69  ; 
% 0.47/0.69  ; Run time in seconds excluding printing time:
% 0.47/0.70  ;     0.005   2%   Read assertion file          (1 call)
% 0.47/0.70  ;     0.002   1%   Assert                       (15 calls)
% 0.47/0.70  ;     0.034  16%   Process new row              (1,259 calls)
% 0.47/0.70  ;     0.031  14%   Resolution                   (218 calls)
% 0.47/0.70  ;     0.005   2%   Paramodulation               (109 calls)
% 0.47/0.70  ;     0.000   0%   Factoring                    (21 calls)
% 0.47/0.70  ;     0.006   3%   Condensing                   (320 calls)
% 0.47/0.70  ;     0.016   7%   Forward subsumption          (320 calls)
% 0.47/0.70  ;     0.003   1%   Backward subsumption         (168 calls)
% 0.47/0.70  ;     0.004   2%   Clause clause subsumption    (357 calls)
% 0.47/0.70  ;     0.055  26%   Forward simplification       (1,160 calls)
% 0.47/0.70  ;     0.008   4%   Backward simplification      (305 calls)
% 0.47/0.70  ;     0.016   7%   Ordering                     (4,629 calls)
% 0.47/0.70  ;     0.001   0%   Sortal reasoning             (4,280 calls)
% 0.47/0.70  ;     0.000   0%   Purity testing               (1 call)
% 0.47/0.70  ;     0.028  13%   Other
% 0.47/0.70  ;     0.214        Total
% 0.47/0.70  ;     0.223        Real time
% 0.47/0.70  ; 
% 0.47/0.70  ; Term-hash-array has 688 terms in all.
% 0.47/0.70  ; Feature-vector-row-index has 93 entries (151 at peak, 168 added, 75 deleted).
% 0.47/0.70  ; Feature-vector-row-index has 768 nodes (1,162 at peak, 1,314 added, 546 deleted).
% 0.47/0.70  ;  Retrieved 620 possibly forward subsuming rows in 320 calls.
% 0.47/0.70  ;  Retrieved 35 possibly backward subsumed rows in 168 calls.
% 0.47/0.70  ; Path-index has 353 entries (632 at peak, 738 added, 385 deleted).
% 0.47/0.70  ; Path-index has 1,902 nodes (2,200 at peak, 2,379 added, 477 deleted).
% 0.47/0.70  ; Trie-index has 353 entries (632 at peak, 738 added, 385 deleted).
% 0.47/0.70  ; Trie-index has 1,475 nodes (2,336 at peak, 2,759 added, 1,284 deleted).
% 0.47/0.70  ; Retrieved 5,875 generalization terms in 7,232 calls.
% 0.47/0.70  ; Retrieved 368 instance terms in 148 calls.
% 0.47/0.70  ; Retrieved 8,676 unifiable terms in 1,066 calls.
% 0.47/0.70  ; 
% 0.47/0.70  ; The agenda of backward simplifiable rows to process has 9 entries:
% 0.47/0.70  ;     9 with value 0
% 0.47/0.70  ; The agenda of rows to process has 235 entries:
% 0.47/0.70  ;     5 with value 12             32 with value 18               2 with value 28
% 0.47/0.70  ;    20 with value 13             12 with value 19               4 with value 29
% 0.47/0.70  ;    28 with value 14              6 with value 20               2 with value 31
% 0.47/0.70  ;    32 with value 15              6 with value 21               2 with value 32
% 0.47/0.70  ;    28 with value 16              8 with value 25               2 with value 35
% 0.47/0.70  ;    38 with value 17              4 with value 26               4 with value 36
% 0.47/0.70  ; The agenda of rows to give has 80 entries:
% 0.47/0.70  ;     1 with value (4 7)           2 with value (4 28)           2 with value (4 44)
% 0.47/0.70  ;     1 with value (4 10)          1 with value (4 29)           2 with value (4 45)
% 0.47/0.70  ;     1 with value (4 17)          1 with value (4 30)           1 with value (4 46)
% 0.47/0.70  ;     6 with value (4 18)          7 with value (4 31)           1 with value (4 47)
% 0.47/0.70  ;     3 with value (4 19)          1 with value (4 33)           1 with value (4 53)
% 0.47/0.70  ;     6 with value (4 20)          2 with value (4 34)           1 with value (4 54)
% 0.47/0.70  ;     9 with value (4 21)          1 with value (4 35)           1 with value (4 56)
% 0.47/0.70  ;     4 with value (4 22)          1 with value (4 39)           2 with value (4 57)
% 0.47/0.70  ;     4 with value (4 23)          1 with value (4 40)           1 with value (4 61)
% 0.47/0.70  ;     3 with value (4 24)          2 with value (4 42)           1 with value (4 73)
% 0.47/0.70  ;     3 with value (4 26)          1 with value (4 43)           1 with value (4 77)
% 0.47/0.70  ;     5 with value (4 27)
% 0.47/0.70  Evaluation took:
% 0.47/0.70    0.223 seconds of real time
% 0.47/0.70    0.185062 seconds of user run time
% 0.47/0.70    0.037941 seconds of system run time
% 0.47/0.70    [Run times include 0.006 seconds GC run time.]
% 0.47/0.70    0 calls to %EVAL
% 0.47/0.70    0 page faults and
% 0.47/0.70    12,603,448 bytes consed.
% 0.47/0.70  :PROOF-FOUND
% 0.47/0.70  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:17:15
% 0.47/0.70  :PROOF-FOUND
% 0.47/0.70  * 
%------------------------------------------------------------------------------