TSTP Solution File: GRP710+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP710+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n004.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:40:28 EDT 2022

% Result   : Theorem 0.52s 0.71s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   22 (  21 unt;   0 nHn;   3 RR)
%            Number of literals    :   23 (  22 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   36 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    mult(X,unit) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

cnf(2,axiom,
    mult(unit,X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

cnf(3,axiom,
    mult(X,mult(Y,mult(Y,Z))) = mult(mult(mult(X,Y),Y),Z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).

cnf(4,axiom,
    mult(X,i(X)) = unit,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

cnf(5,axiom,
    mult(i(X),X) = unit,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

cnf(6,negated_conjecture,
    ( mult('SKOLEMAAAV1',X) != 'SKOLEMAAAV2'
    | mult(Y,'SKOLEMAAAV4') != 'SKOLEMAAAV3' ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(12,plain,
    mult(mult(X,X),Y) = mult(X,mult(X,Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2,3,theory(equality)]),2,theory(equality)]) ).

cnf(13,plain,
    mult(X,mult(Y,Y)) = mult(mult(X,Y),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,3,theory(equality)]),1,theory(equality)]) ).

cnf(14,plain,
    mult(X,Y) = mult(mult(mult(X,Y),Y),i(Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,4,theory(equality)]),1,theory(equality)]) ).

cnf(15,plain,
    mult(i(X),mult(X,mult(X,Y))) = mult(X,Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),2,theory(equality)]) ).

cnf(20,plain,
    mult(X,i(Y)) = mult(mult(mult(X,i(Y)),i(Y)),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),1,theory(equality)]) ).

cnf(39,plain,
    mult(mult(X,X),i(X)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,4,theory(equality)]),1,theory(equality)]) ).

cnf(60,plain,
    mult(i(X),mult(X,X)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,5,theory(equality)]),2,theory(equality)]) ).

cnf(84,plain,
    X = mult(mult(mult(X,i(Y)),i(Y)),mult(Y,Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,60,theory(equality)]),1,5,theory(equality)]) ).

cnf(109,plain,
    X = i(i(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,39,theory(equality)]),2,4,theory(equality)]) ).

cnf(122,plain,
    mult(mult(i(X),i(X)),mult(X,mult(X,Y))) = mult(i(X),mult(X,Y)),
    inference('PARAMODULATE',[status(thm)],[12,15,theory(equality)]) ).

cnf(319,plain,
    X = mult(mult(X,i(Y)),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,20,theory(equality)]),84,theory(equality)]) ).

cnf(322,plain,
    mult('SKOLEMAAAV1',X) != 'SKOLEMAAAV2',
    inference('UR-RESOLVE',[status(thm)],[6,319]) ).

cnf(338,plain,
    mult(mult(X,i(Y)),mult(Y,mult(Y,Z))) = mult(mult(X,Y),Z),
    inference('PARAMODULATE',[status(thm)],[3,319,theory(equality)]) ).

cnf(342,plain,
    X = mult(i(Y),mult(Y,X)),
    inference('REWRITE',[status(thm)],[122,2,5,338,theory(equality)]) ).

cnf(356,plain,
    X = mult(Y,mult(i(Y),X)),
    inference('PARAMODULATE',[status(thm)],[342,109,theory(equality)]) ).

cnf(379,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[322,356]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP710+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n004.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 : Mon Jun 13 20:10:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 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.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T20:10:09
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-13T20:10:09
% 0.19/0.49  
% 0.19/0.49  ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.19/0.49  ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.19/0.49  ; Recognized possible right inverse assertion (= (|mult| ?X (|i| ?X)) |unit|).
% 0.52/0.71  ; Recognized possible left inverse assertion (= (|mult| (|i| ?X) ?X) |unit|).
% 0.52/0.71  
% 0.52/0.71  #||
% 0.52/0.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.71  % SZS output start Refutation
% See solution above
% 0.52/0.71  ||#
% 0.52/0.71  
% 0.52/0.71  ; Summary of computation:
% 0.52/0.71  ;      1206 formulas have been input or derived (from 82 formulas).
% 0.52/0.71  ;       379 (31%) were retained.  Of these,
% 0.52/0.71  ;          274 (72%) were simplified or subsumed later,
% 0.52/0.71  ;          105 (28%) are still being kept.
% 0.52/0.71  ; 
% 0.52/0.71  ; Run time in seconds excluding printing time:
% 0.52/0.71  ;     0.002   1%   Read assertion file          (1 call)
% 0.52/0.71  ;     0.001   0%   Assert                       (6 calls)
% 0.52/0.71  ;     0.028  12%   Process new row              (1,130 calls)
% 0.52/0.71  ;     0.005   2%   Resolution                   (162 calls)
% 0.52/0.71  ;     0.020   8%   Paramodulation               (81 calls)
% 0.52/0.71  ;     0.008   3%   Condensing                   (418 calls)
% 0.52/0.71  ;     0.008   3%   Forward subsumption          (418 calls)
% 0.52/0.71  ;     0.009   4%   Backward subsumption         (173 calls)
% 0.52/0.71  ;     0.000   0%   Clause clause subsumption    (593 calls)
% 0.52/0.71  ;     0.063  27%   Forward simplification       (1,081 calls)
% 0.52/0.71  ;     0.019   8%   Backward simplification      (379 calls)
% 0.52/0.71  ;     0.045  19%   Ordering                     (5,925 calls)
% 0.52/0.71  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.52/0.71  ;     0.000   0%   Purity testing               (1 call)
% 0.52/0.71  ;     0.029  12%   Other
% 0.52/0.71  ;     0.237        Total
% 0.52/0.71  ;     0.239        Real time
% 0.52/0.71  ; 
% 0.52/0.71  ; Term-hash-array has 742 terms in all.
% 0.52/0.71  ; Feature-vector-row-index has 0 entries (168 at peak, 173 added, 173 deleted).
% 0.52/0.71  ; Feature-vector-row-index has 1 node (840 at peak, 887 added, 886 deleted).
% 0.52/0.71  ;  Retrieved 666 possibly forward subsuming rows in 418 calls.
% 0.52/0.71  ;  Retrieved 68 possibly backward subsumed rows in 173 calls.
% 0.52/0.71  ; Path-index has 346 entries (603 at peak, 782 added, 436 deleted).
% 0.52/0.71  ; Path-index has 694 nodes (825 at peak, 903 added, 209 deleted).
% 0.52/0.71  ; Trie-index has 346 entries (603 at peak, 782 added, 436 deleted).
% 0.52/0.71  ; Trie-index has 1,492 nodes (2,727 at peak, 3,466 added, 1,974 deleted).
% 0.52/0.71  ; Retrieved 16,010 generalization terms in 6,677 calls.
% 0.52/0.71  ; Retrieved 1,353 instance terms in 295 calls.
% 0.52/0.71  ; Retrieved 5,800 unifiable terms in 652 calls.
% 0.52/0.71  ; 
% 0.52/0.71  ; The agenda of rows to process has 27 entries:
% 0.52/0.71  ;     2 with value 9               1 with value 18               2 with value 24
% 0.52/0.71  ;     1 with value 12              3 with value 19               1 with value 25
% 0.52/0.71  ;     3 with value 14              1 with value 20               1 with value 27
% 0.52/0.71  ;     2 with value 15              1 with value 21               1 with value 28
% 0.52/0.71  ;     1 with value 16              1 with value 22               1 with value 29
% 0.52/0.71  ;     2 with value 17              2 with value 23               1 with value 33
% 0.52/0.71  ; The agenda of rows to give has 80 entries:
% 0.52/0.71  ;     6 with value (4 17)         11 with value (4 25)           1 with value (4 31)
% 0.52/0.71  ;     5 with value (4 19)          5 with value (4 26)           1 with value (4 33)
% 0.52/0.71  ;     5 with value (4 20)          4 with value (4 27)           2 with value (4 34)
% 0.52/0.71  ;    13 with value (4 21)          2 with value (4 28)           2 with value (4 37)
% 0.52/0.71  ;     2 with value (4 22)          3 with value (4 29)           2 with value (4 38)
% 0.52/0.71  ;     1 with value (4 23)          7 with value (4 30)           2 with value (4 47)
% 0.52/0.71  ;     6 with value (4 24)
% 0.52/0.71  Evaluation took:
% 0.52/0.71    0.239 seconds of real time
% 0.52/0.71    0.214196 seconds of user run time
% 0.52/0.71    0.0252 seconds of system run time
% 0.52/0.71    [Run times include 0.006 seconds GC run time.]
% 0.52/0.71    0 calls to %EVAL
% 0.52/0.71    0 page faults and
% 0.52/0.71    14,959,864 bytes consed.
% 0.52/0.71  :PROOF-FOUND
% 0.52/0.72  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T20:10:09
% 0.52/0.72  :PROOF-FOUND
% 0.52/0.72  * 
%------------------------------------------------------------------------------