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

View Problem - Process Solution

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

% Computer : n010.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:39 EDT 2022

% Result   : Unsatisfiable 0.47s 0.65s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   33 (  33 unt;   0 nHn;   3 RR)
%            Number of literals    :   33 (  32 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   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   :   90 (   0 sgn)

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

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

cnf(4,plain,
    inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
    inference('REWRITE',[status(thm)],[prove_these_axioms_1,multiply,theory(equality)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(188,plain,
    inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Y,double_divide(inverse(Z),X)),
    inference('REWRITE',[status(thm)],[185,186,theory(equality)]) ).

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

cnf(243,plain,
    double_divide(inverse(double_divide(X,Y)),double_divide(X,Y)) = double_divide(inverse(double_divide(Z,U)),double_divide(Z,U)),
    inference('REWRITE',[status(thm)],[15,213,theory(equality)]) ).

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

cnf(307,plain,
    inverse(double_divide(X,inverse(Y))) = double_divide(inverse(double_divide(Z,Y)),double_divide(Z,X)),
    inference('REWRITE',[status(thm)],[135,306,theory(equality)]) ).

cnf(345,plain,
    inverse(double_divide(X,inverse(X))) = inverse(double_divide(Y,inverse(Y))),
    inference('REWRITE',[status(thm)],[243,307,theory(equality)]) ).

cnf(346,plain,
    $false,
    inference('REWRITE',[status(thm)],[4,345,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP609-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Tue Jun 14 13:15:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (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/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:15:39
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-14T13:15:39
% 0.47/0.65  
% 0.47/0.65  
% 0.47/0.65  #||
% 0.47/0.65  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65  % SZS output start Refutation
% See solution above
% 0.47/0.66  ||#
% 0.47/0.66  
% 0.47/0.66  ; Summary of computation:
% 0.47/0.66  ;       649 formulas have been input or derived (from 17 formulas).
% 0.47/0.66  ;       346 (53%) were retained.  Of these,
% 0.47/0.66  ;          259 (75%) were simplified or subsumed later,
% 0.47/0.66  ;           87 (25%) are still being kept.
% 0.47/0.66  ; 
% 0.47/0.66  ; Run time in seconds excluding printing time:
% 0.47/0.66  ;     0.001   1%   Read assertion file          (1 call)
% 0.47/0.66  ;     0.000   0%   Assert                       (3 calls)
% 0.47/0.66  ;     0.048  27%   Process new row              (632 calls)
% 0.47/0.66  ;     0.002   1%   Resolution                   (32 calls)
% 0.47/0.66  ;     0.013   7%   Paramodulation               (16 calls)
% 0.47/0.66  ;     0.025  14%   Forward simplification       (573 calls)
% 0.47/0.66  ;     0.026  15%   Backward simplification      (345 calls)
% 0.47/0.66  ;     0.033  19%   Ordering                     (2,921 calls)
% 0.47/0.66  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.47/0.66  ;     0.000   0%   Purity testing               (1 call)
% 0.47/0.66  ;     0.029  16%   Other
% 0.47/0.66  ;     0.178        Total
% 0.47/0.66  ;     0.190        Real time
% 0.47/0.66  ; 
% 0.47/0.66  ; Term-hash-array has 1,589 terms in all.
% 0.47/0.66  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.47/0.66  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.47/0.66  ; Path-index has 405 entries (962 at peak, 1,735 added, 1,330 deleted).
% 0.47/0.66  ; Path-index has 2,457 nodes (2,830 at peak, 3,397 added, 940 deleted).
% 0.47/0.66  ; Trie-index has 405 entries (962 at peak, 1,735 added, 1,330 deleted).
% 0.47/0.66  ; Trie-index has 1,821 nodes (4,164 at peak, 7,137 added, 5,316 deleted).
% 0.47/0.66  ; Retrieved 1,756 generalization terms in 5,228 calls.
% 0.47/0.66  ; Retrieved 2,858 instance terms in 412 calls.
% 0.47/0.66  ; Retrieved 2,172 unifiable terms in 139 calls.
% 0.47/0.66  ; 
% 0.47/0.66  ; The agenda of backward simplifiable rows to process has 12 entries:
% 0.47/0.66  ;    12 with value 0
% 0.47/0.66  ; The agenda of rows to process has 2 entries:
% 0.47/0.66  ;     1 with value 25              1 with value 32
% 0.47/0.66  ; The agenda of rows to give has 83 entries:
% 0.47/0.66  ;     1 with value (4 15)          3 with value (4 24)           6 with value (4 31)
% 0.47/0.66  ;     1 with value (4 16)          9 with value (4 25)           2 with value (4 32)
% 0.47/0.66  ;     2 with value (4 17)          2 with value (4 26)           3 with value (4 33)
% 0.47/0.66  ;     2 with value (4 18)          6 with value (4 27)           5 with value (4 35)
% 0.47/0.66  ;     5 with value (4 21)          7 with value (4 28)           3 with value (4 36)
% 0.47/0.66  ;     8 with value (4 22)          7 with value (4 29)           1 with value (4 38)
% 0.47/0.66  ;     3 with value (4 23)          6 with value (4 30)           1 with value (4 39)
% 0.47/0.66  Evaluation took:
% 0.47/0.66    0.19 seconds of real time
% 0.47/0.66    0.176781 seconds of user run time
% 0.47/0.66    0.013805 seconds of system run time
% 0.47/0.66    [Run times include 0.008 seconds GC run time.]
% 0.47/0.66    0 calls to %EVAL
% 0.47/0.66    0 page faults and
% 0.47/0.66    14,127,568 bytes consed.
% 0.47/0.66  :PROOF-FOUND
% 0.47/0.66  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:15:39
% 0.47/0.66  :PROOF-FOUND
% 0.47/0.66  * 
%------------------------------------------------------------------------------