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

View Problem - Process Solution

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

% Computer : n017.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:36:00 EDT 2022

% Result   : Unsatisfiable 0.18s 0.52s
% Output   : Refutation 0.18s
% 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    :    6 (   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   :   38 (   0 sgn)

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

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

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

cnf(identity,axiom,
    identity = divide(X,X),
    file('/export/starexec/sandbox2/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/sandbox2/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(X,divide(divide(inverse(Y),Z),divide(inverse(X),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(X,identity) = X,
    inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).

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

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

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

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

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

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

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

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

cnf(33,plain,
    divide(X,Y) = inverse(divide(Y,X)),
    inference('PARAMODULATE',[status(thm)],[24,32,theory(equality)]) ).

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

cnf(36,plain,
    X = divide(divide(X,divide(Y,Z)),divide(Z,Y)),
    inference('PARAMODULATE',[status(thm)],[32,33,theory(equality)]) ).

cnf(47,plain,
    divide(X,divide(divide(Y,divide(inverse(Z),X)),Z)) = inverse(Y),
    inference('PARAMODULATE',[status(thm)],[22,17,theory(equality)]) ).

cnf(55,plain,
    divide(X,divide(Y,Z)) = divide(divide(X,inverse(Z)),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47,36,theory(equality)]),33,theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP069-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 02:51:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46  * 
% 0.18/0.46  * 
% 0.18/0.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 0.18/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47   (USE-FACTORING :POS)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47  * 
% 0.18/0.47  "."
% 0.18/0.47  * 
% 0.18/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:51:53
% 0.18/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-14T02:51:53
% 0.18/0.52  
% 0.18/0.52  
% 0.18/0.52  #||
% 0.18/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.52  % SZS output start Refutation
% See solution above
% 0.18/0.53  ||#
% 0.18/0.53  
% 0.18/0.53  ; Summary of computation:
% 0.18/0.53  ;       374 formulas have been input or derived (from 29 formulas).
% 0.18/0.53  ;        56 (15%) were retained.  Of these,
% 0.18/0.53  ;           36 (64%) were simplified or subsumed later,
% 0.18/0.53  ;           20 (36%) are still being kept.
% 0.18/0.53  ; 
% 0.18/0.53  ; Run time in seconds excluding printing time:
% 0.18/0.53  ;     0.002   4%   Read assertion file          (1 call)
% 0.18/0.53  ;     0.000   0%   Assert                       (5 calls)
% 0.18/0.53  ;     0.009  16%   Process new row              (354 calls)
% 0.18/0.53  ;     0.001   2%   Resolution                   (56 calls)
% 0.18/0.53  ;     0.008  14%   Paramodulation               (28 calls)
% 0.18/0.53  ;     0.000   0%   Condensing                   (2 calls)
% 0.18/0.53  ;     0.000   0%   Forward subsumption          (2 calls)
% 0.18/0.53  ;     0.000   0%   Backward subsumption         (2 calls)
% 0.18/0.53  ;     0.002   4%   Forward simplification       (286 calls)
% 0.18/0.53  ;     0.005   9%   Backward simplification      (56 calls)
% 0.18/0.53  ;     0.004   7%   Ordering                     (611 calls)
% 0.18/0.53  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.18/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.18/0.53  ;     0.024  43%   Other
% 0.18/0.53  ;     0.056        Total
% 0.18/0.53  ;     0.060        Real time
% 0.18/0.53  ; 
% 0.18/0.53  ; Term-hash-array has 213 terms in all.
% 0.18/0.53  ; Feature-vector-row-index has 0 entries (1 at peak, 2 added, 2 deleted).
% 0.18/0.53  ; Feature-vector-row-index has 1 node (26 at peak, 46 added, 45 deleted).
% 0.18/0.53  ;  Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.18/0.53  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.18/0.53  ; Path-index has 65 entries (126 at peak, 248 added, 183 deleted).
% 0.18/0.53  ; Path-index has 295 nodes (360 at peak, 524 added, 229 deleted).
% 0.18/0.53  ; Trie-index has 65 entries (126 at peak, 248 added, 183 deleted).
% 0.18/0.53  ; Trie-index has 222 nodes (445 at peak, 878 added, 656 deleted).
% 0.18/0.53  ; Retrieved 962 generalization terms in 1,644 calls.
% 0.18/0.53  ; Retrieved 127 instance terms in 55 calls.
% 0.18/0.53  ; Retrieved 850 unifiable terms in 209 calls.
% 0.18/0.53  ; 
% 0.18/0.53  ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.18/0.53  ;     4 with value 0
% 0.18/0.53  ; The agenda of rows to process has 14 entries:
% 0.18/0.53  ;     5 with value 26              1 with value 29               2 with value 32
% 0.18/0.53  ;     3 with value 27              1 with value 31               1 with value 33
% 0.18/0.53  ;     1 with value 28
% 0.18/0.53  ; The agenda of rows to give has 7 entries:
% 0.18/0.53  ;     1 with value (4 22)          1 with value (4 24)           1 with value (4 25)
% 0.18/0.53  ;     4 with value (4 23)
% 0.18/0.53  Evaluation took:
% 0.18/0.53    0.06 seconds of real time
% 0.18/0.53    0.051185 seconds of user run time
% 0.18/0.53    0.009141 seconds of system run time
% 0.18/0.53    0 calls to %EVAL
% 0.18/0.53    0 page faults and
% 0.18/0.53    4,614,384 bytes consed.
% 0.18/0.53  :PROOF-FOUND
% 0.18/0.53  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:51:53
% 0.18/0.53  :PROOF-FOUND
% 0.18/0.53  * 
%------------------------------------------------------------------------------