↑ Up

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

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

% Computer : n004.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  : 300s
% DateTime : Tue May  5 06:48:48 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf('$$LESSEQ-IS-REFLEXIVE',axiom,
    $lesseq(X,X) ).

cnf('$$GREATEREQ-IS-REFLEXIVE',axiom,
    $greatereq(X,X) ).

tff('SOLVE-$$GREATEREQ-BY-$$$LESS',axiom,
    ! [X: 'NUMBER',Y: 'NUMBER'] :
      ( $greatereq(X,Y)
      | '$$$LESS'(X,Y) ) ).

tff(14,axiom,
    ! [X: $int,Y: $int] :
      ( ~ s0(X,Y)
      | ~ $lesseq(X,200)
      | s3(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(16,axiom,
    ! [X: $int,Y: $int,Z: $int] :
      ( ~ s3(X,Y)
      | ~ $lesseq(Z,40)
      | ~ $greatereq(Z,0)
      | s4(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

tff(19,axiom,
    ! [X: $int,Y: $int,Z: $int] :
      ( ~ s4(X,Y)
      | ( Z != $sum(X,Y) )
      | s0(Z,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

tff(20,negated_conjecture,
    ! [X: $int,Y: $int] :
      ( ~ $lesseq(X,200)
      | s0(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj1) ).

tff(21,negated_conjecture,
    ! [X: $int,Y: $int] :
      ( ~ s0(X,Y)
      | ~ $greatereq(X,240) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj1) ).

tff(22,plain,
    ! [X: $int] : s0(200,X),
    inference('HYPERRESOLVE',[status(thm)],[20,'$$LESSEQ-IS-REFLEXIVE']) ).

tff(24,plain,
    ! [X: $int] : ~ s0(240,X),
    inference('UR-RESOLVE',[status(thm)],[21,'$$GREATEREQ-IS-REFLEXIVE']) ).

tff(25,plain,
    ! [X: $int] : s3(200,X),
    inference('HYPERRESOLVE',[status(thm)],[14,22,'$$LESSEQ-IS-REFLEXIVE']) ).

tff(27,plain,
    s4(200,40),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,25,'$$LESSEQ-IS-REFLEXIVE','SOLVE-$$GREATEREQ-BY-$$$LESS']),'CODE-FOR-$$$LESS']) ).

cnf(33,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[19,27,theory(equality)]),24,'CODE-FOR-$$SUM']) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : PLA060_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12  % Command  : run-snark %s %d
% 0.14/0.33  % Computer : n004.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Tue May  5 04:50:17 EDT 2026
% 0.14/0.33  % CPUTime  : 
% 0.29/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.46  * 
% 0.29/0.46  * 
% 0.29/0.47  #<PACKAGE "SNARK-USER">
% 0.29/0.47  * 
% 0.29/0.47  SNARK-TPTP-OPTIONS
% 0.29/0.47  * 
% 0.29/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.29/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.29/0.47   (USE-FACTORING :POS)
% 0.29/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.29/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.29/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.29/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.29/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.29/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.29/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.29/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.29/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.29/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.29/0.47  * 
% 0.29/0.47  "."
% 0.29/0.47  * 
% 0.29/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2026-05-05T04:50:17
% 0.29/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2026-05-05T04:50:17
% 0.29/0.50  
% 0.29/0.50  
% 0.29/0.50  #||
% 0.29/0.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.50  % SZS output start Refutation
% See solution above
% 0.29/0.50  ||#
% 0.29/0.50  
% 0.29/0.50  ; Summary of computation:
% 0.29/0.50  ;        55 formulas have been input or derived (from 26 formulas).
% 0.29/0.50  ;        33 (60%) were retained.  Of these,
% 0.29/0.50  ;            1 ( 3%) were simplified or subsumed later,
% 0.29/0.50  ;           32 (97%) are still being kept.
% 0.29/0.50  ; 
% 0.29/0.50  ; Run time in seconds excluding printing time:
% 0.29/0.50  ;     0.003   9%   Read assertion file          (1 call)
% 0.29/0.50  ;     0.001   3%   Assert                       (7 calls)
% 0.29/0.50  ;     0.002   6%   Process new row              (49 calls)
% 0.29/0.50  ;     0.001   3%   Resolution                   (50 calls)
% 0.29/0.50  ;     0.000   0%   Paramodulation               (25 calls)
% 0.29/0.50  ;     0.000   0%   Factoring                    (4 calls)
% 0.29/0.50  ;     0.000   0%   Condensing                   (19 calls)
% 0.29/0.50  ;     0.001   3%   Forward subsumption          (19 calls)
% 0.29/0.50  ;     0.001   3%   Backward subsumption         (19 calls)
% 0.29/0.50  ;     0.001   3%   Forward simplification       (49 calls)
% 0.29/0.50  ;     0.000   0%   Backward simplification      (32 calls)
% 0.29/0.50  ;     0.000   0%   Sortal reasoning             (123 calls)
% 0.29/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.29/0.50  ;     0.022  69%   Other
% 0.29/0.50  ;     0.032        Total
% 0.29/0.50  ;     0.035        Real time
% 0.29/0.50  ; 
% 0.29/0.50  ; Term-hash-array has 40 terms in all.
% 0.29/0.50  ; Feature-vector-row-index has 19 entries (19 at peak, 19 added, 0 deleted).
% 0.29/0.50  ; Feature-vector-row-index has 53 nodes (53 at peak, 53 added, 0 deleted).
% 0.29/0.50  ;  Retrieved 1 possibly forward subsuming row in 19 calls.
% 0.29/0.50  ;  Retrieved 0 possibly backward subsumed rows in 19 calls.
% 0.29/0.50  ; Path-index has 46 entries (46 at peak, 46 added, 0 deleted).
% 0.29/0.50  ; Path-index has 83 nodes (83 at peak, 83 added, 0 deleted).
% 0.29/0.50  ; Trie-index has 46 entries (46 at peak, 46 added, 0 deleted).
% 0.29/0.50  ; Trie-index has 67 nodes (67 at peak, 67 added, 0 deleted).
% 0.29/0.50  ; Retrieved 25 generalization terms in 32 calls.
% 0.29/0.50  ; Retrieved 12 instance terms in 12 calls.
% 0.29/0.50  ; Retrieved 180 unifiable terms in 124 calls.
% 0.29/0.50  ; 
% 0.29/0.50  ; The agenda of rows to process has 2 entries:
% 0.29/0.50  ;     2 with value 11
% 0.29/0.50  ; The agenda of rows to give has 6 entries:
% 0.29/0.50  ;     3 with value (4 7)           1 with value (4 9)            2 with value (4 15)
% 0.29/0.50  Evaluation took:
% 0.29/0.50    0.035 seconds of real time
% 0.29/0.50    0.029885 seconds of user run time
% 0.29/0.50    0.005166 seconds of system run time
% 0.29/0.50    0 calls to %EVAL
% 0.29/0.50    0 page faults and
% 0.29/0.50    2,362,136 bytes consed.
% 0.29/0.50  :PROOF-FOUND
% 0.29/0.50  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2026-05-05T04:50:17
% 0.29/0.50  :PROOF-FOUND
% 0.29/0.50  * 
%------------------------------------------------------------------------------