↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP513-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n008.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:13 EDT 2022

% Result   : Unsatisfiable 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   4 RR)
%            Number of literals    :   17 (  16 equ;   3 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   :   35 (   0 sgn)

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

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

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

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

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

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

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

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

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

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

cnf(30,plain,
    multiply(X,Y) = multiply(Y,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,28,theory(equality)]),29,theory(equality)]) ).

cnf(33,plain,
    multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
    inference('PARAMODULATE',[status(thm)],[prove_these_axioms_1,30,theory(equality)]) ).

cnf(36,plain,
    multiply(X,multiply(inverse(X),Y)) = Y,
    inference('PARAMODULATE',[status(thm)],[11,30,theory(equality)]) ).

cnf(52,plain,
    multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
    inference('PARAMODULATE',[status(thm)],[33,30,theory(equality)]) ).

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

cnf(65,plain,
    $false,
    inference('REWRITE',[status(thm)],[52,64,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP513-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n008.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 : Mon Jun 13 16:16:52 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-13T16:16:52
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-06-13T16:16:52
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  #||
% 0.19/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52  % SZS output start Refutation
% See solution above
% 0.19/0.52  ||#
% 0.19/0.52  
% 0.19/0.52  ; Summary of computation:
% 0.19/0.52  ;       223 formulas have been input or derived (from 19 formulas).
% 0.19/0.52  ;        65 (29%) were retained.  Of these,
% 0.19/0.52  ;           19 (29%) were simplified or subsumed later,
% 0.19/0.52  ;           46 (71%) are still being kept.
% 0.19/0.52  ; 
% 0.19/0.52  ; Run time in seconds excluding printing time:
% 0.19/0.52  ;     0.001   2%   Read assertion file          (1 call)
% 0.19/0.52  ;     0.000   0%   Assert                       (2 calls)
% 0.19/0.52  ;     0.011  22%   Process new row              (200 calls)
% 0.19/0.52  ;     0.000   0%   Resolution                   (36 calls)
% 0.19/0.52  ;     0.002   4%   Paramodulation               (18 calls)
% 0.19/0.52  ;     0.009  18%   Forward simplification       (195 calls)
% 0.19/0.52  ;     0.001   2%   Backward simplification      (65 calls)
% 0.19/0.52  ;     0.001   2%   Ordering                     (365 calls)
% 0.19/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.52  ;     0.024  49%   Other
% 0.19/0.52  ;     0.049        Total
% 0.19/0.52  ;     0.052        Real time
% 0.19/0.52  ; 
% 0.19/0.52  ; Term-hash-array has 295 terms in all.
% 0.19/0.52  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.52  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.52  ; Path-index has 164 entries (168 at peak, 300 added, 136 deleted).
% 0.19/0.52  ; Path-index has 507 nodes (510 at peak, 645 added, 138 deleted).
% 0.19/0.52  ; Trie-index has 164 entries (168 at peak, 300 added, 136 deleted).
% 0.19/0.52  ; Trie-index has 447 nodes (465 at peak, 879 added, 432 deleted).
% 0.19/0.52  ; Retrieved 520 generalization terms in 906 calls.
% 0.19/0.52  ; Retrieved 194 instance terms in 64 calls.
% 0.19/0.52  ; Retrieved 727 unifiable terms in 139 calls.
% 0.19/0.52  ; 
% 0.19/0.52  ; The agenda of rows to process has 12 entries:
% 0.19/0.52  ;     2 with value 21              1 with value 24               2 with value 27
% 0.19/0.52  ;     2 with value 22              2 with value 26               1 with value 29
% 0.19/0.52  ;     2 with value 23
% 0.19/0.52  ; The agenda of rows to give has 32 entries:
% 0.19/0.52  ;     2 with value (4 20)          4 with value (4 25)           3 with value (4 28)
% 0.19/0.52  ;     5 with value (4 21)          8 with value (4 26)           1 with value (4 29)
% 0.19/0.52  ;     2 with value (4 23)          2 with value (4 27)           2 with value (4 30)
% 0.19/0.52  ;     3 with value (4 24)
% 0.19/0.52  Evaluation took:
% 0.19/0.52    0.052 seconds of real time
% 0.19/0.52    0.036386 seconds of user run time
% 0.19/0.52    0.016026 seconds of system run time
% 0.19/0.52    0 calls to %EVAL
% 0.19/0.52    0 page faults and
% 0.19/0.52    3,799,432 bytes consed.
% 0.19/0.52  :PROOF-FOUND
% 0.19/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T16:16:52
% 0.19/0.52  :PROOF-FOUND
% 0.19/0.52  * 
%------------------------------------------------------------------------------