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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : KLE071+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n015.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:30 EDT 2022

% Result   : Theorem 0.49s 0.69s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   5 RR)
%            Number of literals    :   20 (  19 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    multiplication(X,one) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

cnf(6,axiom,
    multiplication(one,X) = X,
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

cnf(13,axiom,
    addition(X,multiplication(domain(X),X)) = multiplication(domain(X),X),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).

cnf(15,axiom,
    domain(multiplication(X,Y)) = domain(multiplication(X,domain(Y))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).

cnf(16,axiom,
    addition(domain(X),one) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).

cnf(19,axiom,
    domain(addition(X,Y)) = addition(domain(X),domain(Y)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).

cnf(21,negated_conjecture,
    addition(domain('SKOLEMAAAV1'),multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV3'))) != multiplication(addition(domain('SKOLEMAAAV1'),domain('SKOLEMAAAV2')),addition(domain('SKOLEMAAAV1'),domain('SKOLEMAAAV3'))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(22,plain,
    addition(domain('SKOLEMAAAV1'),multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV3'))) != multiplication(domain(addition('SKOLEMAAAV1','SKOLEMAAAV2')),domain(addition('SKOLEMAAAV1','SKOLEMAAAV3'))),
    inference('REWRITE',[status(thm)],[21,19,theory(equality)]) ).

cnf(46,plain,
    domain(X) = domain(domain(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,6,theory(equality)]),6,theory(equality)]) ).

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

cnf(102,plain,
    multiplication(X,domain(addition(Y,Z))) = addition(multiplication(X,domain(Y)),multiplication(X,domain(Z))),
    inference('PARAMODULATE',[status(thm)],[7,19,theory(equality)]) ).

cnf(105,plain,
    addition(domain('SKOLEMAAAV1'),multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV3'))) != addition(multiplication(domain(addition('SKOLEMAAAV1','SKOLEMAAAV2')),domain('SKOLEMAAAV1')),multiplication(domain(addition('SKOLEMAAAV1','SKOLEMAAAV2')),domain('SKOLEMAAAV3'))),
    inference('REWRITE',[status(thm)],[22,102,theory(equality)]) ).

cnf(114,plain,
    X = addition(X,multiplication(domain(Y),X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,16,theory(equality)]),6,theory(equality)]) ).

cnf(148,plain,
    multiplication(domain(X),X) = X,
    inference('REWRITE',[status(thm)],[13,114,theory(equality)]) ).

cnf(155,plain,
    multiplication(domain(addition(X,Y)),Z) = addition(multiplication(domain(X),Z),multiplication(domain(Y),Z)),
    inference('PARAMODULATE',[status(thm)],[8,19,theory(equality)]) ).

cnf(160,plain,
    addition(domain('SKOLEMAAAV1'),multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV3'))) != addition(multiplication(domain('SKOLEMAAAV1'),domain('SKOLEMAAAV1')),addition(multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV1')),addition(multiplication(domain('SKOLEMAAAV1'),domain('SKOLEMAAAV3')),multiplication(domain('SKOLEMAAAV2'),domain('SKOLEMAAAV3'))))),
    inference('REWRITE',[status(thm)],[105,155,theory(equality)]) ).

cnf(172,plain,
    multiplication(domain(X),domain(X)) = domain(X),
    inference('PARAMODULATE',[status(thm)],[148,46,theory(equality)]) ).

cnf(173,plain,
    $false,
    inference('REWRITE',[status(thm)],[160,99,114,172,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : KLE071+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 12:42:11 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49  * 
% 0.20/0.49  * 
% 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/sandbox/benchmark/theBenchmark.p 2022-06-16T12:42:11
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-16T12:42:11
% 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  ; Declaring addition to be commutative.
% 0.49/0.69  ; Declaring addition to be associative-commutative.
% 0.49/0.69  
% 0.49/0.69  #||
% 0.49/0.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.69  % SZS output start Refutation
% See solution above
% 0.49/0.69  ||#
% 0.49/0.69  
% 0.49/0.69  ; Summary of computation:
% 0.49/0.69  ;       666 formulas have been input or derived (from 31 formulas).
% 0.49/0.69  ;       173 (26%) were retained.  Of these,
% 0.49/0.69  ;          102 (59%) were simplified or subsumed later,
% 0.49/0.69  ;           71 (41%) are still being kept.
% 0.49/0.69  ; 
% 0.49/0.69  ; Run time in seconds excluding printing time:
% 0.49/0.69  ;     0.004   2%   Read assertion file          (1 call)
% 0.49/0.69  ;     0.001   1%   Assert                       (18 calls)
% 0.49/0.69  ;     0.018   9%   Process new row              (636 calls)
% 0.49/0.69  ;     0.002   1%   Resolution                   (60 calls)
% 0.49/0.69  ;     0.013   7%   Paramodulation               (30 calls)
% 0.49/0.69  ;     0.005   3%   Embedding                    (51 calls)
% 0.49/0.69  ;     0.007   4%   Condensing                   (80 calls)
% 0.49/0.69  ;     0.004   2%   Forward subsumption          (80 calls)
% 0.49/0.69  ;     0.001   1%   Backward subsumption         (34 calls)
% 0.49/0.69  ;     0.002   1%   Clause clause subsumption    (185 calls)
% 0.49/0.69  ;     0.077  40%   Forward simplification       (574 calls)
% 0.49/0.69  ;     0.019  10%   Backward simplification      (130 calls)
% 0.49/0.69  ;     0.005   3%   Ordering                     (905 calls)
% 0.49/0.69  ;     0.008   4%   Ordering ac                  (545 calls)
% 0.49/0.69  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.49/0.69  ;     0.000   0%   Purity testing               (1 call)
% 0.49/0.69  ;     0.026  14%   Other
% 0.49/0.69  ;     0.192        Total
% 0.49/0.69  ;     0.200        Real time
% 0.49/0.69  ; 
% 0.49/0.69  ; Term-hash-array has 483 terms in all.
% 0.49/0.69  ; Feature-vector-row-index has 15 entries (27 at peak, 34 added, 19 deleted).
% 0.49/0.69  ; Feature-vector-row-index has 89 nodes (226 at peak, 308 added, 219 deleted).
% 0.49/0.69  ;  Retrieved 220 possibly forward subsuming rows in 80 calls.
% 0.49/0.69  ;  Retrieved 7 possibly backward subsumed rows in 34 calls.
% 0.49/0.69  ; Path-index has 196 entries (346 at peak, 559 added, 363 deleted).
% 0.49/0.69  ; Path-index has 344 nodes (407 at peak, 517 added, 173 deleted).
% 0.49/0.69  ; Trie-index has 196 entries (346 at peak, 559 added, 363 deleted).
% 0.49/0.69  ; Trie-index has 276 nodes (310 at peak, 413 added, 137 deleted).
% 0.49/0.69  ; Retrieved 36,389 generalization terms in 6,927 calls.
% 0.49/0.69  ; Retrieved 717 instance terms in 122 calls.
% 0.49/0.69  ; Retrieved 913 unifiable terms in 161 calls.
% 0.49/0.69  ; 
% 0.49/0.69  ; The agenda of rows to process has 4 entries:
% 0.49/0.69  ;     1 with value 16              3 with value 17
% 0.49/0.69  ; The agenda of rows to give has 43 entries:
% 0.49/0.69  ;     1 with value (4 11)          2 with value (4 18)           1 with value (4 24)
% 0.49/0.69  ;     1 with value (4 12)          2 with value (4 19)           1 with value (4 25)
% 0.49/0.69  ;     7 with value (4 13)          7 with value (4 20)           1 with value (4 26)
% 0.49/0.69  ;     1 with value (4 14)          4 with value (4 21)           6 with value (4 28)
% 0.49/0.69  ;     4 with value (4 15)          1 with value (4 23)           1 with value (4 30)
% 0.49/0.69  ;     3 with value (4 17)
% 0.49/0.69  Evaluation took:
% 0.49/0.69    0.2 seconds of real time
% 0.49/0.69    0.18694 seconds of user run time
% 0.49/0.69    0.012907 seconds of system run time
% 0.49/0.69    [Run times include 0.006 seconds GC run time.]
% 0.49/0.69    0 calls to %EVAL
% 0.49/0.69    0 page faults and
% 0.49/0.69    13,937,160 bytes consed.
% 0.49/0.69  :PROOF-FOUND
% 0.49/0.69  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T12:42:11
% 0.49/0.69  :PROOF-FOUND
% 0.49/0.69  * 
%------------------------------------------------------------------------------