TSTP Solution File: BOO007-2 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : BOO007-2 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 14 23:48:53 EDT 2022

% Result   : Unsatisfiable 0.58s 0.78s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   38 (  38 unt;   0 nHn;   2 RR)
%            Number of literals    :   38 (  37 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   71 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
    add(multiply(X,Y),Z) = multiply(add(X,Z),add(Y,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity1) ).

cnf(distributivity3,axiom,
    multiply(add(X,Y),Z) = add(multiply(X,Z),multiply(Y,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity3) ).

cnf(additive_inverse1,axiom,
    add(X,inverse(X)) = multiplicative_identity,
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).

cnf(multiplicative_inverse1,axiom,
    multiply(X,inverse(X)) = additive_identity,
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_inverse1) ).

cnf(multiplicative_id1,axiom,
    multiply(X,multiplicative_identity) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).

cnf(additive_id1,axiom,
    add(X,additive_identity) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id1) ).

cnf(prove_associativity,negated_conjecture,
    multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_associativity) ).

cnf(8,plain,
    add(multiply(X,Y),Z) = add(add(multiply(X,Y),multiply(X,Z)),add(multiply(Y,Z),multiply(Z,Z))),
    inference('REWRITE',[status(thm)],[distributivity1,distributivity3,theory(equality)]) ).

cnf(11,plain,
    multiply(X,Y) = add(multiply(X,Y),multiply(additive_identity,Y)),
    inference('PARAMODULATE',[status(thm)],[distributivity3,additive_id1,theory(equality)]) ).

cnf(12,plain,
    X = add(multiply(X,Y),multiply(inverse(Y),X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[distributivity3,additive_inverse1,theory(equality)]),multiplicative_id1,theory(equality)]) ).

cnf(13,plain,
    add(multiply(X,inverse(add(X,Y))),multiply(Y,inverse(add(X,Y)))) = additive_identity,
    inference('PARAMODULATE',[status(thm)],[multiplicative_inverse1,distributivity3,theory(equality)]) ).

cnf(15,plain,
    add(multiply(X,X),Y) = add(multiply(Y,Y),X),
    inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).

cnf(17,plain,
    add(X,Y) = add(add(X,Y),add(multiply(X,Y),multiply(Y,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_id1,theory(equality)]),multiplicative_id1,theory(equality)]) ).

cnf(18,plain,
    X = add(multiply(X,Y),add(multiply(inverse(Y),X),multiply(X,X))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(25,plain,
    add(multiply(X,Y),inverse(Y)) = add(X,add(multiply(additive_identity,additive_identity),inverse(Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_inverse1,theory(equality)]),15,12,theory(equality)]) ).

cnf(31,plain,
    additive_identity = multiply(additive_identity,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(32,plain,
    add(multiply(X,Y),inverse(Y)) = add(X,inverse(Y)),
    inference('REWRITE',[status(thm)],[25,additive_id1,31,theory(equality)]) ).

cnf(34,plain,
    X = add(multiply(X,Y),multiply(X,X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,31,theory(equality)]),31,additive_id1,theory(equality)]) ).

cnf(37,plain,
    X = add(X,multiply(X,Y)),
    inference('REWRITE',[status(thm)],[18,34,theory(equality)]) ).

cnf(39,plain,
    add(X,Y) = add(add(X,Y),Y),
    inference('REWRITE',[status(thm)],[17,34,theory(equality)]) ).

cnf(50,plain,
    multiply(X,Y) = add(multiply(X,Y),multiply(multiply(X,Z),Y)),
    inference('PARAMODULATE',[status(thm)],[distributivity3,37,theory(equality)]) ).

cnf(53,plain,
    X = multiply(X,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(55,plain,
    X = multiply(inverse(inverse(X)),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(56,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,55,theory(equality)]) ).

cnf(89,plain,
    additive_identity = multiply(multiply(X,Y),inverse(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[50,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(92,plain,
    multiply(X,multiply(X,Y)) = multiply(X,Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[50,53,theory(equality)]),37,theory(equality)]) ).

cnf(98,plain,
    inverse(X) = multiply(inverse(multiply(X,Y)),inverse(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,89,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(166,plain,
    additive_identity = multiply(X,inverse(add(X,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[39,13,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(172,plain,
    additive_identity = multiply(multiply(X,Y),inverse(add(X,Z))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[50,166,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(174,plain,
    inverse(add(X,Y)) = multiply(inverse(X),inverse(add(X,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,166,theory(equality)]),additive_id1,theory(equality)]) ).

cnf(230,plain,
    inverse(X) = add(multiply(inverse(X),Y),inverse(add(X,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,174,theory(equality)]),additive_id1,multiplicative_inverse1,distributivity3,theory(equality)]) ).

cnf(280,plain,
    inverse(multiply(X,Y)) = add(inverse(X),inverse(add(inverse(X),Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[230,98,theory(equality)]),32,theory(equality)]) ).

cnf(311,plain,
    add(X,inverse(add(X,Y))) = add(X,inverse(Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[230,12,theory(equality)]),32,additive_id1,172,92,distributivity3,56,280,theory(equality)]) ).

cnf(317,plain,
    inverse(multiply(X,Y)) = add(inverse(X),inverse(Y)),
    inference('REWRITE',[status(thm)],[280,311,theory(equality)]) ).

cnf(330,plain,
    add(add(inverse(X),inverse(Y)),inverse(Z)) = add(multiply(inverse(Y),multiply(X,Z)),add(inverse(X),inverse(Z))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[230,50,theory(equality)]),additive_id1,89,distributivity3,317,theory(equality)]) ).

cnf(332,plain,
    inverse(add(inverse(X),inverse(Y))) = multiply(X,Y),
    inference('PARAMODULATE',[status(thm)],[56,317,theory(equality)]) ).

cnf(414,plain,
    add(add(inverse(X),inverse(Y)),inverse(Z)) = add(add(inverse(X),inverse(Z)),inverse(Y)),
    inference('REWRITE',[status(thm)],[330,311,56,332,theory(equality)]) ).

cnf(421,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_associativity,414,56,332,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : BOO007-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun  1 17:50:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  * 
% 0.18/0.46  * 
% 0.18/0.47  #<PACKAGE "SNARK-USER">
% 0.18/0.47  * 
% 0.18/0.47  SNARK-TPTP-OPTIONS
% 0.18/0.47  * 
% 0.18/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47   (USE-FACTORING :POS)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47  * 
% 0.18/0.47  "."
% 0.18/0.47  * 
% 0.18/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T17:50:37
% 0.18/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-01T17:50:37
% 0.18/0.48  
% 0.18/0.48  ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.18/0.48  ; Recognized commutativity assertion (= (|multiply| ?X ?Y) (|multiply| ?Y ?X)).
% 0.18/0.48  ; Recognized possible right inverse assertion (= (|add| ?X (|inverse| ?X)) |multiplicative_identity|).
% 0.18/0.48  ; Recognized possible left inverse assertion (= (|add| (|inverse| ?X) ?X) |multiplicative_identity|).
% 0.18/0.48  ; Recognized possible right inverse assertion (= (|multiply| ?X (|inverse| ?X)) |additive_identity|).
% 0.18/0.48  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |additive_identity|).
% 0.18/0.48  ; Recognized right identity assertion (= (|multiply| ?X |multiplicative_identity|) ?X).
% 0.18/0.48  ; Recognized left identity assertion (= (|multiply| |multiplicative_identity| ?X) ?X).
% 0.18/0.48  ; Recognized right identity assertion (= (|add| ?X |additive_identity|) ?X).
% 0.18/0.48  ; Recognized left identity assertion (= (|add| |additive_identity| ?X) ?X).
% 0.18/0.48  ; Declaring add to be commutative.
% 0.58/0.78  ; Declaring multiply to be commutative.
% 0.58/0.78  
% 0.58/0.78  #||
% 0.58/0.78  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.58/0.78  % SZS output start Refutation
% See solution above
% 0.58/0.78  ||#
% 0.58/0.78  
% 0.58/0.78  ; Summary of computation:
% 0.58/0.78  ;      3240 formulas have been input or derived (from 57 formulas).
% 0.58/0.78  ;       421 (13%) were retained.  Of these,
% 0.58/0.78  ;          316 (75%) were simplified or subsumed later,
% 0.58/0.78  ;          105 (25%) are still being kept.
% 0.58/0.78  ; 
% 0.58/0.78  ; Run time in seconds excluding printing time:
% 0.58/0.78  ;     0.001   0%   Read assertion file          (1 call)
% 0.58/0.78  ;     0.001   0%   Assert                       (15 calls)
% 0.58/0.78  ;     0.041  13%   Process new row              (2,869 calls)
% 0.58/0.78  ;     0.003   1%   Resolution                   (112 calls)
% 0.58/0.78  ;     0.038  12%   Paramodulation               (56 calls)
% 0.58/0.78  ;     0.157  50%   Forward simplification       (2,782 calls)
% 0.58/0.78  ;     0.032  10%   Backward simplification      (421 calls)
% 0.58/0.78  ;     0.015   5%   Ordering                     (3,143 calls)
% 0.58/0.78  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.58/0.78  ;     0.000   0%   Purity testing               (1 call)
% 0.58/0.78  ;     0.024   8%   Other
% 0.58/0.78  ;     0.312        Total
% 0.58/0.78  ;     0.316        Real time
% 0.58/0.78  ; 
% 0.58/0.78  ; Term-hash-array has 1,331 terms in all.
% 0.58/0.78  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.58/0.78  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.58/0.78  ; Path-index has 404 entries (630 at peak, 1,397 added, 993 deleted).
% 0.58/0.78  ; Path-index has 543 nodes (655 at peak, 945 added, 402 deleted).
% 0.58/0.78  ; Trie-index has 404 entries (630 at peak, 1,397 added, 993 deleted).
% 0.58/0.78  ; Trie-index has 2,859 nodes (3,238 at peak, 9,111 added, 6,252 deleted).
% 0.58/0.78  ; Retrieved 25,895 generalization terms in 21,375 calls.
% 0.58/0.78  ; Retrieved 1,955 instance terms in 429 calls.
% 0.58/0.78  ; Retrieved 3,763 unifiable terms in 359 calls.
% 0.58/0.78  ; 
% 0.58/0.78  ; The agenda of rows to process has 36 entries:
% 0.58/0.78  ;     3 with value 21              6 with value 25               2 with value 29
% 0.58/0.78  ;     6 with value 22              7 with value 26               1 with value 30
% 0.58/0.78  ;     2 with value 23              1 with value 27               1 with value 31
% 0.58/0.78  ;     5 with value 24              2 with value 28
% 0.58/0.78  ; The agenda of input rows to give has 1 entry:
% 0.58/0.78  ;     1 with value 27
% 0.58/0.78  ; The agenda of rows to give has 91 entries:
% 0.58/0.78  ;     4 with value (4 20)          1 with value (4 31)           2 with value (4 44)
% 0.58/0.78  ;     1 with value (4 21)          7 with value (4 32)           5 with value (4 45)
% 0.58/0.78  ;     6 with value (4 22)          5 with value (4 33)           4 with value (4 46)
% 0.58/0.78  ;     2 with value (4 23)          3 with value (4 34)           1 with value (4 48)
% 0.58/0.78  ;     2 with value (4 24)          1 with value (4 35)           1 with value (4 49)
% 0.58/0.78  ;     3 with value (4 25)          3 with value (4 36)           2 with value (4 50)
% 0.58/0.78  ;     2 with value (4 26)          6 with value (4 37)           1 with value (4 51)
% 0.58/0.78  ;     3 with value (4 27)          4 with value (4 38)           1 with value (4 53)
% 0.58/0.78  ;     4 with value (4 28)          1 with value (4 39)           2 with value (4 57)
% 0.58/0.78  ;     5 with value (4 29)          2 with value (4 42)           1 with value (4 59)
% 0.58/0.78  ;     3 with value (4 30)          2 with value (4 43)           1 with value (4 62)
% 0.58/0.78  Evaluation took:
% 0.58/0.78    0.317 seconds of real time
% 0.58/0.78    0.29418 seconds of user run time
% 0.58/0.78    0.022218 seconds of system run time
% 0.58/0.78    [Run times include 0.011 seconds GC run time.]
% 0.58/0.78    0 calls to %EVAL
% 0.58/0.78    0 page faults and
% 0.58/0.78    32,713,008 bytes consed.
% 0.58/0.78  :PROOF-FOUND
% 0.58/0.78  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T17:50:38
% 0.58/0.78  :PROOF-FOUND
% 0.58/0.78  * 
%------------------------------------------------------------------------------