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

View Problem - Process Solution

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

% Computer : n008.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:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
tff(1,axiom,
    ! [X: $int] : ~ in(X,empty),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=0.ax',ax1) ).

tff(2,axiom,
    ! [X: $int,Y: collection] : in(X,add(X,Y)),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=0.ax',ax2) ).

tff(23,axiom,
    ! [X: collection] :
      ( ( X != empty )
      | ( count(X) = 0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax2) ).

tff(24,axiom,
    ! [X: collection] :
      ( ( X = empty )
      | ( count(X) != 0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax2) ).

tff(25,axiom,
    ! [X: $int,Y: collection] :
      ( in(X,Y)
      | ( count(add(X,Y)) = $sum(count(Y),1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax3) ).

tff(26,plain,
    ! [X: $int,Y: collection] :
      ( in(X,Y)
      | ( count(add(X,Y)) = $sum(1,count(Y)) ) ),
    inference('REWRITE',[status(thm)],[25,'CODE-FOR-$$SUM']) ).

tff(31,axiom,
    ! [X: $int,Y: collection] :
      ( ~ in(X,Y)
      | ( count(remove(X,Y)) = $difference(count(Y),1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax5) ).

tff(32,plain,
    ! [X: $int,Y: collection] :
      ( ~ in(X,Y)
      | ( count(remove(X,Y)) = $sum(-1,count(Y)) ) ),
    inference('REWRITE',[status(thm)],[31,'CODE-FOR-$$SUM','CODE-FOR-$$PRODUCT','CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE']) ).

tff(38,negated_conjecture,
    count(add(5,remove(3,add(3,empty)))) != 1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(40,plain,
    count(empty) = 0,
    inference('HYPERRESOLVE',[status(thm)],[23,theory(equality)]) ).

tff(64,plain,
    ! [X: $int] : ( count(add(X,empty)) = 1 ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[1,26]),'CODE-FOR-$$SUM',40,theory(equality)]) ).

tff(74,plain,
    ! [X: $int,Y: collection] : ( count(remove(X,add(X,Y))) = $sum(-1,count(add(X,Y))) ),
    inference('HYPERRESOLVE',[status(thm)],[32,2]) ).

tff(213,plain,
    ! [X: $int,Y: collection] :
      ( ( remove(X,add(X,Y)) = empty )
      | ( count(add(X,Y)) != 1 ) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,74,theory(equality)]),'CODE-FOR-$$SUM',theory(equality)]) ).

tff(760,plain,
    ! [X: $int] : ( remove(X,add(X,empty)) = empty ),
    inference('HYPERRESOLVE',[status(thm)],[213,64]) ).

cnf(761,plain,
    $false,
    inference('REWRITE',[status(thm)],[38,64,760,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT047_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jul  1 19:57:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T19:57:38
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-01T19:57:38
% 0.61/0.79  
% 0.61/0.79  
% 0.61/0.79  #||
% 0.61/0.79  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.79  % SZS output start Refutation
% See solution above
% 0.61/0.79  ||#
% 0.61/0.79  
% 0.61/0.79  ; Summary of computation:
% 0.61/0.79  ;      2744 formulas have been input or derived (from 142 formulas).
% 0.61/0.79  ;       761 (28%) were retained.  Of these,
% 0.61/0.79  ;          127 (17%) were simplified or subsumed later,
% 0.61/0.79  ;          634 (83%) are still being kept.
% 0.61/0.79  ; 
% 0.61/0.79  ; Run time in seconds excluding printing time:
% 0.61/0.79  ;     0.005   2%   Read assertion file          (1 call)
% 0.61/0.79  ;     0.001   0%   Assert                       (13 calls)
% 0.61/0.79  ;     0.080  26%   Process new row              (2,406 calls)
% 0.61/0.79  ;     0.040  13%   Resolution                   (282 calls)
% 0.61/0.79  ;     0.009   3%   Paramodulation               (141 calls)
% 0.61/0.79  ;     0.000   0%   Factoring                    (19 calls)
% 0.61/0.79  ;     0.005   2%   Condensing                   (362 calls)
% 0.61/0.79  ;     0.016   5%   Forward subsumption          (362 calls)
% 0.61/0.79  ;     0.008   3%   Backward subsumption         (313 calls)
% 0.61/0.79  ;     0.006   2%   Clause clause subsumption    (497 calls)
% 0.61/0.79  ;     0.088  28%   Forward simplification       (2,389 calls)
% 0.61/0.79  ;     0.011   4%   Backward simplification      (757 calls)
% 0.61/0.79  ;     0.003   1%   Ordering                     (1,239 calls)
% 0.61/0.79  ;     0.001   0%   Ordering ac                  (6 calls)
% 0.61/0.79  ;     0.008   3%   Sortal reasoning             (7,900 calls)
% 0.61/0.79  ;     0.000   0%   Purity testing               (1 call)
% 0.61/0.79  ;     0.030  10%   Other
% 0.61/0.79  ;     0.311        Total
% 0.61/0.79  ;     0.313        Real time
% 0.61/0.79  ; 
% 0.61/0.79  ; Term-hash-array has 2,032 terms in all.
% 0.61/0.79  ; Feature-vector-row-index has 311 entries (313 at peak, 313 added, 2 deleted).
% 0.61/0.79  ; Feature-vector-row-index has 2,273 nodes (2,310 at peak, 2,310 added, 37 deleted).
% 0.61/0.79  ;  Retrieved 794 possibly forward subsuming rows in 362 calls.
% 0.61/0.79  ;  Retrieved 38 possibly backward subsumed rows in 313 calls.
% 0.61/0.79  ; Path-index has 1,769 entries (1,975 at peak, 2,130 added, 361 deleted).
% 0.61/0.79  ; Path-index has 3,404 nodes (3,708 at peak, 3,810 added, 406 deleted).
% 0.61/0.79  ; Trie-index has 1,769 entries (1,975 at peak, 2,130 added, 361 deleted).
% 0.61/0.79  ; Trie-index has 4,071 nodes (5,070 at peak, 5,398 added, 1,327 deleted).
% 0.61/0.79  ; Retrieved 5,448 generalization terms in 14,346 calls.
% 0.61/0.79  ; Retrieved 493 instance terms in 443 calls.
% 0.61/0.79  ; Retrieved 15,399 unifiable terms in 1,845 calls.
% 0.61/0.79  ; 
% 0.61/0.79  ; The agenda of backward simplifiable rows to process has 67 entries:
% 0.61/0.79  ;    67 with value 0
% 0.61/0.79  ; The agenda of rows to process has 16 entries:
% 0.61/0.79  ;     1 with value 17              1 with value 25               1 with value 31
% 0.61/0.79  ;     5 with value 22              2 with value 26               1 with value 32
% 0.61/0.79  ;     4 with value 24              1 with value 28
% 0.61/0.79  ; The agenda of rows to give has 501 entries:
% 0.61/0.79  ;     1 with value (4 13)         27 with value (4 29)          17 with value (4 37)
% 0.61/0.79  ;     1 with value (4 21)         46 with value (4 30)           8 with value (4 38)
% 0.61/0.79  ;    24 with value (4 22)         29 with value (4 31)          18 with value (4 39)
% 0.61/0.79  ;    22 with value (4 23)         71 with value (4 32)           5 with value (4 40)
% 0.61/0.79  ;    18 with value (4 24)          7 with value (4 33)          11 with value (4 41)
% 0.61/0.79  ;    35 with value (4 25)         25 with value (4 34)           4 with value (4 42)
% 0.61/0.79  ;    28 with value (4 26)         17 with value (4 35)           6 with value (4 44)
% 0.61/0.79  ;    24 with value (4 27)         26 with value (4 36)           2 with value (4 45)
% 0.61/0.79  ;    29 with value (4 28)
% 0.61/0.79  Evaluation took:
% 0.61/0.79    0.315 seconds of real time
% 0.61/0.79    0.270347 seconds of user run time
% 0.61/0.79    0.043924 seconds of system run time
% 0.61/0.79    [Run times include 0.011 seconds GC run time.]
% 0.61/0.79    0 calls to %EVAL
% 0.61/0.79    0 page faults and
% 0.61/0.79    19,367,560 bytes consed.
% 0.61/0.79  :PROOF-FOUND
% 0.61/0.79  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T19:57:38
% 0.61/0.79  :PROOF-FOUND
% 0.61/0.79  * 
%------------------------------------------------------------------------------