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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.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:39:23 EDT 2022

% Result   : Unsatisfiable 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   4 RR)
%            Number of literals    :   17 (  16 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   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   :   23 (   0 sgn)

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

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

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

cnf(identity,axiom,
    identity = divide(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

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

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

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

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

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

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

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

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

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

cnf(22,plain,
    divide(X,Y) = divide(inverse(inverse(X)),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,18,theory(equality)]),10,theory(equality)]) ).

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

cnf(31,plain,
    divide(X,inverse(Y)) = divide(Y,inverse(X)),
    inference('PARAMODULATE',[status(thm)],[10,26,theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n021.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 15:30:27 EDT 2022
% 0.13/0.34  % 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-13T15:30:27
% 0.19/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-13T15:30:27
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  #||
% 0.19/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50  % SZS output start Refutation
% See solution above
% 0.19/0.50  ||#
% 0.19/0.50  
% 0.19/0.50  ; Summary of computation:
% 0.19/0.50  ;        73 formulas have been input or derived (from 13 formulas).
% 0.19/0.50  ;        32 (44%) were retained.  Of these,
% 0.19/0.50  ;           13 (41%) were simplified or subsumed later,
% 0.19/0.50  ;           19 (59%) are still being kept.
% 0.19/0.50  ; 
% 0.19/0.50  ; Run time in seconds excluding printing time:
% 0.19/0.50  ;     0.002   6%   Read assertion file          (1 call)
% 0.19/0.50  ;     0.000   0%   Assert                       (5 calls)
% 0.19/0.50  ;     0.005  15%   Process new row              (69 calls)
% 0.19/0.50  ;     0.000   0%   Resolution                   (24 calls)
% 0.19/0.50  ;     0.002   6%   Paramodulation               (12 calls)
% 0.19/0.50  ;     0.001   3%   Forward simplification       (66 calls)
% 0.19/0.50  ;     0.002   6%   Backward simplification      (32 calls)
% 0.19/0.50  ;     0.000   0%   Ordering                     (147 calls)
% 0.19/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.50  ;     0.021  64%   Other
% 0.19/0.50  ;     0.033        Total
% 0.19/0.50  ;     0.034        Real time
% 0.19/0.50  ; 
% 0.19/0.50  ; Term-hash-array has 94 terms in all.
% 0.19/0.50  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.50  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.50  ; Path-index has 57 entries (64 at peak, 106 added, 49 deleted).
% 0.19/0.50  ; Path-index has 184 nodes (210 at peak, 264 added, 80 deleted).
% 0.19/0.50  ; Trie-index has 57 entries (64 at peak, 106 added, 49 deleted).
% 0.19/0.50  ; Trie-index has 199 nodes (232 at peak, 386 added, 187 deleted).
% 0.19/0.50  ; Retrieved 128 generalization terms in 252 calls.
% 0.19/0.50  ; Retrieved 56 instance terms in 32 calls.
% 0.19/0.50  ; Retrieved 108 unifiable terms in 69 calls.
% 0.19/0.50  ; 
% 0.19/0.50  ; The agenda of rows to process has 4 entries:
% 0.19/0.50  ;     2 with value 15              1 with value 16               1 with value 21
% 0.19/0.50  ; The agenda of rows to give has 9 entries:
% 0.19/0.50  ;     1 with value (4 12)          1 with value (4 17)           1 with value (4 21)
% 0.19/0.50  ;     1 with value (4 14)          1 with value (4 19)           1 with value (4 24)
% 0.19/0.50  ;     2 with value (4 15)          1 with value (4 20)
% 0.19/0.50  Evaluation took:
% 0.19/0.50    0.035 seconds of real time
% 0.19/0.50    0.026652 seconds of user run time
% 0.19/0.50    0.007988 seconds of system run time
% 0.19/0.50    0 calls to %EVAL
% 0.19/0.50    0 page faults and
% 0.19/0.50    2,714,736 bytes consed.
% 0.19/0.50  :PROOF-FOUND
% 0.19/0.50  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T15:30:27
% 0.19/0.50  :PROOF-FOUND
% 0.19/0.50  * 
%------------------------------------------------------------------------------