↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : PUZ134_2 : 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 : Mon Jul 18 18:26:55 EDT 2022

% Result   : Theorem 0.86s 1.03s
% Output   : Refutation 0.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   24 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :  141 (  22 equ)
%            Maximal formula atoms :    5 (   5 avg)
%            Number of connectives :   38 (  17   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   96 (  96 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   9 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
tff(21,axiom,
    ! [X: knowheyan] :
      ( ( X = a )
      | ( X = b )
      | ( X = c )
      | ( X = d )
      | ( X = e ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_knowheyans) ).

tff(25,axiom,
    ! [X: age,Y: age,Z: age] :
      ( ~ greater(X,Y)
      | ~ greater(Y,Z)
      | greater(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_transitive) ).

tff(26,axiom,
    ! [X: age,Y: age] :
      ( ~ greater(X,Y)
      | ~ greater(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_irreflexive) ).

tff(28,axiom,
    ! [X: age,Y: age] :
      ( ( X != Y )
      | ~ greater(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_greater) ).

tff(30,axiom,
    greater(age_of(a),age_of(d)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info1) ).

tff(31,axiom,
    greater(age_of(d),age_of(b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info2) ).

tff(33,axiom,
    greater(age_of(b),age_of(c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info4) ).

tff(36,axiom,
    greater(age_of(c),age_of('SKOLEMAAAV1.knowheyan')),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_not_youngest) ).

tff(37,negated_conjecture,
    ( ~ greater(age_of(a),age_of(d))
    | ~ greater(age_of(d),age_of(b))
    | ~ greater(age_of(b),age_of(c))
    | ~ greater(age_of(c),age_of(e)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_order) ).

tff(38,plain,
    ~ greater(age_of(c),age_of(e)),
    inference('REWRITE',[status(thm)],[37,33,31,30]) ).

tff(41,plain,
    ~ greater(age_of(c),age_of(b)),
    inference('UR-RESOLVE',[status(thm)],[26,33]) ).

tff(43,plain,
    ! [X: age] : ~ greater(X,X),
    inference('UR-RESOLVE',[status(thm)],[28,theory(equality)]) ).

tff(44,plain,
    age_of(c) != age_of('SKOLEMAAAV1.knowheyan'),
    inference('UR-RESOLVE',[status(thm)],[28,36]) ).

tff(65,plain,
    greater(age_of(a),age_of(b)),
    inference('HYPERRESOLVE',[status(thm)],[25,30,31]) ).

tff(66,plain,
    greater(age_of(b),age_of('SKOLEMAAAV1.knowheyan')),
    inference('HYPERRESOLVE',[status(thm)],[25,33,36]) ).

tff(83,plain,
    ! [X: knowheyan] :
      ( ( X = a )
      | ( X = b )
      | ( X = c )
      | ( X = d )
      | ~ greater(age_of(c),age_of(X)) ),
    inference('PARAMODULATE',[status(thm)],[38,21,theory(equality)]) ).

tff(93,plain,
    ~ greater(age_of(c),age_of(a)),
    inference('UR-RESOLVE',[status(thm)],[25,65,41]) ).

tff(96,plain,
    greater(age_of(d),age_of('SKOLEMAAAV1.knowheyan')),
    inference('HYPERRESOLVE',[status(thm)],[25,66,31]) ).

tff(98,plain,
    age_of(b) != age_of('SKOLEMAAAV1.knowheyan'),
    inference('UR-RESOLVE',[status(thm)],[28,66]) ).

tff(436,plain,
    ( ( 'SKOLEMAAAV1.knowheyan' = a )
    | ( 'SKOLEMAAAV1.knowheyan' = b )
    | ( 'SKOLEMAAAV1.knowheyan' = c )
    | ( 'SKOLEMAAAV1.knowheyan' = d ) ),
    inference('HYPERRESOLVE',[status(thm)],[83,36]) ).

tff(439,plain,
    ( ( 'SKOLEMAAAV1.knowheyan' = a )
    | ( 'SKOLEMAAAV1.knowheyan' = b )
    | ( 'SKOLEMAAAV1.knowheyan' = c ) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[96,436,theory(equality)]),43]) ).

tff(440,plain,
    ( ( 'SKOLEMAAAV1.knowheyan' = a )
    | ( 'SKOLEMAAAV1.knowheyan' = b ) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[44,439,theory(equality)]),theory(equality)]) ).

tff(442,plain,
    'SKOLEMAAAV1.knowheyan' = a,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[98,440,theory(equality)]),theory(equality)]) ).

cnf(443,plain,
    $false,
    inference('REWRITE',[status(thm)],[36,93,442,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PUZ134_2 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat May 28 21:09:09 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  * 
% 0.20/0.45  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T21:09:09
% 0.20/0.46  ; 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-05-28T21:09:09
% 0.86/1.03  
% 0.86/1.03  
% 0.86/1.03  #||
% 0.86/1.03  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.86/1.03  % SZS output start Refutation
% See solution above
% 0.86/1.04  ||#
% 0.86/1.04  
% 0.86/1.04  ; Summary of computation:
% 0.86/1.04  ;      3851 formulas have been input or derived (from 126 formulas).
% 0.86/1.04  ;       443 (12%) were retained.  Of these,
% 0.86/1.04  ;          169 (38%) were simplified or subsumed later,
% 0.86/1.04  ;          274 (62%) are still being kept.
% 0.86/1.04  ; 
% 0.86/1.04  ; Run time in seconds excluding printing time:
% 0.86/1.04  ;     0.007   1%   Read assertion file          (1 call)
% 0.86/1.04  ;     0.000   0%   Assert                       (36 calls)
% 0.86/1.04  ;     0.039   7%   Process new row              (3,423 calls)
% 0.86/1.04  ;     0.078  14%   Resolution                   (250 calls)
% 0.86/1.04  ;     0.002   0%   Paramodulation               (125 calls)
% 0.86/1.04  ;     0.000   0%   Factoring                    (38 calls)
% 0.86/1.04  ;     0.032   6%   Condensing                   (1,071 calls)
% 0.86/1.04  ;     0.058  10%   Forward subsumption          (1,071 calls)
% 0.86/1.04  ;     0.016   3%   Backward subsumption         (363 calls)
% 0.86/1.04  ;     0.212  37%   Clause clause subsumption    (4,519 calls)
% 0.86/1.04  ;     0.064  11%   Forward simplification       (3,383 calls)
% 0.86/1.04  ;     0.005   1%   Backward simplification      (442 calls)
% 0.86/1.04  ;     0.018   3%   Ordering                     (7,334 calls)
% 0.86/1.04  ;     0.001   0%   Sortal reasoning             (1,307 calls)
% 0.86/1.04  ;     0.001   0%   Purity testing               (1 call)
% 0.86/1.04  ;     0.039   7%   Other
% 0.86/1.04  ;     0.572        Total
% 0.86/1.04  ;     0.574        Real time
% 0.86/1.04  ; 
% 0.86/1.04  ; Term-hash-array has 215 terms in all.
% 0.86/1.04  ; Feature-vector-row-index has 212 entries (359 at peak, 363 added, 151 deleted).
% 0.86/1.04  ; Feature-vector-row-index has 728 nodes (946 at peak, 978 added, 250 deleted).
% 0.86/1.04  ;  Retrieved 9,671 possibly forward subsuming rows in 1,071 calls.
% 0.86/1.04  ;  Retrieved 963 possibly backward subsumed rows in 363 calls.
% 0.86/1.04  ; Path-index has 190 entries (226 at peak, 232 added, 42 deleted).
% 0.86/1.04  ; Path-index has 72 nodes (78 at peak, 80 added, 8 deleted).
% 0.86/1.04  ; Trie-index has 190 entries (226 at peak, 232 added, 42 deleted).
% 0.86/1.04  ; Trie-index has 178 nodes (213 at peak, 222 added, 44 deleted).
% 0.86/1.04  ; Retrieved 9,777 generalization terms in 13,196 calls.
% 0.86/1.04  ; Retrieved 94 instance terms in 78 calls.
% 0.86/1.04  ; Retrieved 26,195 unifiable terms in 2,896 calls.
% 0.86/1.04  ; 
% 0.86/1.04  ; The agenda of backward simplifiable rows to process has 161 entries:
% 0.86/1.04  ;   161 with value 0
% 0.86/1.04  ; The agenda of rows to process has 22 entries:
% 0.86/1.04  ;     8 with value 16              1 with value 17              13 with value 27
% 0.86/1.04  ; The agenda of rows to give has 182 entries:
% 0.86/1.04  ;     1 with value (4 9)          11 with value (4 31)          16 with value (4 39)
% 0.86/1.04  ;     1 with value (4 25)          1 with value (4 32)          12 with value (4 40)
% 0.86/1.04  ;    19 with value (4 28)         19 with value (4 36)           8 with value (4 41)
% 0.86/1.04  ;    12 with value (4 29)         28 with value (4 37)           3 with value (4 42)
% 0.86/1.04  ;    21 with value (4 30)         30 with value (4 38)
% 0.86/1.04  Evaluation took:
% 0.86/1.04    0.575 seconds of real time
% 0.86/1.04    0.533667 seconds of user run time
% 0.86/1.04    0.040755 seconds of system run time
% 0.86/1.04    [Run times include 0.022 seconds GC run time.]
% 0.86/1.04    0 calls to %EVAL
% 0.86/1.04    0 page faults and
% 0.86/1.04    70,554,680 bytes consed.
% 0.86/1.04  :PROOF-FOUND
% 0.86/1.04  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T21:09:09
% 0.86/1.04  :PROOF-FOUND
% 0.86/1.04  * 
%------------------------------------------------------------------------------