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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP589-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:33 EDT 2022

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   12 (  12 unt;   0 nHn;   3 RR)
%            Number of literals    :   12 (  11 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   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   :   21 (   0 sgn)

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

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/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,
    double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X,inverse(Y)),inverse(double_divide(X,inverse(Z))))),U),inverse(Z))),U) = Y,
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP589-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n010.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 13:30:54 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T13:30:55
% 0.21/0.48  ; 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-13T13:30:55
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  #||
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52  % SZS output start Refutation
% See solution above
% 0.21/0.52  ||#
% 0.21/0.52  
% 0.21/0.52  ; Summary of computation:
% 0.21/0.52  ;        89 formulas have been input or derived (from 10 formulas).
% 0.21/0.52  ;        37 (42%) were retained.  Of these,
% 0.21/0.52  ;            7 (19%) were simplified or subsumed later,
% 0.21/0.52  ;           30 (81%) are still being kept.
% 0.21/0.52  ; 
% 0.21/0.52  ; Run time in seconds excluding printing time:
% 0.21/0.52  ;     0.001   3%   Read assertion file          (1 call)
% 0.21/0.52  ;     0.000   0%   Assert                       (3 calls)
% 0.21/0.52  ;     0.005  14%   Process new row              (68 calls)
% 0.21/0.52  ;     0.000   0%   Resolution                   (18 calls)
% 0.21/0.52  ;     0.002   5%   Paramodulation               (9 calls)
% 0.21/0.52  ;     0.004  11%   Forward simplification       (56 calls)
% 0.21/0.52  ;     0.001   3%   Backward simplification      (36 calls)
% 0.21/0.52  ;     0.000   0%   Ordering                     (178 calls)
% 0.21/0.52  ;     0.001   3%   Sortal reasoning             (32 calls)
% 0.21/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.52  ;     0.023  62%   Other
% 0.21/0.52  ;     0.037        Total
% 0.21/0.52  ;     0.039        Real time
% 0.21/0.52  ; 
% 0.21/0.52  ; Term-hash-array has 187 terms in all.
% 0.21/0.52  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.21/0.52  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.21/0.52  ; Path-index has 166 entries (175 at peak, 190 added, 24 deleted).
% 0.21/0.52  ; Path-index has 956 nodes (972 at peak, 1,004 added, 48 deleted).
% 0.21/0.52  ; Trie-index has 166 entries (175 at peak, 190 added, 24 deleted).
% 0.21/0.52  ; Trie-index has 1,128 nodes (1,152 at peak, 1,246 added, 118 deleted).
% 0.21/0.52  ; Retrieved 77 generalization terms in 258 calls.
% 0.21/0.52  ; Retrieved 114 instance terms in 35 calls.
% 0.21/0.52  ; Retrieved 252 unifiable terms in 80 calls.
% 0.21/0.52  ; 
% 0.21/0.52  ; The agenda of rows to process has 19 entries:
% 0.21/0.52  ;     1 with value 20              1 with value 26               1 with value 33
% 0.21/0.52  ;     1 with value 22              2 with value 27               1 with value 34
% 0.21/0.52  ;     2 with value 23              3 with value 28               1 with value 38
% 0.21/0.52  ;     3 with value 25              2 with value 30               1 with value 41
% 0.21/0.52  ; The agenda of rows to give has 22 entries:
% 0.21/0.52  ;     1 with value (4 19)          3 with value (4 26)           2 with value (4 38)
% 0.21/0.52  ;     1 with value (4 20)          1 with value (4 28)           1 with value (4 43)
% 0.21/0.52  ;     2 with value (4 21)          1 with value (4 29)           2 with value (4 44)
% 0.21/0.52  ;     1 with value (4 22)          1 with value (4 30)           1 with value (4 53)
% 0.21/0.52  ;     1 with value (4 23)          1 with value (4 33)           1 with value (4 54)
% 0.21/0.52  ;     1 with value (4 25)          1 with value (4 37)
% 0.21/0.52  Evaluation took:
% 0.21/0.52    0.039 seconds of real time
% 0.21/0.52    0.030067 seconds of user run time
% 0.21/0.52    0.009179 seconds of system run time
% 0.21/0.52    0 calls to %EVAL
% 0.21/0.52    0 page faults and
% 0.21/0.52    2,808,896 bytes consed.
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T13:30:55
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  * 
%------------------------------------------------------------------------------