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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : ARI622_1 : TPTP v8.1.0. Released v5.1.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 : Thu Jul 14 22:09:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
tff('SOLVE-$$LESSEQ-BY-$$$LESS',axiom,
    ! [X: 'NUMBER',Y: 'NUMBER'] :
      ( $lesseq(X,Y)
      | '$$$LESS'(Y,X) ) ).

tff(16,negated_conjecture,
    ! [X: $int] :
      ( pow2(X)
      | ( X != 1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_of_pows_of_2_eq_10) ).

tff(17,negated_conjecture,
    ! [X: $int,Y: $int] :
      ( pow2(X)
      | ~ $lesseq(2,X)
      | ( $product(2,Y) != X )
      | ~ pow2(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_of_pows_of_2_eq_10) ).

tff(18,negated_conjecture,
    ! [X: $int,Y: $int] :
      ( ~ pow2(X)
      | ~ pow2(Y)
      | ( $sum(X,Y) != 10 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_of_pows_of_2_eq_10) ).

tff(19,plain,
    pow2(1),
    inference('HYPERRESOLVE',[status(thm)],[16,theory(equality)]) ).

tff(20,plain,
    pow2(2),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,19,'SOLVE-$$LESSEQ-BY-$$$LESS',theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$PRODUCT']) ).

tff(23,plain,
    pow2(4),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,20,'SOLVE-$$LESSEQ-BY-$$$LESS',theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$PRODUCT']) ).

tff(26,plain,
    pow2(8),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,23,'SOLVE-$$LESSEQ-BY-$$$LESS',theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$PRODUCT']) ).

cnf(27,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[18,26,20]),'CODE-FOR-$$SUM',theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ARI622_1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n026.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 Jun 17 13:07:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-17T13:07:39
% 0.20/0.47  ; 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-17T13:07:39
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  #||
% 0.20/0.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.50  ||#
% 0.20/0.50  
% 0.20/0.50  ; Summary of computation:
% 0.20/0.50  ;        70 formulas have been input or derived (from 23 formulas).
% 0.20/0.50  ;        27 (39%) were retained.  Of these,
% 0.20/0.50  ;            2 ( 7%) were simplified or subsumed later,
% 0.20/0.50  ;           25 (93%) are still being kept.
% 0.20/0.50  ; 
% 0.20/0.50  ; Run time in seconds excluding printing time:
% 0.20/0.50  ;     0.001   3%   Read assertion file          (1 call)
% 0.20/0.50  ;     0.001   3%   Assert                       (1 call)
% 0.20/0.50  ;     0.002   7%   Process new row              (57 calls)
% 0.20/0.50  ;     0.005  17%   Resolution                   (44 calls)
% 0.20/0.50  ;     0.000   0%   Paramodulation               (22 calls)
% 0.20/0.50  ;     0.000   0%   Factoring                    (4 calls)
% 0.20/0.50  ;     0.000   0%   Condensing                   (14 calls)
% 0.20/0.51  ;     0.000   0%   Forward subsumption          (14 calls)
% 0.20/0.51  ;     0.000   0%   Backward subsumption         (14 calls)
% 0.20/0.51  ;     0.001   3%   Forward simplification       (57 calls)
% 0.20/0.51  ;     0.000   0%   Backward simplification      (27 calls)
% 0.20/0.51  ;     0.000   0%   Ordering                     (6 calls)
% 0.20/0.51  ;     0.000   0%   Sortal reasoning             (258 calls)
% 0.20/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.51  ;     0.020  67%   Other
% 0.20/0.51  ;     0.030        Total
% 0.20/0.51  ;     0.033        Real time
% 0.20/0.51  ; 
% 0.20/0.51  ; Term-hash-array has 32 terms in all.
% 0.20/0.51  ; Feature-vector-row-index has 14 entries (14 at peak, 14 added, 0 deleted).
% 0.20/0.51  ; Feature-vector-row-index has 40 nodes (40 at peak, 40 added, 0 deleted).
% 0.20/0.51  ;  Retrieved 0 possibly forward subsuming rows in 14 calls.
% 0.20/0.51  ;  Retrieved 0 possibly backward subsumed rows in 14 calls.
% 0.20/0.51  ; Path-index has 41 entries (41 at peak, 45 added, 4 deleted).
% 0.20/0.51  ; Path-index has 72 nodes (72 at peak, 76 added, 4 deleted).
% 0.20/0.51  ; Trie-index has 41 entries (41 at peak, 45 added, 4 deleted).
% 0.20/0.51  ; Trie-index has 55 nodes (55 at peak, 59 added, 4 deleted).
% 0.20/0.51  ; Retrieved 16 generalization terms in 24 calls.
% 0.20/0.51  ; Retrieved 12 instance terms in 12 calls.
% 0.20/0.51  ; Retrieved 398 unifiable terms in 182 calls.
% 0.20/0.51  ; 
% 0.20/0.51  ; The agenda of rows to process has 9 entries:
% 0.20/0.51  ;     5 with value 12              1 with value 14               2 with value 18
% 0.20/0.51  ;     1 with value 13
% 0.20/0.51  ; The agenda of rows to give has 2 entries:
% 0.20/0.51  ;     1 with value (4 9)           1 with value (4 10)
% 0.20/0.51  Evaluation took:
% 0.20/0.51    0.033 seconds of real time
% 0.20/0.51    0.029347 seconds of user run time
% 0.20/0.51    0.00397 seconds of system run time
% 0.20/0.51    0 calls to %EVAL
% 0.20/0.51    0 page faults and
% 0.20/0.51    2,067,856 bytes consed.
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T13:07:39
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  * 
%------------------------------------------------------------------------------