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

View Problem - Process Solution

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

% Computer : n024.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:08 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  13 unt;   0 nHn;   3 RR)
%            Number of literals    :   15 (  14 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
%            Number of variables   :   30 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ld(X,mult(X,Y)) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

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

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

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

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

cnf(9,plain,
    rd(mult(mult(X,Y),mult(Z,X)),mult(mult(Y,Z),X)) = X,
    inference('PARAMODULATE',[status(thm)],[4,5,theory(equality)]) ).

cnf(10,plain,
    ld(X,mult(mult(X,Y),mult(Z,X))) = mult(mult(Y,Z),X),
    inference('PARAMODULATE',[status(thm)],[2,5,theory(equality)]) ).

cnf(11,plain,
    mult(mult(X,rd(Y,Z)),mult(Z,X)) = mult(X,mult(Y,X)),
    inference('PARAMODULATE',[status(thm)],[5,3,theory(equality)]) ).

cnf(37,plain,
    rd(mult(X,mult(Y,X)),mult(Z,X)) = mult(X,rd(Y,Z)),
    inference('PARAMODULATE',[status(thm)],[4,11,theory(equality)]) ).

cnf(39,plain,
    mult(X,rd(Y,Y)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,11,theory(equality)]),37,3,theory(equality)]) ).

cnf(55,plain,
    mult(rd(X,X),'SKOLEMAAAV1'(rd(X,X))) != 'SKOLEMAAAV1'(rd(X,X)),
    inference('UR-RESOLVE',[status(thm)],[6,39]) ).

cnf(56,plain,
    mult(X,Y) = mult(mult(rd(Z,Z),X),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,39,theory(equality)]),2,theory(equality)]) ).

cnf(58,plain,
    X = mult(rd(Y,Y),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,39,theory(equality)]),39,3,56,theory(equality)]) ).

cnf(60,plain,
    $false,
    inference('REWRITE',[status(thm)],[55,58,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP657+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 16:37:18 EDT 2022
% 0.13/0.33  % 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.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:37:18
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-13T16:37:18
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  #||
% 0.19/0.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.52  % SZS output start Refutation
% See solution above
% 0.19/0.52  ||#
% 0.19/0.52  
% 0.19/0.52  ; Summary of computation:
% 0.19/0.52  ;       124 formulas have been input or derived (from 13 formulas).
% 0.19/0.52  ;        60 (48%) were retained.  Of these,
% 0.19/0.52  ;            6 (10%) were simplified or subsumed later,
% 0.19/0.52  ;           54 (90%) are still being kept.
% 0.19/0.52  ; 
% 0.19/0.52  ; Run time in seconds excluding printing time:
% 0.19/0.52  ;     0.002   4%   Read assertion file          (1 call)
% 0.19/0.52  ;     0.000   0%   Assert                       (6 calls)
% 0.19/0.52  ;     0.009  16%   Process new row              (117 calls)
% 0.19/0.52  ;     0.000   0%   Resolution                   (24 calls)
% 0.19/0.52  ;     0.002   4%   Paramodulation               (12 calls)
% 0.19/0.52  ;     0.000   0%   Condensing                   (2 calls)
% 0.19/0.52  ;     0.000   0%   Forward subsumption          (2 calls)
% 0.19/0.52  ;     0.000   0%   Backward subsumption         (1 call)
% 0.19/0.52  ;     0.000   0%   Clause clause subsumption    (1 call)
% 0.19/0.52  ;     0.006  11%   Forward simplification       (117 calls)
% 0.19/0.52  ;     0.001   2%   Backward simplification      (60 calls)
% 0.19/0.52  ;     0.012  22%   Ordering                     (564 calls)
% 0.19/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.52  ;     0.023  42%   Other
% 0.19/0.52  ;     0.055        Total
% 0.19/0.52  ;     0.058        Real time
% 0.19/0.52  ; 
% 0.19/0.52  ; Term-hash-array has 256 terms in all.
% 0.19/0.52  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.19/0.52  ; Feature-vector-row-index has 7 nodes (7 at peak, 7 added, 0 deleted).
% 0.19/0.52  ;  Retrieved 1 possibly forward subsuming row in 2 calls.
% 0.19/0.52  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.19/0.52  ; Path-index has 237 entries (245 at peak, 256 added, 19 deleted).
% 0.19/0.52  ; Path-index has 1,149 nodes (1,159 at peak, 1,179 added, 30 deleted).
% 0.19/0.52  ; Trie-index has 237 entries (245 at peak, 256 added, 19 deleted).
% 0.19/0.52  ; Trie-index has 1,434 nodes (1,465 at peak, 1,540 added, 106 deleted).
% 0.19/0.52  ; Retrieved 515 generalization terms in 879 calls.
% 0.19/0.52  ; Retrieved 148 instance terms in 71 calls.
% 0.19/0.52  ; Retrieved 311 unifiable terms in 74 calls.
% 0.19/0.52  ; 
% 0.19/0.52  ; The agenda of rows to process has 6 entries:
% 0.19/0.52  ;     1 with value 26              4 with value 27               1 with value 32
% 0.19/0.52  ; The agenda of rows to give has 41 entries:
% 0.19/0.52  ;     1 with value (4 12)          1 with value (4 25)           1 with value (4 34)
% 0.19/0.52  ;     2 with value (4 13)          4 with value (4 26)           3 with value (4 35)
% 0.19/0.52  ;     1 with value (4 17)          3 with value (4 29)           1 with value (4 38)
% 0.19/0.52  ;     1 with value (4 20)          6 with value (4 30)           5 with value (4 39)
% 0.19/0.52  ;     4 with value (4 21)          4 with value (4 31)           1 with value (4 45)
% 0.19/0.52  ;     3 with value (4 22)
% 0.19/0.52  Evaluation took:
% 0.19/0.52    0.059 seconds of real time
% 0.19/0.52    0.054296 seconds of user run time
% 0.19/0.52    0.004307 seconds of system run time
% 0.19/0.52    0 calls to %EVAL
% 0.19/0.52    0 page faults and
% 0.19/0.52    3,689,448 bytes consed.
% 0.19/0.52  :PROOF-FOUND
% 0.19/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:37:18
% 0.19/0.52  :PROOF-FOUND
% 0.19/0.52  * 
%------------------------------------------------------------------------------