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

View Problem - Process Solution

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

% Computer : n024.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:04 EDT 2022

% Result   : Unsatisfiable 1.06s 1.26s
% Output   : Refutation 1.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   41 (  41 unt;   0 nHn;   3 RR)
%            Number of literals    :   41 (  40 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   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   :  181 (   0 sgn)

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

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

cnf(prove_these_axioms_2,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).

cnf(4,plain,
    divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
    inference('REWRITE',[status(thm)],[prove_these_axioms_2,multiply,theory(equality)]) ).

cnf(5,plain,
    divide(inverse(divide(divide(divide(X,X),Y),Z)),U) = inverse(divide(divide(divide(V,V),W),divide(Z,divide(W,divide(Y,U))))),
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

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

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

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

cnf(29,plain,
    inverse(divide(divide(divide(X,X),Y),Z)) = inverse(divide(divide(divide(U,U),Y),Z)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]),single_axiom,theory(equality)]) ).

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

cnf(38,plain,
    divide(divide(X,Y),divide(Z,Y)) = divide(divide(X,U),divide(Z,U)),
    inference('PARAMODULATE',[status(thm)],[7,37,theory(equality)]) ).

cnf(48,plain,
    inverse(divide(divide(divide(X,Y),divide(Z,Y)),U)) = inverse(divide(divide(divide(V,V),divide(Z,X)),U)),
    inference('PARAMODULATE',[status(thm)],[29,38,theory(equality)]) ).

cnf(49,plain,
    inverse(divide(divide(divide(X,X),Y),divide(Z,Y))) = inverse(divide(divide(divide(U,U),V),divide(Z,V))),
    inference('PARAMODULATE',[status(thm)],[29,38,theory(equality)]) ).

cnf(52,plain,
    divide(divide(inverse(divide(divide(divide(X,X),Y),divide(Z,Y))),U),divide(V,U)) = divide(Z,V),
    inference('PARAMODULATE',[status(thm)],[7,38,theory(equality)]) ).

cnf(53,plain,
    divide(divide(divide(X,Y),divide(Z,Y)),divide(U,divide(Z,V))) = divide(divide(divide(X,V),W),divide(U,W)),
    inference('PARAMODULATE',[status(thm)],[38,38,theory(equality)]) ).

cnf(54,plain,
    divide(divide(X,Y),divide(divide(Z,U),Y)) = divide(divide(X,divide(V,U)),divide(divide(Z,W),divide(V,W))),
    inference('PARAMODULATE',[status(thm)],[38,38,theory(equality)]) ).

cnf(153,plain,
    divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),Y),divide(divide(U,U),V))))) = divide(X,V),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,49,theory(equality)]),52,theory(equality)]) ).

cnf(268,plain,
    divide(divide(inverse(divide(divide(divide(X,X),divide(Y,Z)),divide(divide(U,V),divide(Y,V)))),W),divide(X1,W)) = divide(divide(U,Z),X1),
    inference('PARAMODULATE',[status(thm)],[52,38,theory(equality)]) ).

cnf(407,plain,
    divide(divide(divide(X,Y),divide(Z,Y)),U) = divide(divide(divide(X,V),divide(Z,V)),U),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,53,theory(equality)]),268,theory(equality)]) ).

cnf(584,plain,
    divide(X,divide(divide(Y,Z),divide(U,Z))) = divide(X,divide(divide(Y,V),divide(U,V))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,407,theory(equality)]),52,theory(equality)]) ).

cnf(1050,plain,
    X = divide(Y,inverse(divide(divide(divide(Z,Z),Y),divide(divide(U,U),X)))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,153,theory(equality)]),7,theory(equality)]) ).

cnf(1051,plain,
    X = divide(X,inverse(divide(divide(divide(Y,Y),Z),divide(divide(U,U),Z)))),
    inference('PARAMODULATE',[status(thm)],[1050,38,theory(equality)]) ).

cnf(1057,plain,
    divide(X,Y) = divide(divide(X,Z),inverse(divide(divide(divide(U,U),V),divide(divide(Y,Z),V)))),
    inference('PARAMODULATE',[status(thm)],[1050,54,theory(equality)]) ).

cnf(1063,plain,
    divide(divide(inverse(X),Y),divide(Z,Y)) = inverse(divide(divide(divide(U,U),divide(divide(V,V),Z)),divide(divide(W,W),X))),
    inference('PARAMODULATE',[status(thm)],[7,1050,theory(equality)]) ).

cnf(1065,plain,
    X = divide(inverse(divide(divide(divide(Y,Y),divide(Z,Z)),divide(divide(U,U),V))),inverse(divide(V,divide(divide(W,W),X)))),
    inference('PARAMODULATE',[status(thm)],[1050,1050,theory(equality)]) ).

cnf(1078,plain,
    inverse(divide(X,Y)) = inverse(divide(divide(divide(Z,Z),inverse(divide(divide(divide(U,U),divide(V,V)),divide(divide(W,W),X)))),Y)),
    inference('PARAMODULATE',[status(thm)],[29,1050,theory(equality)]) ).

cnf(1080,plain,
    inverse(divide(divide(divide(X,X),Y),divide(Z,divide(Y,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Z))))))) = V,
    inference('PARAMODULATE',[status(thm)],[37,1050,theory(equality)]) ).

cnf(1093,plain,
    divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W) = divide(divide(divide(U,X1),divide(Y,X1)),W),
    inference('PARAMODULATE',[status(thm)],[407,1050,theory(equality)]) ).

cnf(1095,plain,
    divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Y)))))) = divide(X,divide(divide(V,X1),divide(Z,X1))),
    inference('PARAMODULATE',[status(thm)],[584,1050,theory(equality)]) ).

cnf(1116,plain,
    inverse(divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W)) = inverse(divide(divide(divide(X1,X1),divide(Y,U)),W)),
    inference('PARAMODULATE',[status(thm)],[48,1050,theory(equality)]) ).

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

cnf(1147,plain,
    divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
    inference('REWRITE',[status(thm)],[1057,1146,theory(equality)]) ).

cnf(1158,plain,
    divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Y)))))) = divide(X,divide(V,Z)),
    inference('REWRITE',[status(thm)],[1095,1147,theory(equality)]) ).

cnf(1159,plain,
    inverse(divide(divide(X,X),Y)) = Y,
    inference('REWRITE',[status(thm)],[1080,1147,1158,theory(equality)]) ).

cnf(1160,plain,
    divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W) = divide(divide(U,Y),W),
    inference('REWRITE',[status(thm)],[1093,1147,theory(equality)]) ).

cnf(1163,plain,
    inverse(divide(divide(X,Y),Z)) = inverse(divide(divide(divide(U,U),divide(Y,X)),Z)),
    inference('REWRITE',[status(thm)],[1116,1160,theory(equality)]) ).

cnf(1188,plain,
    inverse(divide(X,Y)) = inverse(divide(divide(X,divide(Z,Z)),Y)),
    inference('REWRITE',[status(thm)],[1078,1159,1163,theory(equality)]) ).

cnf(1192,plain,
    X = divide(divide(divide(Y,Y),Z),inverse(divide(Z,divide(divide(U,U),X)))),
    inference('REWRITE',[status(thm)],[1065,1159,1163,theory(equality)]) ).

cnf(1224,plain,
    divide(inverse(X),Y) = inverse(divide(Y,divide(divide(Z,Z),X))),
    inference('REWRITE',[status(thm)],[1063,1188,1163,1147,theory(equality)]) ).

cnf(1225,plain,
    X = divide(divide(Y,Y),inverse(X)),
    inference('REWRITE',[status(thm)],[1192,1147,1224,theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP479-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n024.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 : Tue Jun 14 09:24:33 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-14T09:24:33
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-14T09:24:33
% 1.06/1.26  
% 1.06/1.26  
% 1.06/1.26  #||
% 1.06/1.26  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.06/1.26  % SZS output start Refutation
% See solution above
% 1.06/1.26  ||#
% 1.06/1.26  
% 1.06/1.26  ; Summary of computation:
% 1.06/1.26  ;      4592 formulas have been input or derived (from 28 formulas).
% 1.06/1.26  ;      1241 (27%) were retained.  Of these,
% 1.06/1.26  ;         1067 (86%) were simplified or subsumed later,
% 1.06/1.26  ;          174 (14%) are still being kept.
% 1.06/1.26  ; 
% 1.06/1.26  ; Run time in seconds excluding printing time:
% 1.06/1.26  ;     0.001   0%   Read assertion file          (1 call)
% 1.06/1.26  ;     0.000   0%   Assert                       (3 calls)
% 1.06/1.26  ;     0.206  26%   Process new row              (3,460 calls)
% 1.06/1.26  ;     0.003   0%   Resolution                   (54 calls)
% 1.06/1.26  ;     0.091  11%   Paramodulation               (27 calls)
% 1.06/1.26  ;     0.293  37%   Forward simplification       (3,256 calls)
% 1.06/1.26  ;     0.151  19%   Backward simplification      (1,240 calls)
% 1.06/1.26  ;     0.014   2%   Ordering                     (6,464 calls)
% 1.06/1.26  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.06/1.26  ;     0.000   0%   Purity testing               (1 call)
% 1.06/1.26  ;     0.034   4%   Other
% 1.06/1.26  ;     0.793        Total
% 1.06/1.26  ;     0.797        Real time
% 1.06/1.26  ; 
% 1.06/1.26  ; Term-hash-array has 6,939 terms in all.
% 1.06/1.26  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.06/1.26  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.06/1.26  ; Path-index has 1,234 entries (6,430 at peak, 7,021 added, 5,787 deleted).
% 1.06/1.26  ; Path-index has 6,408 nodes (8,005 at peak, 8,363 added, 1,955 deleted).
% 1.06/1.26  ; Trie-index has 1,234 entries (6,430 at peak, 7,021 added, 5,787 deleted).
% 1.06/1.26  ; Trie-index has 6,116 nodes (34,682 at peak, 37,320 added, 31,204 deleted).
% 1.06/1.26  ; Retrieved 7,634 generalization terms in 30,796 calls.
% 1.06/1.28  ; Retrieved 7,374 instance terms in 1,331 calls.
% 1.06/1.28  ; Retrieved 34,960 unifiable terms in 302 calls.
% 1.06/1.28  ; 
% 1.06/1.28  ; The agenda of backward simplifiable rows to process has 939 entries:
% 1.06/1.28  ;   939 with value 0
% 1.06/1.28  ; The agenda of rows to process has 172 entries:
% 1.06/1.28  ;    19 with value 40             32 with value 45               1 with value 50
% 1.06/1.28  ;     7 with value 41              7 with value 46               2 with value 51
% 1.06/1.28  ;     3 with value 42             18 with value 47               2 with value 52
% 1.06/1.28  ;    19 with value 43             22 with value 48               2 with value 53
% 1.06/1.28  ;    20 with value 44             16 with value 49               2 with value 57
% 1.06/1.28  ; The agenda of rows to give has 166 entries:
% 1.06/1.28  ;     1 with value (4 19)          5 with value (4 34)           5 with value (4 46)
% 1.06/1.28  ;     1 with value (4 20)          4 with value (4 35)          13 with value (4 47)
% 1.06/1.28  ;     1 with value (4 22)          5 with value (4 37)          11 with value (4 48)
% 1.06/1.28  ;     1 with value (4 24)          9 with value (4 38)          11 with value (4 50)
% 1.06/1.28  ;     3 with value (4 25)         14 with value (4 39)           4 with value (4 51)
% 1.06/1.28  ;     4 with value (4 26)          4 with value (4 40)           8 with value (4 52)
% 1.06/1.28  ;     2 with value (4 28)          6 with value (4 41)           3 with value (4 55)
% 1.06/1.28  ;     4 with value (4 30)         11 with value (4 42)           2 with value (4 56)
% 1.06/1.28  ;     2 with value (4 31)         16 with value (4 43)           1 with value (4 58)
% 1.06/1.28  ;     2 with value (4 32)          8 with value (4 44)           1 with value (4 59)
% 1.06/1.28  ;     3 with value (4 33)          1 with value (4 45)
% 1.06/1.28  Evaluation took:
% 1.06/1.28    0.819 seconds of real time
% 1.06/1.28    0.77597 seconds of user run time
% 1.06/1.28    0.04283 seconds of system run time
% 1.06/1.28    [Run times include 0.073 seconds GC run time.]
% 1.06/1.28    0 calls to %EVAL
% 1.06/1.28    0 page faults and
% 1.06/1.28    62,799,304 bytes consed.
% 1.06/1.28  :PROOF-FOUND
% 1.06/1.28  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T09:24:34
% 1.06/1.28  :PROOF-FOUND
% 1.06/1.28  * 
%------------------------------------------------------------------------------