TSTP Solution File: NUN062+2 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n028.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 16:38:15 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   16 (  11 unt;   0 nHn;   7 RR)
%            Number of literals    :   24 (   9 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   29 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ r2(X,Y)
    | Y = 'SKOLEMAAAV2'(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).

cnf(5,axiom,
    ( ~ r3(X,Y,Z)
    | Z = 'SKOLEMAAAV3'(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).

cnf(13,axiom,
    r3(X,Y,'SKOLEMAAAV8'(Y,X)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

cnf(14,axiom,
    r2(X,'SKOLEMAAAV11'(X,Y)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).

cnf(32,axiom,
    ( ~ r1(X)
    | X != Y
    | ~ r2(Z,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).

cnf(33,negated_conjecture,
    ( r1('SKOLEMAAAV22'(X))
    | ~ r3('SKOLEMAAAV21',X,Y)
    | Y != Z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',infiniteNumbers) ).

cnf(34,negated_conjecture,
    ( X = 'SKOLEMAAAV22'(X)
    | ~ r3('SKOLEMAAAV21',X,Y)
    | Y != Z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',infiniteNumbers) ).

cnf(46,plain,
    'SKOLEMAAAV11'(X,Y) = 'SKOLEMAAAV2'(X),
    inference('HYPERRESOLVE',[status(thm)],[3,14]) ).

cnf(48,plain,
    r2(X,'SKOLEMAAAV2'(X)),
    inference('REWRITE',[status(thm)],[14,46,theory(equality)]) ).

cnf(54,plain,
    ~ r1('SKOLEMAAAV2'(X)),
    inference('UR-RESOLVE',[status(thm)],[32,48,theory(equality)]) ).

cnf(59,plain,
    'SKOLEMAAAV8'(X,Y) = 'SKOLEMAAAV3'(Y,X),
    inference('HYPERRESOLVE',[status(thm)],[5,13]) ).

cnf(60,plain,
    r3(X,Y,'SKOLEMAAAV3'(X,Y)),
    inference('REWRITE',[status(thm)],[13,59,theory(equality)]) ).

cnf(86,plain,
    r1('SKOLEMAAAV22'(X)),
    inference('HYPERRESOLVE',[status(thm)],[33,60,theory(equality)]) ).

cnf(88,plain,
    X = 'SKOLEMAAAV22'(X),
    inference('HYPERRESOLVE',[status(thm)],[34,60,theory(equality)]) ).

cnf(89,plain,
    r1(X),
    inference('REWRITE',[status(thm)],[86,88,theory(equality)]) ).

cnf(90,plain,
    $false,
    inference('REWRITE',[status(thm)],[54,89]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun  2 02:49:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-02T02:49:08
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-02T02:49:08
% 0.20/0.48  
% 0.20/0.51  ; Recognized relation function assertion (|r4| ?X ?Y (SKOLEMAAAV12 ?X ?Y)).
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;       191 formulas have been input or derived (from 39 formulas).
% 0.20/0.52  ;        90 (47%) were retained.  Of these,
% 0.20/0.52  ;           43 (48%) were simplified or subsumed later,
% 0.20/0.52  ;           47 (52%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.004   9%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.002   4%   Assert                       (12 calls)
% 0.20/0.52  ;     0.010  22%   Process new row              (144 calls)
% 0.20/0.52  ;     0.003   7%   Resolution                   (76 calls)
% 0.20/0.52  ;     0.000   0%   Paramodulation               (38 calls)
% 0.20/0.52  ;     0.000   0%   Factoring                    (4 calls)
% 0.20/0.52  ;     0.001   2%   Condensing                   (30 calls)
% 0.20/0.52  ;     0.001   2%   Forward subsumption          (30 calls)
% 0.20/0.52  ;     0.000   0%   Backward subsumption         (30 calls)
% 0.20/0.52  ;     0.000   0%   Clause clause subsumption    (10 calls)
% 0.20/0.52  ;     0.002   4%   Forward simplification       (127 calls)
% 0.20/0.52  ;     0.000   0%   Backward simplification      (89 calls)
% 0.20/0.52  ;     0.001   2%   Ordering                     (101 calls)
% 0.20/0.52  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.52  ;     0.021  46%   Other
% 0.20/0.52  ;     0.046        Total
% 0.20/0.52  ;     0.048        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 148 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 16 entries (25 at peak, 30 added, 14 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 47 nodes (79 at peak, 91 added, 44 deleted).
% 0.20/0.52  ;  Retrieved 12 possibly forward subsuming rows in 30 calls.
% 0.20/0.52  ;  Retrieved 7 possibly backward subsumed rows in 30 calls.
% 0.20/0.52  ; Path-index has 102 entries (114 at peak, 161 added, 59 deleted).
% 0.20/0.52  ; Path-index has 354 nodes (363 at peak, 425 added, 71 deleted).
% 0.20/0.52  ; Trie-index has 102 entries (114 at peak, 161 added, 59 deleted).
% 0.20/0.52  ; Trie-index has 272 nodes (289 at peak, 404 added, 132 deleted).
% 0.20/0.52  ; Retrieved 41 generalization terms in 181 calls.
% 0.20/0.52  ; Retrieved 70 instance terms in 58 calls.
% 0.20/0.52  ; Retrieved 914 unifiable terms in 233 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.20/0.52  ;     3 with value 0
% 0.20/0.52  ; The agenda of rows to process has 10 entries:
% 0.20/0.52  ;     2 with value 7               1 with value 13               1 with value 24
% 0.20/0.52  ;     5 with value 10              1 with value 18
% 0.20/0.52  ; The agenda of input rows to give has 1 entry:
% 0.20/0.52  ;     1 with value 16
% 0.20/0.52  ; The agenda of rows to give has 25 entries:
% 0.20/0.52  ;     1 with value (4 4)           2 with value (4 9)            2 with value (4 16)
% 0.20/0.52  ;     1 with value (4 5)           2 with value (4 10)           1 with value (4 18)
% 0.20/0.52  ;     6 with value (4 7)           2 with value (4 12)           2 with value (4 22)
% 0.20/0.52  ;     2 with value (4 8)           4 with value (4 13)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.049 seconds of real time
% 0.20/0.52    0.038349 seconds of user run time
% 0.20/0.52    0.010158 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    3,062,192 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-02T02:49:08
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------