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

View Problem - Process Solution

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

% Computer : n016.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:17 EDT 2022

% Result   : Unsatisfiable 0.18s 0.51s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   3 RR)
%            Number of literals    :   24 (  23 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   :   45 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    divide(X,divide(divide(X,Y),divide(Z,Y))) = Z,
    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_4,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(37,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[10,35,theory(equality)]) ).

cnf(38,plain,
    divide(X,divide(Y,Y)) = X,
    inference('REWRITE',[status(thm)],[16,37,theory(equality)]) ).

cnf(43,plain,
    divide(X,divide(X,Y)) = Y,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]),38,theory(equality)]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP528-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.00/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n016.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 06:31:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46  * 
% 0.18/0.46  * 
% 0.18/0.47  #<PACKAGE "SNARK-USER">
% 0.18/0.47  * 
% 0.18/0.47  SNARK-TPTP-OPTIONS
% 0.18/0.47  * 
% 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-14T06:31:46
% 0.18/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T06:31:46
% 0.18/0.51  
% 0.18/0.51  
% 0.18/0.51  #||
% 0.18/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.51  % SZS output start Refutation
% See solution above
% 0.18/0.52  ||#
% 0.18/0.52  
% 0.18/0.52  ; Summary of computation:
% 0.18/0.52  ;       234 formulas have been input or derived (from 18 formulas).
% 0.18/0.52  ;        55 (24%) were retained.  Of these,
% 0.18/0.52  ;           32 (58%) were simplified or subsumed later,
% 0.18/0.52  ;           23 (42%) are still being kept.
% 0.18/0.52  ; 
% 0.18/0.52  ; Run time in seconds excluding printing time:
% 0.18/0.52  ;     0.001   2%   Read assertion file          (1 call)
% 0.18/0.52  ;     0.000   0%   Assert                       (4 calls)
% 0.18/0.52  ;     0.006  14%   Process new row              (216 calls)
% 0.18/0.52  ;     0.000   0%   Resolution                   (34 calls)
% 0.18/0.52  ;     0.007  16%   Paramodulation               (17 calls)
% 0.18/0.52  ;     0.006  14%   Forward simplification       (208 calls)
% 0.18/0.52  ;     0.002   5%   Backward simplification      (55 calls)
% 0.18/0.52  ;     0.001   2%   Ordering                     (408 calls)
% 0.18/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.18/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.18/0.52  ;     0.021  48%   Other
% 0.18/0.52  ;     0.044        Total
% 0.18/0.52  ;     0.048        Real time
% 0.18/0.52  ; 
% 0.18/0.52  ; Term-hash-array has 159 terms in all.
% 0.18/0.52  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.18/0.52  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.18/0.52  ; Path-index has 62 entries (109 at peak, 172 added, 110 deleted).
% 0.18/0.52  ; Path-index has 310 nodes (412 at peak, 452 added, 142 deleted).
% 0.18/0.52  ; Trie-index has 62 entries (109 at peak, 172 added, 110 deleted).
% 0.18/0.52  ; Trie-index has 183 nodes (391 at peak, 538 added, 355 deleted).
% 0.18/0.52  ; Retrieved 344 generalization terms in 873 calls.
% 0.18/0.52  ; Retrieved 172 instance terms in 57 calls.
% 0.18/0.52  ; Retrieved 494 unifiable terms in 99 calls.
% 0.18/0.52  ; 
% 0.18/0.52  ; The agenda of rows to process has 14 entries:
% 0.18/0.52  ;     6 with value 18              8 with value 19
% 0.18/0.52  ; The agenda of rows to give has 10 entries:
% 0.18/0.52  ;     3 with value (4 16)          3 with value (4 19)           1 with value (4 20)
% 0.18/0.52  ;     3 with value (4 17)
% 0.18/0.52  Evaluation took:
% 0.18/0.52    0.048 seconds of real time
% 0.18/0.52    0.042192 seconds of user run time
% 0.18/0.52    0.005924 seconds of system run time
% 0.18/0.52    0 calls to %EVAL
% 0.18/0.52    0 page faults and
% 0.18/0.52    3,741,944 bytes consed.
% 0.18/0.52  :PROOF-FOUND
% 0.18/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T06:31:46
% 0.18/0.52  :PROOF-FOUND
% 0.18/0.52  * 
%------------------------------------------------------------------------------