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

View Problem - Process Solution

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

% Computer : n025.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:38:55 EDT 2022

% Result   : Unsatisfiable 0.19s 0.53s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   19 (  19 unt;   0 nHn;   3 RR)
%            Number of literals    :   19 (  18 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   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   :   33 (   0 sgn)

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

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

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

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

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

cnf(6,plain,
    inverse(inverse(a2)) != a2,
    inference('REWRITE',[status(thm)],[prove_these_axioms_2,inverse,5,theory(equality)]) ).

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

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

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

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

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

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

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

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

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

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

cnf(47,plain,
    divide(X,divide(Y,Y)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,27,theory(equality)]),33,theory(equality)]) ).

cnf(50,plain,
    X = inverse(inverse(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,47,theory(equality)]),47,theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 03:53:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 0.19/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T03:53:09
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-14T03:53:09
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  #||
% 0.19/0.53  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.53  % SZS output start Refutation
% See solution above
% 0.19/0.53  ||#
% 0.19/0.53  
% 0.19/0.53  ; Summary of computation:
% 0.19/0.53  ;       289 formulas have been input or derived (from 20 formulas).
% 0.19/0.53  ;        55 (19%) were retained.  Of these,
% 0.19/0.53  ;           35 (64%) were simplified or subsumed later,
% 0.19/0.53  ;           20 (36%) are still being kept.
% 0.19/0.53  ; 
% 0.19/0.53  ; Run time in seconds excluding printing time:
% 0.19/0.53  ;     0.001   2%   Read assertion file          (1 call)
% 0.19/0.53  ;     0.000   0%   Assert                       (4 calls)
% 0.19/0.53  ;     0.008  17%   Process new row              (271 calls)
% 0.19/0.53  ;     0.000   0%   Resolution                   (38 calls)
% 0.19/0.53  ;     0.002   4%   Paramodulation               (19 calls)
% 0.19/0.53  ;     0.006  13%   Forward simplification       (226 calls)
% 0.19/0.53  ;     0.005  11%   Backward simplification      (55 calls)
% 0.19/0.53  ;     0.001   2%   Ordering                     (463 calls)
% 0.19/0.53  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.19/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.53  ;     0.023  49%   Other
% 0.19/0.53  ;     0.047        Total
% 0.19/0.53  ;     0.049        Real time
% 0.19/0.53  ; 
% 0.19/0.53  ; Term-hash-array has 162 terms in all.
% 0.19/0.53  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.53  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.53  ; Path-index has 74 entries (110 at peak, 185 added, 111 deleted).
% 0.19/0.53  ; Path-index has 365 nodes (393 at peak, 488 added, 123 deleted).
% 0.19/0.53  ; Trie-index has 74 entries (110 at peak, 185 added, 111 deleted).
% 0.19/0.53  ; Trie-index has 276 nodes (391 at peak, 694 added, 418 deleted).
% 0.19/0.53  ; Retrieved 268 generalization terms in 959 calls.
% 0.19/0.53  ; Retrieved 131 instance terms in 55 calls.
% 0.19/0.53  ; Retrieved 624 unifiable terms in 125 calls.
% 0.19/0.53  ; 
% 0.19/0.53  ; The agenda of rows to process has 10 entries:
% 0.19/0.53  ;     2 with value 17              4 with value 18               4 with value 19
% 0.19/0.53  ; The agenda of rows to give has 12 entries:
% 0.19/0.53  ;     1 with value (4 13)          2 with value (4 18)           2 with value (4 23)
% 0.19/0.53  ;     1 with value (4 16)          1 with value (4 20)           2 with value (4 25)
% 0.19/0.53  ;     1 with value (4 17)          2 with value (4 21)
% 0.19/0.53  Evaluation took:
% 0.19/0.53    0.05 seconds of real time
% 0.19/0.53    0.039921 seconds of user run time
% 0.19/0.53    0.009962 seconds of system run time
% 0.19/0.53    0 calls to %EVAL
% 0.19/0.53    0 page faults and
% 0.19/0.53    3,611,400 bytes consed.
% 0.19/0.53  :PROOF-FOUND
% 0.19/0.53  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T03:53:09
% 0.19/0.53  :PROOF-FOUND
% 0.19/0.53  * 
%------------------------------------------------------------------------------