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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NUN075+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:18 EDT 2022

% Result   : Theorem 0.40s 0.55s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   31 (  27 unt;   0 nHn;   6 RR)
%            Number of literals    :   56 (  15 equ;  26 neg)
%            Maximal clause size   :   23 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   1 con; 0-2 aty)
%            Number of variables   :   68 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ r1(X)
    | X = 'SKOLEMAAAW1' ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).

cnf(3,axiom,
    ( ~ r2(X,Y)
    | Y = 'SKOLEMAAAW2'(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).

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

cnf(9,axiom,
    r2(X,'SKOLEMAAAW7'(X,Y)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

cnf(10,axiom,
    r3(X,'SKOLEMAAAW7'(Y,X),'SKOLEMAAAW6'(Y,X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

cnf(11,axiom,
    'SKOLEMAAAW6'(X,Y) = 'SKOLEMAAAW5'(X,Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

cnf(12,axiom,
    r2('SKOLEMAAAW8'(X,Y),'SKOLEMAAAW5'(X,Y)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

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

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

cnf(21,axiom,
    r1('SKOLEMAAAW14'(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).

cnf(22,axiom,
    r3(X,'SKOLEMAAAW14'(X),'SKOLEMAAAW13'(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).

cnf(23,axiom,
    'SKOLEMAAAW13'(X) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).

cnf(24,axiom,
    r1('SKOLEMAAAW16'(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).

cnf(33,negated_conjecture,
    ( X != Y
    | ~ r2(Z,Y)
    | ~ r2(U,Z)
    | ~ r2(V,U)
    | ~ r2(W,V)
    | ~ r2(X1,W)
    | ~ r2(Y1,X1)
    | ~ r2(Z1,Y1)
    | ~ r2(U1,Z1)
    | ~ r1(V1)
    | ~ r2(V1,U1)
    | ~ r3(W1,X2,X)
    | ~ r2(Y2,X2)
    | ~ r1(Z2)
    | ~ r2(Z2,Y2)
    | ~ r2(U2,W1)
    | ~ r2(V2,U2)
    | ~ r2(W2,V2)
    | ~ r2(X3,W2)
    | ~ r2(Y3,X3)
    | ~ r2(Z3,Y3)
    | ~ r1(U3)
    | ~ r2(U3,Z3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sevenplustwoeqnine) ).

cnf(35,plain,
    r3(X,'SKOLEMAAAW14'(X),X),
    inference('REWRITE',[status(thm)],[22,23,theory(equality)]) ).

cnf(36,plain,
    r3(X,'SKOLEMAAAW7'(Y,X),'SKOLEMAAAW5'(Y,X)),
    inference('REWRITE',[status(thm)],[10,11,theory(equality)]) ).

cnf(37,plain,
    'SKOLEMAAAW16'(X) = 'SKOLEMAAAW1',
    inference('HYPERRESOLVE',[status(thm)],[1,24]) ).

cnf(38,plain,
    r1('SKOLEMAAAW1'),
    inference('REWRITE',[status(thm)],[24,37,theory(equality)]) ).

cnf(43,plain,
    'SKOLEMAAAW14'(X) = 'SKOLEMAAAW1',
    inference('HYPERRESOLVE',[status(thm)],[1,21]) ).

cnf(44,plain,
    r3(X,'SKOLEMAAAW1',X),
    inference('REWRITE',[status(thm)],[35,43,theory(equality)]) ).

cnf(45,plain,
    'SKOLEMAAAW11'(X,Y) = 'SKOLEMAAAW2'(X),
    inference('HYPERRESOLVE',[status(thm)],[3,14]) ).

cnf(47,plain,
    r2(X,'SKOLEMAAAW2'(X)),
    inference('REWRITE',[status(thm)],[14,45,theory(equality)]) ).

cnf(48,plain,
    'SKOLEMAAAW7'(X,Y) = 'SKOLEMAAAW2'(X),
    inference('HYPERRESOLVE',[status(thm)],[3,9]) ).

cnf(49,plain,
    r3(X,'SKOLEMAAAW2'(Y),'SKOLEMAAAW5'(Y,X)),
    inference('REWRITE',[status(thm)],[36,48,theory(equality)]) ).

cnf(50,plain,
    'SKOLEMAAAW5'(X,Y) = 'SKOLEMAAAW2'('SKOLEMAAAW8'(X,Y)),
    inference('HYPERRESOLVE',[status(thm)],[3,12]) ).

cnf(57,plain,
    X = 'SKOLEMAAAW3'(X,'SKOLEMAAAW1'),
    inference('HYPERRESOLVE',[status(thm)],[5,44]) ).

cnf(58,plain,
    'SKOLEMAAAW8'(X,Y) = 'SKOLEMAAAW3'(Y,X),
    inference('HYPERRESOLVE',[status(thm)],[5,13]) ).

cnf(61,plain,
    'SKOLEMAAAW5'(X,Y) = 'SKOLEMAAAW2'('SKOLEMAAAW3'(Y,X)),
    inference('REWRITE',[status(thm)],[50,58,theory(equality)]) ).

cnf(62,plain,
    r3(X,'SKOLEMAAAW2'(Y),'SKOLEMAAAW2'('SKOLEMAAAW3'(X,Y))),
    inference('REWRITE',[status(thm)],[49,61,theory(equality)]) ).

cnf(65,plain,
    'SKOLEMAAAW2'('SKOLEMAAAW3'(X,Y)) = 'SKOLEMAAAW3'(X,'SKOLEMAAAW2'(Y)),
    inference('HYPERRESOLVE',[status(thm)],[5,62]) ).

cnf(87,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[33,47,47,47,47,47,47,47,38,47,62,47,38,47,47,47,47,47,47,47,38,47,theory(equality)]),47,57,65,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN075+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  2 06:17:23 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-02T06:17:23
% 0.21/0.48  ; 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-02T06:17:23
% 0.21/0.50  
% 0.40/0.55  ; Recognized relation function assertion (|r4| ?X ?Y (SKOLEMAAAW12 ?X ?Y)).
% 0.40/0.55  
% 0.40/0.55  #||
% 0.40/0.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.55  % SZS output start Refutation
% See solution above
% 0.40/0.55  ||#
% 0.40/0.55  
% 0.40/0.55  ; Summary of computation:
% 0.40/0.55  ;       190 formulas have been input or derived (from 39 formulas).
% 0.40/0.55  ;        87 (46%) were retained.  Of these,
% 0.40/0.55  ;           30 (34%) were simplified or subsumed later,
% 0.40/0.55  ;           57 (66%) are still being kept.
% 0.40/0.55  ; 
% 0.40/0.55  ; Run time in seconds excluding printing time:
% 0.40/0.55  ;     0.006   9%   Read assertion file          (1 call)
% 0.40/0.55  ;     0.002   3%   Assert                       (12 calls)
% 0.40/0.55  ;     0.009  14%   Process new row              (145 calls)
% 0.40/0.55  ;     0.014  22%   Resolution                   (76 calls)
% 0.40/0.55  ;     0.002   3%   Paramodulation               (38 calls)
% 0.40/0.55  ;     0.000   0%   Factoring                    (4 calls)
% 0.40/0.55  ;     0.002   3%   Condensing                   (41 calls)
% 0.40/0.55  ;     0.001   2%   Forward subsumption          (41 calls)
% 0.40/0.55  ;     0.000   0%   Backward subsumption         (32 calls)
% 0.40/0.55  ;     0.000   0%   Clause clause subsumption    (27 calls)
% 0.40/0.55  ;     0.002   3%   Forward simplification       (138 calls)
% 0.40/0.55  ;     0.000   0%   Backward simplification      (86 calls)
% 0.40/0.55  ;     0.003   5%   Ordering                     (108 calls)
% 0.40/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.40/0.55  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.55  ;     0.023  36%   Other
% 0.40/0.55  ;     0.064        Total
% 0.40/0.55  ;     0.067        Real time
% 0.40/0.55  ; 
% 0.40/0.55  ; Term-hash-array has 167 terms in all.
% 0.40/0.55  ; Feature-vector-row-index has 26 entries (26 at peak, 32 added, 6 deleted).
% 0.40/0.55  ; Feature-vector-row-index has 85 nodes (85 at peak, 107 added, 22 deleted).
% 0.40/0.55  ;  Retrieved 64 possibly forward subsuming rows in 41 calls.
% 0.40/0.55  ;  Retrieved 7 possibly backward subsumed rows in 32 calls.
% 0.40/0.55  ; Path-index has 131 entries (131 at peak, 177 added, 46 deleted).
% 0.40/0.55  ; Path-index has 365 nodes (365 at peak, 426 added, 61 deleted).
% 0.40/0.55  ; Trie-index has 131 entries (131 at peak, 177 added, 46 deleted).
% 0.40/0.55  ; Trie-index has 290 nodes (290 at peak, 405 added, 115 deleted).
% 0.40/0.55  ; Retrieved 46 generalization terms in 290 calls.
% 0.40/0.55  ; Retrieved 60 instance terms in 53 calls.
% 0.40/0.55  ; Retrieved 6,492 unifiable terms in 1,931 calls.
% 0.40/0.55  ; 
% 0.40/0.55  ; The agenda of rows to process has 9 entries:
% 0.40/0.55  ;     1 with value 31              2 with value 33               2 with value 35
% 0.40/0.55  ;     1 with value 32              3 with value 34
% 0.40/0.55  ; The agenda of rows to give has 28 entries:
% 0.40/0.55  ;     1 with value (4 5)           2 with value (4 10)           2 with value (4 18)
% 0.40/0.55  ;     1 with value (4 6)           2 with value (4 12)           2 with value (4 22)
% 0.40/0.55  ;     5 with value (4 7)           4 with value (4 13)           1 with value (4 24)
% 0.40/0.55  ;     2 with value (4 8)           1 with value (4 15)           1 with value (4 25)
% 0.40/0.55  ;     2 with value (4 9)           2 with value (4 16)
% 0.40/0.55  Evaluation took:
% 0.40/0.55    0.068 seconds of real time
% 0.40/0.55    0.061349 seconds of user run time
% 0.40/0.55    0.007272 seconds of system run time
% 0.40/0.55    0 calls to %EVAL
% 0.40/0.55    0 page faults and
% 0.40/0.55    5,453,296 bytes consed.
% 0.40/0.55  :PROOF-FOUND
% 0.40/0.55  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-02T06:17:23
% 0.40/0.55  :PROOF-FOUND
% 0.40/0.55  * 
%------------------------------------------------------------------------------