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

View Problem - Process Solution

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

% Computer : n023.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:38 EDT 2022

% Result   : Unsatisfiable 0.37s 0.61s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   57 (  57 unt;   0 nHn;   4 RR)
%            Number of literals    :   57 (  56 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   11 (   3 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   :  178 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    double_divide(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),Z) = Y,
    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_2,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).

cnf(4,plain,
    inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
    inference('REWRITE',[status(thm)],[prove_these_axioms_2,multiply,theory(equality)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(53,plain,
    double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(U,double_divide(U,inverse(V))))),V)),
    inference('PARAMODULATE',[status(thm)],[31,21,theory(equality)]) ).

cnf(61,plain,
    double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),inverse(U))),double_divide(X,Z)) = double_divide(inverse(Y),double_divide(V,double_divide(V,inverse(U)))),
    inference('PARAMODULATE',[status(thm)],[31,7,theory(equality)]) ).

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

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

cnf(75,plain,
    double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(inverse(double_divide(U,inverse(V))),double_divide(inverse(double_divide(U,inverse(Y))),double_divide(W,double_divide(W,inverse(V)))))),
    inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).

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

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

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

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

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

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

cnf(106,plain,
    double_divide(inverse(X),double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(inverse(Z)),double_divide(U,double_divide(U,inverse(Y))))))) = Z,
    inference('REWRITE',[status(thm)],[38,105,theory(equality)]) ).

cnf(107,plain,
    double_divide(inverse(double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(Y),double_divide(Z,double_divide(Z,inverse(U))))))),U) = X,
    inference('REWRITE',[status(thm)],[37,105,theory(equality)]) ).

cnf(112,plain,
    double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(V,inverse(double_divide(inverse(X),double_divide(V,U)))),
    inference('REWRITE',[status(thm)],[19,105,theory(equality)]) ).

cnf(113,plain,
    double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(inverse(U),double_divide(V,double_divide(V,inverse(X)))),
    inference('REWRITE',[status(thm)],[61,105,theory(equality)]) ).

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

cnf(118,plain,
    double_divide(inverse(X),double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(X))))) = Y,
    inference('REWRITE',[status(thm)],[36,117,theory(equality)]) ).

cnf(119,plain,
    double_divide(inverse(X),double_divide(inverse(X),Y)) = Y,
    inference('REWRITE',[status(thm)],[106,118,theory(equality)]) ).

cnf(121,plain,
    double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),Z) = X,
    inference('REWRITE',[status(thm)],[107,119,theory(equality)]) ).

cnf(122,plain,
    double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),inverse(Y)),
    inference('REWRITE',[status(thm)],[53,121,theory(equality)]) ).

cnf(126,plain,
    double_divide(inverse(X),inverse(double_divide(inverse(Y),X))) = Y,
    inference('REWRITE',[status(thm)],[90,7,122,theory(equality)]) ).

cnf(133,plain,
    double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(Z),Y)) = double_divide(inverse(X),Z),
    inference('REWRITE',[status(thm)],[83,126,theory(equality)]) ).

cnf(134,plain,
    double_divide(inverse(X),double_divide(Y,inverse(double_divide(inverse(X),double_divide(Y,inverse(Z)))))) = Z,
    inference('REWRITE',[status(thm)],[14,133,theory(equality)]) ).

cnf(137,plain,
    double_divide(inverse(X),inverse(Y)) = double_divide(Z,inverse(double_divide(inverse(Y),double_divide(Z,X)))),
    inference('REWRITE',[status(thm)],[82,126,theory(equality)]) ).

cnf(138,plain,
    double_divide(inverse(X),double_divide(inverse(inverse(Y)),inverse(X))) = Y,
    inference('REWRITE',[status(thm)],[134,137,theory(equality)]) ).

cnf(140,plain,
    double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(inverse(U),inverse(X)),
    inference('REWRITE',[status(thm)],[112,137,theory(equality)]) ).

cnf(142,plain,
    double_divide(inverse(X),inverse(Y)) = double_divide(inverse(X),double_divide(Z,double_divide(Z,inverse(Y)))),
    inference('REWRITE',[status(thm)],[113,140,theory(equality)]) ).

cnf(150,plain,
    double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(Y),inverse(double_divide(X,Z))),
    inference('REWRITE',[status(thm)],[75,140,142,theory(equality)]) ).

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

cnf(176,plain,
    inverse(double_divide(X,double_divide(inverse(double_divide(Y,inverse(Z))),U))) = double_divide(inverse(Z),double_divide(X,double_divide(Y,U))),
    inference('REWRITE',[status(thm)],[42,119,174,theory(equality)]) ).

cnf(178,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[12,119,176,theory(equality)]) ).

cnf(180,plain,
    double_divide(inverse(X),double_divide(Y,inverse(X))) = Y,
    inference('REWRITE',[status(thm)],[138,178,theory(equality)]) ).

cnf(191,plain,
    double_divide(X,double_divide(X,Y)) = Y,
    inference('PARAMODULATE',[status(thm)],[119,178,theory(equality)]) ).

cnf(193,plain,
    double_divide(X,double_divide(Y,X)) = Y,
    inference('PARAMODULATE',[status(thm)],[180,178,theory(equality)]) ).

cnf(194,plain,
    double_divide(double_divide(X,Y),X) = Y,
    inference('PARAMODULATE',[status(thm)],[193,193,theory(equality)]) ).

cnf(195,plain,
    double_divide(X,Y) = double_divide(Y,X),
    inference('PARAMODULATE',[status(thm)],[194,191,theory(equality)]) ).

cnf(198,plain,
    inverse(double_divide(inverse(b2),inverse(double_divide(b2,a2)))) != a2,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,195,theory(equality)]),150,theory(equality)]) ).

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

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

cnf(210,plain,
    $false,
    inference('REWRITE',[status(thm)],[198,178,191,201,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP606-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n023.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 : Tue Jun 14 13:08:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T13:08:21
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-14T13:08:21
% 0.37/0.61  
% 0.37/0.61  
% 0.37/0.61  #||
% 0.37/0.61  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61  % SZS output start Refutation
% See solution above
% 0.37/0.62  ||#
% 0.37/0.62  
% 0.37/0.62  ; Summary of computation:
% 0.37/0.62  ;       472 formulas have been input or derived (from 23 formulas).
% 0.37/0.62  ;       210 (44%) were retained.  Of these,
% 0.37/0.62  ;          174 (83%) were simplified or subsumed later,
% 0.37/0.62  ;           36 (17%) are still being kept.
% 0.37/0.62  ; 
% 0.37/0.62  ; Run time in seconds excluding printing time:
% 0.37/0.62  ;     0.001   1%   Read assertion file          (1 call)
% 0.37/0.62  ;     0.000   0%   Assert                       (3 calls)
% 0.37/0.62  ;     0.023  16%   Process new row              (423 calls)
% 0.37/0.62  ;     0.002   1%   Resolution                   (44 calls)
% 0.37/0.62  ;     0.010   7%   Paramodulation               (22 calls)
% 0.37/0.62  ;     0.026  18%   Forward simplification       (346 calls)
% 0.37/0.62  ;     0.024  17%   Backward simplification      (209 calls)
% 0.37/0.62  ;     0.033  23%   Ordering                     (2,083 calls)
% 0.37/0.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.62  ;     0.000   0%   Purity testing               (1 call)
% 0.37/0.62  ;     0.023  16%   Other
% 0.37/0.62  ;     0.142        Total
% 0.37/0.62  ;     0.153        Real time
% 0.37/0.62  ; 
% 0.37/0.62  ; Term-hash-array has 974 terms in all.
% 0.37/0.62  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.37/0.62  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.37/0.62  ; Path-index has 197 entries (616 at peak, 1,050 added, 853 deleted).
% 0.37/0.62  ; Path-index has 1,214 nodes (1,275 at peak, 1,707 added, 493 deleted).
% 0.37/0.62  ; Trie-index has 197 entries (616 at peak, 1,050 added, 853 deleted).
% 0.37/0.62  ; Trie-index has 780 nodes (2,908 at peak, 4,836 added, 4,056 deleted).
% 0.37/0.62  ; Retrieved 1,084 generalization terms in 2,274 calls.
% 0.37/0.62  ; Retrieved 1,626 instance terms in 262 calls.
% 0.37/0.62  ; Retrieved 2,215 unifiable terms in 176 calls.
% 0.37/0.62  ; 
% 0.37/0.62  ; The agenda of backward simplifiable rows to process has 29 entries:
% 0.37/0.62  ;    29 with value 0
% 0.37/0.62  ; The agenda of rows to process has 12 entries:
% 0.37/0.62  ;     1 with value 19              3 with value 21               1 with value 24
% 0.37/0.62  ;     3 with value 20              4 with value 22
% 0.37/0.62  ; The agenda of rows to give has 27 entries:
% 0.37/0.62  ;     2 with value (4 19)          3 with value (4 27)           2 with value (4 33)
% 0.37/0.62  ;     1 with value (4 20)          2 with value (4 28)           4 with value (4 36)
% 0.37/0.62  ;     2 with value (4 22)          2 with value (4 30)           1 with value (4 37)
% 0.37/0.62  ;     1 with value (4 23)          1 with value (4 31)           1 with value (4 38)
% 0.37/0.62  ;     1 with value (4 24)          1 with value (4 32)           1 with value (4 43)
% 0.37/0.62  ;     2 with value (4 25)
% 0.37/0.62  Evaluation took:
% 0.37/0.62    0.154 seconds of real time
% 0.37/0.62    0.143373 seconds of user run time
% 0.37/0.62    0.01068 seconds of system run time
% 0.37/0.62    [Run times include 0.006 seconds GC run time.]
% 0.37/0.62    0 calls to %EVAL
% 0.37/0.62    0 page faults and
% 0.37/0.62    14,002,512 bytes consed.
% 0.37/0.62  :PROOF-FOUND
% 0.37/0.62  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T13:08:21
% 0.37/0.62  :PROOF-FOUND
% 0.37/0.62  * 
%------------------------------------------------------------------------------