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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP067-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n014.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:35:59 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   24 (  22 unt;   0 nHn;   6 RR)
%            Number of literals    :   27 (  26 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    divide(divide(divide(X,X),divide(X,divide(Y,divide(divide(identity,X),Z)))),Z) = Y,
    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,negated_conjecture,
    ( multiply(inverse(a1),a1) != identity
    | multiply(identity,a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).

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

cnf(7,plain,
    ( inverse(inverse(a2)) != a2
    | divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
    inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,identity,6,theory(equality)]) ).

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

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

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

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

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

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

cnf(21,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),inverse,19,9,theory(equality)]) ).

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

cnf(24,plain,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference('REWRITE',[status(thm)],[7,21,theory(equality)]) ).

cnf(25,plain,
    divide(X,identity) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,inverse,theory(equality)]),9,21,19,theory(equality)]) ).

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

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

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

cnf(33,plain,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
    inference('REWRITE',[status(thm)],[24,31,theory(equality)]) ).

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

cnf(40,plain,
    divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
    inference('PARAMODULATE',[status(thm)],[35,21,theory(equality)]) ).

cnf(41,plain,
    $false,
    inference('REWRITE',[status(thm)],[33,40,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP067-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.14/0.33  % Computer : n014.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:51:21 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-14T00:51:22
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T00:51:22
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  #||
% 0.20/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.51  ||#
% 0.20/0.51  
% 0.20/0.51  ; Summary of computation:
% 0.20/0.51  ;       159 formulas have been input or derived (from 20 formulas).
% 0.20/0.51  ;        41 (26%) were retained.  Of these,
% 0.20/0.51  ;           24 (59%) were simplified or subsumed later,
% 0.20/0.51  ;           17 (41%) are still being kept.
% 0.20/0.51  ; 
% 0.20/0.51  ; Run time in seconds excluding printing time:
% 0.20/0.51  ;     0.001   2%   Read assertion file          (1 call)
% 0.20/0.51  ;     0.000   0%   Assert                       (5 calls)
% 0.20/0.51  ;     0.004  10%   Process new row              (137 calls)
% 0.20/0.51  ;     0.002   5%   Resolution                   (38 calls)
% 0.20/0.51  ;     0.005  12%   Paramodulation               (19 calls)
% 0.20/0.51  ;     0.000   0%   Condensing                   (2 calls)
% 0.20/0.51  ;     0.000   0%   Forward subsumption          (2 calls)
% 0.20/0.51  ;     0.001   2%   Backward subsumption         (2 calls)
% 0.20/0.51  ;     0.004  10%   Forward simplification       (123 calls)
% 0.20/0.51  ;     0.001   2%   Backward simplification      (41 calls)
% 0.20/0.51  ;     0.002   5%   Ordering                     (311 calls)
% 0.20/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.51  ;     0.021  51%   Other
% 0.20/0.51  ;     0.041        Total
% 0.20/0.51  ;     0.045        Real time
% 0.20/0.51  ; 
% 0.20/0.51  ; Term-hash-array has 156 terms in all.
% 0.20/0.51  ; Feature-vector-row-index has 0 entries (1 at peak, 2 added, 2 deleted).
% 0.20/0.51  ; Feature-vector-row-index has 1 node (26 at peak, 46 added, 45 deleted).
% 0.20/0.51  ;  Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.20/0.51  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.20/0.51  ; Path-index has 57 entries (79 at peak, 194 added, 137 deleted).
% 0.20/0.51  ; Path-index has 319 nodes (366 at peak, 557 added, 238 deleted).
% 0.20/0.51  ; Trie-index has 57 entries (79 at peak, 194 added, 137 deleted).
% 0.20/0.51  ; Trie-index has 192 nodes (321 at peak, 717 added, 525 deleted).
% 0.20/0.51  ; Retrieved 325 generalization terms in 534 calls.
% 0.20/0.51  ; Retrieved 89 instance terms in 44 calls.
% 0.20/0.51  ; Retrieved 332 unifiable terms in 138 calls.
% 0.20/0.51  ; 
% 0.20/0.51  ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.20/0.51  ;     1 with value 0
% 0.20/0.51  ; The agenda of rows to process has 21 entries:
% 0.20/0.51  ;     4 with value 20              2 with value 23               4 with value 25
% 0.20/0.51  ;     3 with value 21              3 with value 24               1 with value 26
% 0.20/0.51  ;     4 with value 22
% 0.20/0.51  ; The agenda of rows to give has 6 entries:
% 0.20/0.51  ;     2 with value (4 18)          1 with value (4 21)           2 with value (4 24)
% 0.20/0.51  ;     1 with value (4 19)
% 0.20/0.51  Evaluation took:
% 0.20/0.51    0.045 seconds of real time
% 0.20/0.51    0.038821 seconds of user run time
% 0.20/0.51    0.006666 seconds of system run time
% 0.20/0.51    0 calls to %EVAL
% 0.20/0.51    0 page faults and
% 0.20/0.51    3,947,128 bytes consed.
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:51:22
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  * 
%------------------------------------------------------------------------------