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

View Problem - Process Solution

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

% Computer : n020.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:31 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   27 (  27 unt;   0 nHn;   7 RR)
%            Number of literals    :   27 (  26 equ;   2 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn)

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

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

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

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

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

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

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

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

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

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

cnf(16,plain,
    double_divide(inverse(inverse(double_divide(identity,X))),inverse(identity)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,identity,theory(equality)]),inverse,theory(equality)]) ).

cnf(17,plain,
    double_divide(double_divide(inverse(X),double_divide(inverse(identity),inverse(X))),inverse(identity)) = identity,
    inference('PARAMODULATE',[status(thm)],[9,inverse,theory(equality)]) ).

cnf(22,plain,
    double_divide(inverse(inverse(inverse(identity))),inverse(identity)) = identity,
    inference('PARAMODULATE',[status(thm)],[16,inverse,theory(equality)]) ).

cnf(26,plain,
    double_divide(inverse(X),inverse(identity)) = inverse(double_divide(identity,X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]),inverse,theory(equality)]) ).

cnf(27,plain,
    inverse(double_divide(identity,inverse(double_divide(identity,X)))) = X,
    inference('REWRITE',[status(thm)],[16,26,theory(equality)]) ).

cnf(28,plain,
    inverse(double_divide(identity,inverse(inverse(identity)))) = identity,
    inference('REWRITE',[status(thm)],[22,26,theory(equality)]) ).

cnf(29,plain,
    double_divide(double_divide(inverse(identity),inverse(inverse(X))),inverse(identity)) = double_divide(identity,inverse(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,10,theory(equality)]),inverse,theory(equality)]) ).

cnf(43,plain,
    double_divide(double_divide(X,double_divide(inverse(identity),X)),inverse(identity)) = identity,
    inference('PARAMODULATE',[status(thm)],[17,27,theory(equality)]) ).

cnf(45,plain,
    inverse(double_divide(identity,X)) = double_divide(inverse(identity),double_divide(identity,X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,43,theory(equality)]),26,inverse,theory(equality)]) ).

cnf(47,plain,
    inverse(identity) = inverse(inverse(identity)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[45,identity,theory(equality)]),inverse,theory(equality)]) ).

cnf(49,plain,
    inverse(identity) = identity,
    inference('REWRITE',[status(thm)],[28,identity,47,theory(equality)]) ).

cnf(51,plain,
    inverse(double_divide(X,double_divide(identity,inverse(Y)))) = inverse(double_divide(Y,X)),
    inference('REWRITE',[status(thm)],[10,inverse,49,theory(equality)]) ).

cnf(62,plain,
    inverse(inverse(X)) = inverse(double_divide(identity,X)),
    inference('REWRITE',[status(thm)],[26,inverse,49,theory(equality)]) ).

cnf(65,plain,
    inverse(inverse(inverse(inverse(X)))) = X,
    inference('REWRITE',[status(thm)],[27,62,theory(equality)]) ).

cnf(68,plain,
    X = double_divide(identity,inverse(X)),
    inference('REWRITE',[status(thm)],[29,65,62,inverse,49,theory(equality)]) ).

cnf(70,plain,
    inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
    inference('REWRITE',[status(thm)],[51,68,theory(equality)]) ).

cnf(71,plain,
    $false,
    inference('REWRITE',[status(thm)],[7,70,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP580-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.13/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 13 20:14:35 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:14:35
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-13T20:14:35
% 0.20/0.48  
% 0.20/0.51  ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;       136 formulas have been input or derived (from 18 formulas).
% 0.20/0.52  ;        71 (52%) were retained.  Of these,
% 0.20/0.52  ;           53 (75%) were simplified or subsumed later,
% 0.20/0.52  ;           18 (25%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.001   2%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.000   0%   Assert                       (5 calls)
% 0.20/0.52  ;     0.006  13%   Process new row              (114 calls)
% 0.20/0.52  ;     0.001   2%   Resolution                   (34 calls)
% 0.20/0.52  ;     0.003   7%   Paramodulation               (17 calls)
% 0.20/0.52  ;     0.007  15%   Forward simplification       (110 calls)
% 0.20/0.52  ;     0.006  13%   Backward simplification      (71 calls)
% 0.20/0.52  ;     0.001   2%   Ordering                     (262 calls)
% 0.20/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.001   2%   Purity testing               (1 call)
% 0.20/0.52  ;     0.020  43%   Other
% 0.20/0.52  ;     0.046        Total
% 0.20/0.52  ;     0.049        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 253 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.52  ; Path-index has 67 entries (183 at peak, 304 added, 237 deleted).
% 0.20/0.52  ; Path-index has 567 nodes (648 at peak, 924 added, 357 deleted).
% 0.20/0.52  ; Trie-index has 67 entries (183 at peak, 304 added, 237 deleted).
% 0.20/0.52  ; Trie-index has 308 nodes (964 at peak, 1,539 added, 1,231 deleted).
% 0.20/0.52  ; Retrieved 209 generalization terms in 627 calls.
% 0.20/0.52  ; Retrieved 113 instance terms in 75 calls.
% 0.20/0.52  ; Retrieved 235 unifiable terms in 132 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of backward simplifiable rows to process has 17 entries:
% 0.20/0.52  ;    17 with value 0
% 0.20/0.52  ; The agenda of rows to process has 5 entries:
% 0.20/0.52  ;     2 with value 17              1 with value 24               1 with value 31
% 0.20/0.52  ;     1 with value 23
% 0.20/0.52  ; The agenda of input rows to give has 1 entry:
% 0.20/0.52  ;     1 with value 19
% 0.20/0.52  ; The agenda of rows to give has 13 entries:
% 0.20/0.52  ;     1 with value (4 9)           1 with value (4 14)           1 with value (4 21)
% 0.20/0.52  ;     1 with value (4 11)          1 with value (4 15)           2 with value (4 23)
% 0.20/0.52  ;     1 with value (4 12)          1 with value (4 17)           1 with value (4 28)
% 0.20/0.52  ;     2 with value (4 13)          1 with value (4 19)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.05 seconds of real time
% 0.20/0.52    0.043829 seconds of user run time
% 0.20/0.52    0.006141 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    4,475,568 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:14:35
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------