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

View Problem - Process Solution

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

% Computer : n021.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:12 EDT 2022

% Result   : Theorem 0.39s 0.60s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  15 unt;   0 nHn;   7 RR)
%            Number of literals    :   29 (  28 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   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   :   24 (   0 sgn)

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

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

cnf(7,axiom,
    mult(X,mult(Y,Z)) = mult(rd(mult(X,Y),X),mult(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).

cnf(8,axiom,
    mult(mult(X,Y),Z) = mult(mult(X,Z),ld(Z,mult(Y,Z))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).

cnf(9,axiom,
    mult(op_c,X) = mult(X,op_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).

cnf(10,negated_conjecture,
    ( mult(op_c,mult('SKOLEMAAAV1','SKOLEMAAAV2')) != mult(mult(op_c,'SKOLEMAAAV1'),'SKOLEMAAAV2')
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult(op_c,'SKOLEMAAAV2'))
    | mult(mult('SKOLEMAAAV1','SKOLEMAAAV2'),op_c) != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(11,plain,
    ( mult(op_c,mult('SKOLEMAAAV1','SKOLEMAAAV2')) != mult(mult(op_c,'SKOLEMAAAV1'),'SKOLEMAAAV2')
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult(op_c,'SKOLEMAAAV2'))
    | mult(mult('SKOLEMAAAV1',op_c),ld(op_c,mult('SKOLEMAAAV2',op_c))) != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)) ),
    inference('REWRITE',[status(thm)],[10,8,theory(equality)]) ).

cnf(16,plain,
    ld(op_c,mult(X,op_c)) = X,
    inference('PARAMODULATE',[status(thm)],[2,9,theory(equality)]) ).

cnf(17,plain,
    ( mult(op_c,mult('SKOLEMAAAV1','SKOLEMAAAV2')) != mult(mult(op_c,'SKOLEMAAAV1'),'SKOLEMAAAV2')
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult(op_c,'SKOLEMAAAV2'))
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)) ),
    inference('REWRITE',[status(thm)],[11,16,theory(equality)]) ).

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

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

cnf(25,plain,
    mult(X,mult(op_c,Y)) = mult(mult(X,Y),op_c),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,7,theory(equality)]),22,theory(equality)]) ).

cnf(29,plain,
    mult(X,mult(Y,op_c)) = mult(op_c,mult(X,Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,9,theory(equality)]),23,theory(equality)]) ).

cnf(30,plain,
    ( mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)) != mult(mult(op_c,'SKOLEMAAAV1'),'SKOLEMAAAV2')
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult(op_c,'SKOLEMAAAV2'))
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)) ),
    inference('REWRITE',[status(thm)],[17,29,theory(equality)]) ).

cnf(45,plain,
    mult(op_c,mult(X,Y)) = mult(mult(X,op_c),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,8,theory(equality)]),16,theory(equality)]) ).

cnf(80,plain,
    ( mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c))
    | mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult(op_c,'SKOLEMAAAV2')) ),
    inference('PARAMODULATE',[status(thm)],[30,9,theory(equality)]) ).

cnf(98,plain,
    mult(X,mult(op_c,Y)) = mult(mult(X,op_c),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,25,theory(equality)]),16,theory(equality)]) ).

cnf(101,plain,
    mult(mult('SKOLEMAAAV1',op_c),'SKOLEMAAAV2') != mult('SKOLEMAAAV1',mult('SKOLEMAAAV2',op_c)),
    inference('REWRITE',[status(thm)],[80,98,theory(equality)]) ).

cnf(176,plain,
    mult(X,mult(Y,op_c)) = mult(mult(X,op_c),Y),
    inference('PARAMODULATE',[status(thm)],[29,45,theory(equality)]) ).

cnf(177,plain,
    $false,
    inference('REWRITE',[status(thm)],[101,176,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run-snark %s %d
% 0.14/0.33  % Computer : n021.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Tue Jun 14 00:50:42 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45  * 
% 0.20/0.45  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:50:42
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-14T00:50:42
% 0.20/0.47  
% 0.20/0.47  ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.39/0.60  ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.39/0.60  
% 0.39/0.60  #||
% 0.39/0.60  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60  % SZS output start Refutation
% See solution above
% 0.39/0.60  ||#
% 0.39/0.60  
% 0.39/0.60  ; Summary of computation:
% 0.39/0.60  ;       542 formulas have been input or derived (from 28 formulas).
% 0.39/0.60  ;       177 (33%) were retained.  Of these,
% 0.39/0.60  ;           15 ( 8%) were simplified or subsumed later,
% 0.39/0.60  ;          162 (92%) are still being kept.
% 0.39/0.60  ; 
% 0.39/0.60  ; Run time in seconds excluding printing time:
% 0.39/0.60  ;     0.003   2%   Read assertion file          (1 call)
% 0.39/0.60  ;     0.000   0%   Assert                       (10 calls)
% 0.39/0.60  ;     0.017  12%   Process new row              (456 calls)
% 0.39/0.60  ;     0.001   1%   Resolution                   (54 calls)
% 0.39/0.60  ;     0.012   9%   Paramodulation               (27 calls)
% 0.39/0.60  ;     0.000   0%   Condensing                   (5 calls)
% 0.39/0.60  ;     0.000   0%   Forward subsumption          (5 calls)
% 0.39/0.60  ;     0.001   1%   Backward subsumption         (5 calls)
% 0.39/0.60  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.39/0.60  ;     0.025  18%   Forward simplification       (450 calls)
% 0.39/0.60  ;     0.011   8%   Backward simplification      (176 calls)
% 0.39/0.60  ;     0.048  34%   Ordering                     (5,253 calls)
% 0.39/0.61  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.39/0.61  ;     0.000   0%   Purity testing               (1 call)
% 0.39/0.61  ;     0.023  16%   Other
% 0.39/0.61  ;     0.141        Total
% 0.39/0.61  ;     0.143        Real time
% 0.39/0.61  ; 
% 0.39/0.61  ; Term-hash-array has 501 terms in all.
% 0.39/0.61  ; Feature-vector-row-index has 0 entries (2 at peak, 5 added, 5 deleted).
% 0.39/0.61  ; Feature-vector-row-index has 1 node (29 at peak, 59 added, 58 deleted).
% 0.39/0.61  ;  Retrieved 1 possibly forward subsuming row in 5 calls.
% 0.39/0.61  ;  Retrieved 3 possibly backward subsumed rows in 5 calls.
% 0.39/0.61  ; Path-index has 473 entries (479 at peak, 545 added, 72 deleted).
% 0.39/0.61  ; Path-index has 853 nodes (857 at peak, 937 added, 84 deleted).
% 0.39/0.61  ; Trie-index has 473 entries (479 at peak, 545 added, 72 deleted).
% 0.39/0.61  ; Trie-index has 2,382 nodes (2,397 at peak, 2,607 added, 225 deleted).
% 0.39/0.61  ; Retrieved 3,483 generalization terms in 2,652 calls.
% 0.39/0.61  ; Retrieved 682 instance terms in 372 calls.
% 0.39/0.61  ; Retrieved 1,451 unifiable terms in 171 calls.
% 0.39/0.61  ; 
% 0.39/0.61  ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.39/0.61  ;     1 with value 0
% 0.39/0.61  ; The agenda of rows to process has 71 entries:
% 0.39/0.61  ;    11 with value 16             30 with value 21               8 with value 26
% 0.39/0.61  ;    10 with value 17              1 with value 22               5 with value 30
% 0.39/0.61  ;     1 with value 18              5 with value 25
% 0.39/0.61  ; The agenda of rows to give has 135 entries:
% 0.39/0.61  ;     3 with value (4 15)          2 with value (4 24)           6 with value (4 33)
% 0.39/0.61  ;    10 with value (4 16)         14 with value (4 25)           2 with value (4 34)
% 0.39/0.61  ;    16 with value (4 17)         17 with value (4 26)           3 with value (4 37)
% 0.39/0.61  ;    12 with value (4 20)          8 with value (4 29)           2 with value (4 38)
% 0.39/0.61  ;    22 with value (4 21)         18 with value (4 30)
% 0.39/0.61  Evaluation took:
% 0.39/0.61    0.144 seconds of real time
% 0.39/0.61    0.129743 seconds of user run time
% 0.39/0.61    0.01417 seconds of system run time
% 0.39/0.61    0 calls to %EVAL
% 0.39/0.61    0 page faults and
% 0.39/0.61    8,124,056 bytes consed.
% 0.39/0.61  :PROOF-FOUND
% 0.39/0.61  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:50:42
% 0.39/0.61  :PROOF-FOUND
% 0.39/0.61  * 
%------------------------------------------------------------------------------