TSTP Solution File: GRP596-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP596-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n018.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 : Sat Jul 16 11:39:35 EDT 2022

% Result   : Unsatisfiable 0.45s 0.63s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   38 (  38 unt;   0 nHn;   3 RR)
%            Number of literals    :   38 (  37 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  107 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(Z,Y)))))) = Z,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(multiply,axiom,
    multiply(X,Y) = inverse(double_divide(Y,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

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

cnf(4,plain,
    inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
    inference('REWRITE',[status(thm)],[prove_these_axioms_4,multiply,theory(equality)]) ).

cnf(5,plain,
    inverse(double_divide(double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))),Z)) = X,
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

cnf(6,plain,
    inverse(double_divide(double_divide(X,inverse(double_divide(Y,inverse(double_divide(Z,U))))),inverse(double_divide(X,Z)))) = double_divide(Y,U),
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

cnf(8,plain,
    inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))) = double_divide(double_divide(Z,U),inverse(double_divide(Y,U))),
    inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).

cnf(15,plain,
    double_divide(double_divide(inverse(double_divide(X,Y)),Z),inverse(double_divide(Y,Z))) = X,
    inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).

cnf(16,plain,
    double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))) = double_divide(double_divide(X,U),inverse(double_divide(Z,U))),
    inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).

cnf(17,plain,
    inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))),Y)) = Z,
    inference('PARAMODULATE',[status(thm)],[5,8,theory(equality)]) ).

cnf(25,plain,
    inverse(double_divide(double_divide(double_divide(X,Y),Z),U)) = double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(U,Y)))),V),inverse(double_divide(Z,V))),
    inference('PARAMODULATE',[status(thm)],[8,single_axiom,theory(equality)]) ).

cnf(44,plain,
    inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),Z),inverse(X))) = Y,
    inference('PARAMODULATE',[status(thm)],[single_axiom,15,theory(equality)]) ).

cnf(50,plain,
    double_divide(double_divide(X,Y),inverse(double_divide(inverse(double_divide(Z,inverse(double_divide(X,U)))),Y))) = double_divide(Z,U),
    inference('PARAMODULATE',[status(thm)],[15,single_axiom,theory(equality)]) ).

cnf(87,plain,
    inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Y)))),Z)) = Z,
    inference('PARAMODULATE',[status(thm)],[17,16,theory(equality)]) ).

cnf(93,plain,
    inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))),U),Z)),U)) = Y,
    inference('PARAMODULATE',[status(thm)],[17,17,theory(equality)]) ).

cnf(110,plain,
    double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(double_divide(double_divide(inverse(double_divide(Y,Z)),V),V),U))),
    inference('PARAMODULATE',[status(thm)],[16,44,theory(equality)]) ).

cnf(112,plain,
    inverse(double_divide(double_divide(X,double_divide(double_divide(inverse(double_divide(Y,Z)),U),U)),inverse(double_divide(X,V)))) = double_divide(double_divide(V,inverse(Y)),Z),
    inference('PARAMODULATE',[status(thm)],[8,44,theory(equality)]) ).

cnf(122,plain,
    inverse(double_divide(inverse(double_divide(X,inverse(X))),Y)) = Y,
    inference('PARAMODULATE',[status(thm)],[87,15,theory(equality)]) ).

cnf(129,plain,
    inverse(double_divide(double_divide(double_divide(X,Y),Y),inverse(inverse(double_divide(Z,inverse(Z)))))) = X,
    inference('PARAMODULATE',[status(thm)],[44,122,theory(equality)]) ).

cnf(133,plain,
    double_divide(double_divide(X,Y),Y) = double_divide(double_divide(X,Z),Z),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,122,theory(equality)]),122,theory(equality)]) ).

cnf(146,plain,
    inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),inverse(X)),Z),Z)) = Y,
    inference('PARAMODULATE',[status(thm)],[44,133,theory(equality)]) ).

cnf(151,plain,
    double_divide(X,inverse(double_divide(Y,Z))) = double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),U),U),
    inference('PARAMODULATE',[status(thm)],[133,15,theory(equality)]) ).

cnf(152,plain,
    inverse(double_divide(X,inverse(double_divide(Y,inverse(X))))) = Y,
    inference('REWRITE',[status(thm)],[146,151,theory(equality)]) ).

cnf(170,plain,
    inverse(double_divide(double_divide(X,inverse(Y)),X)) = Y,
    inference('PARAMODULATE',[status(thm)],[152,152,theory(equality)]) ).

cnf(172,plain,
    X = inverse(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y)))))),
    inference('PARAMODULATE',[status(thm)],[122,152,theory(equality)]) ).

cnf(173,plain,
    double_divide(double_divide(X,Y),Y) = X,
    inference('REWRITE',[status(thm)],[129,172,theory(equality)]) ).

cnf(182,plain,
    double_divide(X,inverse(double_divide(Y,Z))) = double_divide(inverse(double_divide(X,Y)),Z),
    inference('REWRITE',[status(thm)],[151,173,theory(equality)]) ).

cnf(187,plain,
    inverse(inverse(double_divide(double_divide(X,Y),X))) = Y,
    inference('REWRITE',[status(thm)],[93,173,25,182,theory(equality)]) ).

cnf(203,plain,
    double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(inverse(double_divide(Y,Z)),U))),
    inference('REWRITE',[status(thm)],[110,173,theory(equality)]) ).

cnf(204,plain,
    double_divide(double_divide(X,inverse(Y)),inverse(double_divide(X,Z))) = double_divide(Y,Z),
    inference('REWRITE',[status(thm)],[50,203,theory(equality)]) ).

cnf(206,plain,
    inverse(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Y)) = double_divide(X,Z),
    inference('REWRITE',[status(thm)],[6,204,theory(equality)]) ).

cnf(210,plain,
    inverse(double_divide(double_divide(X,Y),Z)) = double_divide(double_divide(Z,inverse(X)),Y),
    inference('REWRITE',[status(thm)],[112,204,173,theory(equality)]) ).

cnf(215,plain,
    inverse(inverse(double_divide(double_divide(double_divide(X,Y),X),Z))) = double_divide(Z,Y),
    inference('REWRITE',[status(thm)],[206,210,theory(equality)]) ).

cnf(222,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[170,173,210,theory(equality)]) ).

cnf(234,plain,
    double_divide(double_divide(double_divide(X,Y),X),Z) = double_divide(Z,Y),
    inference('REWRITE',[status(thm)],[215,222,theory(equality)]) ).

cnf(251,plain,
    double_divide(double_divide(X,Y),X) = Y,
    inference('REWRITE',[status(thm)],[187,222,theory(equality)]) ).

cnf(252,plain,
    double_divide(X,Y) = double_divide(Y,X),
    inference('REWRITE',[status(thm)],[234,251,theory(equality)]) ).

cnf(274,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,252,theory(equality)]),theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP596-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n018.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 : Mon Jun 13 11:09:57 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-13T11:09:57
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-13T11:09:57
% 0.45/0.63  
% 0.45/0.63  
% 0.45/0.63  #||
% 0.45/0.63  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.63  % SZS output start Refutation
% See solution above
% 0.45/0.63  ||#
% 0.45/0.63  
% 0.45/0.63  ; Summary of computation:
% 0.45/0.63  ;       579 formulas have been input or derived (from 16 formulas).
% 0.45/0.63  ;       274 (47%) were retained.  Of these,
% 0.45/0.63  ;          172 (63%) were simplified or subsumed later,
% 0.45/0.63  ;          102 (37%) are still being kept.
% 0.45/0.63  ; 
% 0.45/0.63  ; Run time in seconds excluding printing time:
% 0.45/0.63  ;     0.001   1%   Read assertion file          (1 call)
% 0.45/0.63  ;     0.000   0%   Assert                       (3 calls)
% 0.45/0.63  ;     0.029  20%   Process new row              (547 calls)
% 0.45/0.63  ;     0.000   0%   Resolution                   (30 calls)
% 0.45/0.63  ;     0.013   9%   Paramodulation               (15 calls)
% 0.45/0.63  ;     0.028  19%   Forward simplification       (488 calls)
% 0.45/0.63  ;     0.027  19%   Backward simplification      (273 calls)
% 0.47/0.63  ;     0.021  14%   Ordering                     (2,040 calls)
% 0.47/0.63  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.47/0.63  ;     0.000   0%   Purity testing               (1 call)
% 0.47/0.63  ;     0.026  18%   Other
% 0.47/0.63  ;     0.145        Total
% 0.47/0.63  ;     0.149        Real time
% 0.47/0.63  ; 
% 0.47/0.63  ; Term-hash-array has 1,147 terms in all.
% 0.47/0.63  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.47/0.63  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.47/0.63  ; Path-index has 477 entries (827 at peak, 1,215 added, 738 deleted).
% 0.47/0.63  ; Path-index has 2,104 nodes (2,399 at peak, 2,634 added, 530 deleted).
% 0.47/0.63  ; Trie-index has 477 entries (827 at peak, 1,215 added, 738 deleted).
% 0.47/0.63  ; Trie-index has 2,104 nodes (4,228 at peak, 5,517 added, 3,413 deleted).
% 0.47/0.63  ; Retrieved 1,345 generalization terms in 4,374 calls.
% 0.47/0.63  ; Retrieved 2,119 instance terms in 317 calls.
% 0.47/0.63  ; Retrieved 2,204 unifiable terms in 132 calls.
% 0.47/0.63  ; 
% 0.47/0.63  ; The agenda of rows to process has 31 entries:
% 0.47/0.63  ;     3 with value 14             12 with value 25              12 with value 26
% 0.47/0.63  ;     4 with value 22
% 0.47/0.63  ; The agenda of rows to give has 95 entries:
% 0.47/0.63  ;     1 with value (4 14)          4 with value (4 26)           3 with value (4 33)
% 0.47/0.63  ;     2 with value (4 16)          6 with value (4 27)           3 with value (4 34)
% 0.47/0.63  ;     1 with value (4 20)          5 with value (4 28)           6 with value (4 35)
% 0.47/0.63  ;     1 with value (4 21)          4 with value (4 29)           6 with value (4 36)
% 0.47/0.63  ;    10 with value (4 22)          7 with value (4 30)           1 with value (4 37)
% 0.47/0.63  ;     1 with value (4 23)          8 with value (4 31)           4 with value (4 38)
% 0.47/0.63  ;     7 with value (4 24)          7 with value (4 32)           3 with value (4 39)
% 0.47/0.63  ;     5 with value (4 25)
% 0.47/0.63  Evaluation took:
% 0.47/0.63    0.149 seconds of real time
% 0.47/0.63    0.133066 seconds of user run time
% 0.47/0.63    0.016169 seconds of system run time
% 0.47/0.63    0 calls to %EVAL
% 0.47/0.63    0 page faults and
% 0.47/0.63    11,881,808 bytes consed.
% 0.47/0.63  :PROOF-FOUND
% 0.47/0.63  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T11:09:57
% 0.47/0.63  :PROOF-FOUND
% 0.47/0.63  * 
%------------------------------------------------------------------------------