TSTP Solution File: KLE088+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : KLE088+1 : TPTP v8.1.0. Released v4.0.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  : 600s
% DateTime : Sun Jul 17 02:26:35 EDT 2022

% Result   : Theorem 2.13s 2.32s
% Output   : Refutation 2.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   30 (  28 unt;   0 nHn;  14 RR)
%            Number of literals    :   32 (  27 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    addition(X,zero) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

cnf(2,axiom,
    addition(X,X) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).

cnf(3,plain,
    addition(X,addition(X,Y)) = addition(X,Y),
    inference('EMBED',[status(thm)],[2]) ).

cnf(5,axiom,
    multiplication(X,one) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

cnf(6,axiom,
    multiplication(one,X) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

cnf(7,axiom,
    multiplication(X,addition(Y,Z)) = addition(multiplication(X,Y),multiplication(X,Z)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

cnf(8,axiom,
    multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

cnf(11,axiom,
    ( ~ leq(X,Y)
    | addition(X,Y) = Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).

cnf(12,axiom,
    ( leq(X,Y)
    | addition(X,Y) != Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).

cnf(13,axiom,
    multiplication(antidomain(X),X) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).

cnf(14,axiom,
    addition(antidomain(multiplication(X,Y)),antidomain(multiplication(X,antidomain(antidomain(Y))))) = antidomain(multiplication(X,antidomain(antidomain(Y)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain2) ).

cnf(16,axiom,
    addition(antidomain(antidomain(X)),antidomain(X)) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).

cnf(17,plain,
    addition(antidomain(antidomain(X)),addition(antidomain(X),Y)) = addition(one,Y),
    inference('EMBED',[status(thm)],[16]) ).

cnf(18,axiom,
    domain(X) = antidomain(antidomain(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).

cnf(25,negated_conjecture,
    multiplication(domain('SKOLEMAAAV1'),'SKOLEMAAAV2') = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(26,plain,
    multiplication(antidomain(antidomain('SKOLEMAAAV1')),'SKOLEMAAAV2') = zero,
    inference('REWRITE',[status(thm)],[25,18,theory(equality)]) ).

cnf(27,negated_conjecture,
    addition(domain('SKOLEMAAAV1'),antidomain('SKOLEMAAAV2')) != antidomain('SKOLEMAAAV2'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(28,plain,
    addition(antidomain(antidomain('SKOLEMAAAV1')),antidomain('SKOLEMAAAV2')) != antidomain('SKOLEMAAAV2'),
    inference('REWRITE',[status(thm)],[27,18,theory(equality)]) ).

cnf(29,plain,
    zero = antidomain(one),
    inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).

cnf(39,plain,
    addition(one,antidomain(X)) = one,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,17,theory(equality)]),16,theory(equality)]) ).

cnf(57,plain,
    ~ leq(antidomain(antidomain('SKOLEMAAAV1')),antidomain('SKOLEMAAAV2')),
    inference('UR-RESOLVE',[status(thm)],[11,28]) ).

cnf(69,plain,
    X = addition(multiplication(X,antidomain(antidomain(Y))),multiplication(X,antidomain(Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]),5,theory(equality)]) ).

cnf(100,plain,
    addition(antidomain(zero),antidomain(multiplication(antidomain(antidomain('SKOLEMAAAV1')),antidomain(antidomain('SKOLEMAAAV2'))))) = antidomain(multiplication(antidomain(antidomain('SKOLEMAAAV1')),antidomain(antidomain('SKOLEMAAAV2')))),
    inference('PARAMODULATE',[status(thm)],[14,26,theory(equality)]) ).

cnf(167,plain,
    antidomain(zero) = one,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,29,theory(equality)]),1,theory(equality)]) ).

cnf(170,plain,
    one = antidomain(multiplication(antidomain(antidomain('SKOLEMAAAV1')),antidomain(antidomain('SKOLEMAAAV2')))),
    inference('REWRITE',[status(thm)],[100,39,167,theory(equality)]) ).

cnf(188,plain,
    X = addition(X,multiplication(antidomain(Y),X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,39,theory(equality)]),6,theory(equality)]) ).

cnf(236,plain,
    leq(multiplication(antidomain(X),Y),Y),
    inference('HYPERRESOLVE',[status(thm)],[12,188]) ).

cnf(633,plain,
    multiplication(antidomain(antidomain('SKOLEMAAAV1')),antidomain(antidomain('SKOLEMAAAV2'))) = zero,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,170,theory(equality)]),6,theory(equality)]) ).

cnf(1097,plain,
    antidomain(antidomain('SKOLEMAAAV1')) = multiplication(antidomain(antidomain('SKOLEMAAAV1')),antidomain('SKOLEMAAAV2')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[69,633,theory(equality)]),1,theory(equality)]) ).

cnf(1164,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[236,1097,theory(equality)]),57]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE088+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n004.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 : Thu Jun 16 08:28:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T08:28:54
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-16T08:28:54
% 0.20/0.51  
% 0.20/0.51  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.51  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.51  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.51  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.51  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.51  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.51  ; Recognized possible left inverse assertion (= (|multiplication| (|antidomain| ?X) ?X) |zero|).
% 0.20/0.51  ; Recognized possible right inverse assertion (= (|multiplication| ?X (|coantidomain| ?X)) |zero|).
% 0.20/0.51  ; Declaring addition to be commutative.
% 2.13/2.32  ; Declaring addition to be associative-commutative.
% 2.13/2.32  
% 2.13/2.32  #||
% 2.13/2.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.13/2.32  % SZS output start Refutation
% See solution above
% 2.13/2.33  ||#
% 2.13/2.33  
% 2.13/2.33  ; Summary of computation:
% 2.13/2.33  ;      8136 formulas have been input or derived (from 150 formulas).
% 2.13/2.33  ;      1164 (14%) were retained.  Of these,
% 2.13/2.33  ;           44 ( 4%) were simplified or subsumed later,
% 2.13/2.33  ;         1120 (96%) are still being kept.
% 2.13/2.33  ; 
% 2.13/2.33  ; Run time in seconds excluding printing time:
% 2.13/2.33  ;     0.005   0%   Read assertion file          (1 call)
% 2.13/2.33  ;     0.002   0%   Assert                       (21 calls)
% 2.13/2.33  ;     0.117   6%   Process new row              (7,748 calls)
% 2.13/2.33  ;     0.019   1%   Resolution                   (298 calls)
% 2.13/2.33  ;     0.136   7%   Paramodulation               (149 calls)
% 2.13/2.33  ;     0.001   0%   Embedding                    (134 calls)
% 2.13/2.33  ;     0.014   1%   Condensing                   (402 calls)
% 2.13/2.33  ;     0.020   1%   Forward subsumption          (402 calls)
% 2.13/2.33  ;     0.002   0%   Backward subsumption         (119 calls)
% 2.13/2.33  ;     0.018   1%   Clause clause subsumption    (1,153 calls)
% 2.13/2.33  ;     1.384  76%   Forward simplification       (7,589 calls)
% 2.13/2.33  ;     0.039   2%   Backward simplification      (1,031 calls)
% 2.13/2.33  ;     0.025   1%   Ordering                     (5,519 calls)
% 2.13/2.33  ;     0.004   0%   Ordering ac                  (730 calls)
% 2.13/2.33  ;     0.000   0%   Sortal reasoning             (32 calls)
% 2.13/2.33  ;     0.000   0%   Purity testing               (1 call)
% 2.13/2.33  ;     0.046   3%   Other
% 2.13/2.33  ;     1.832        Total
% 2.13/2.33  ;     1.840        Real time
% 2.13/2.33  ; 
% 2.13/2.33  ; Term-hash-array has 2,615 terms in all.
% 2.13/2.33  ; Feature-vector-row-index has 119 entries (119 at peak, 119 added, 0 deleted).
% 2.13/2.33  ; Feature-vector-row-index has 752 nodes (752 at peak, 752 added, 0 deleted).
% 2.13/2.33  ;  Retrieved 1,634 possibly forward subsuming rows in 402 calls.
% 2.13/2.33  ;  Retrieved 65 possibly backward subsumed rows in 119 calls.
% 2.13/2.33  ; Path-index has 2,513 entries (2,513 at peak, 2,639 added, 126 deleted).
% 2.13/2.33  ; Path-index has 1,701 nodes (1,701 at peak, 1,794 added, 93 deleted).
% 2.13/2.33  ; Trie-index has 2,513 entries (2,513 at peak, 2,639 added, 126 deleted).
% 2.13/2.33  ; Trie-index has 2,324 nodes (2,324 at peak, 2,524 added, 200 deleted).
% 2.13/2.33  ; Retrieved 1,968,965 generalization terms in 52,686 calls.
% 2.13/2.33  ; Retrieved 5,463 instance terms in 929 calls.
% 2.13/2.33  ; Retrieved 17,504 unifiable terms in 1,068 calls.
% 2.13/2.33  ; 
% 2.13/2.33  ; The agenda of rows to process has 32 entries:
% 2.13/2.33  ;     2 with value 14              7 with value 19               2 with value 24
% 2.13/2.33  ;     4 with value 15              1 with value 20               1 with value 25
% 2.13/2.33  ;     5 with value 17              2 with value 22               1 with value 35
% 2.13/2.33  ;     5 with value 18              1 with value 23               1 with value 36
% 2.13/2.33  ; The agenda of rows to give has 975 entries:
% 2.13/2.33  ;     1 with value (4 17)         37 with value (4 27)           4 with value (4 38)
% 2.13/2.33  ;    71 with value (4 18)         38 with value (4 28)          10 with value (4 39)
% 2.13/2.33  ;    87 with value (4 19)         44 with value (4 29)           4 with value (4 40)
% 2.13/2.33  ;    79 with value (4 20)         54 with value (4 30)           4 with value (4 42)
% 2.13/2.33  ;    90 with value (4 21)         28 with value (4 31)           8 with value (4 43)
% 2.13/2.33  ;    60 with value (4 22)         50 with value (4 32)           2 with value (4 44)
% 2.13/2.33  ;    61 with value (4 23)         14 with value (4 33)           2 with value (4 45)
% 2.13/2.33  ;    47 with value (4 24)         24 with value (4 34)           2 with value (4 47)
% 2.13/2.33  ;    71 with value (4 25)          4 with value (4 35)           2 with value (4 48)
% 2.13/2.33  ;    65 with value (4 26)         12 with value (4 36)
% 2.13/2.33  Evaluation took:
% 2.13/2.33    1.841 seconds of real time
% 2.13/2.33    1.776855 seconds of user run time
% 2.13/2.33    0.063218 seconds of system run time
% 2.13/2.33    [Run times include 0.058 seconds GC run time.]
% 2.13/2.33    0 calls to %EVAL
% 2.13/2.33    0 page faults and
% 2.13/2.33    153,077,696 bytes consed.
% 2.13/2.33  :PROOF-FOUND
% 2.13/2.33  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T08:28:56
% 2.13/2.33  :PROOF-FOUND
% 2.13/2.33  * 
%------------------------------------------------------------------------------