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

View Problem - Process Solution

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

% Computer : n011.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:15 EDT 2022

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;   2 RR)
%            Number of literals    :   15 (  14 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn)

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

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(3,plain,
    multiply(X,multiply(multiply(inverse(Y),Z),multiply(multiply(inverse(multiply(X,U)),Y),U))) = Z,
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

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

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

cnf(6,plain,
    multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(multiply(inverse(U),V)),Y),V),
    inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).

cnf(9,plain,
    multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(multiply(inverse(multiply(inverse(U),W)),V),W)),
    inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).

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

cnf(14,plain,
    multiply(X,multiply(Y,Z)) = multiply(Y,multiply(X,Z)),
    inference('REWRITE',[status(thm)],[4,13,theory(equality)]) ).

cnf(16,plain,
    multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(V,U)),
    inference('REWRITE',[status(thm)],[9,13,theory(equality)]) ).

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

cnf(18,plain,
    multiply(X,Y) = multiply(multiply(inverse(Z),X),multiply(Z,Y)),
    inference('REWRITE',[status(thm)],[16,17,theory(equality)]) ).

cnf(19,plain,
    multiply(X,Y) = multiply(multiply(inverse(Z),Y),multiply(X,Z)),
    inference('PARAMODULATE',[status(thm)],[14,5,theory(equality)]) ).

cnf(26,plain,
    multiply(X,Y) = multiply(Y,X),
    inference('PARAMODULATE',[status(thm)],[18,19,theory(equality)]) ).

cnf(27,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_these_axioms_4,26,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP520-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun 14 13:10:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:10:19
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-14T13:10:19
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  #||
% 0.19/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  ||#
% 0.19/0.51  
% 0.19/0.51  ; Summary of computation:
% 0.19/0.51  ;        70 formulas have been input or derived (from 8 formulas).
% 0.19/0.51  ;        27 (39%) were retained.  Of these,
% 0.19/0.51  ;           11 (41%) were simplified or subsumed later,
% 0.19/0.51  ;           16 (59%) are still being kept.
% 0.19/0.51  ; 
% 0.19/0.51  ; Run time in seconds excluding printing time:
% 0.19/0.51  ;     0.000   0%   Read assertion file          (1 call)
% 0.19/0.51  ;     0.001   3%   Assert                       (2 calls)
% 0.19/0.51  ;     0.003   8%   Process new row              (57 calls)
% 0.19/0.51  ;     0.000   0%   Resolution                   (14 calls)
% 0.19/0.51  ;     0.001   3%   Paramodulation               (7 calls)
% 0.19/0.51  ;     0.001   3%   Forward simplification       (55 calls)
% 0.19/0.51  ;     0.002   6%   Backward simplification      (27 calls)
% 0.19/0.51  ;     0.005  14%   Ordering                     (209 calls)
% 0.19/0.51  ;     0.001   3%   Sortal reasoning             (32 calls)
% 0.19/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.51  ;     0.022  61%   Other
% 0.19/0.51  ;     0.036        Total
% 0.19/0.51  ;     0.037        Real time
% 0.19/0.51  ; 
% 0.19/0.51  ; Term-hash-array has 134 terms in all.
% 0.19/0.51  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.51  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.51  ; Path-index has 81 entries (89 at peak, 146 added, 65 deleted).
% 0.19/0.51  ; Path-index has 275 nodes (296 at peak, 342 added, 67 deleted).
% 0.19/0.51  ; Trie-index has 81 entries (89 at peak, 146 added, 65 deleted).
% 0.19/0.51  ; Trie-index has 282 nodes (325 at peak, 505 added, 223 deleted).
% 0.19/0.51  ; Retrieved 138 generalization terms in 281 calls.
% 0.19/0.51  ; Retrieved 129 instance terms in 30 calls.
% 0.19/0.51  ; Retrieved 263 unifiable terms in 53 calls.
% 0.19/0.51  ; 
% 0.19/0.51  ; The agenda of rows to process has 13 entries:
% 0.19/0.51  ;     1 with value 13              2 with value 24               2 with value 26
% 0.19/0.51  ;     3 with value 21              4 with value 25               1 with value 27
% 0.19/0.51  ; The agenda of rows to give has 11 entries:
% 0.19/0.51  ;     1 with value (4 13)          1 with value (4 23)           1 with value (4 26)
% 0.19/0.51  ;     1 with value (4 20)          2 with value (4 24)           1 with value (4 32)
% 0.19/0.51  ;     1 with value (4 21)          1 with value (4 25)           1 with value (4 38)
% 0.19/0.51  ;     1 with value (4 22)
% 0.19/0.51  Evaluation took:
% 0.19/0.51    0.038 seconds of real time
% 0.19/0.51    0.034379 seconds of user run time
% 0.19/0.51    0.003819 seconds of system run time
% 0.19/0.51    0 calls to %EVAL
% 0.19/0.51    0 page faults and
% 0.19/0.51    3,058,088 bytes consed.
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:10:19
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  * 
%------------------------------------------------------------------------------