↑ Up

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

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

% Computer : n020.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:52 EDT 2022

% Result   : Unsatisfiable 3.99s 4.20s
% Output   : Refutation 3.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   2 RR)
%            Number of literals    :   24 (  23 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   12 (   3 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   :   93 (   0 sgn)

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

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

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

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

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

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

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

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

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

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

cnf(755,plain,
    multiply(X,multiply(Y,multiply(inverse(Y),inverse(multiply(inverse(Z),X))))) = Z,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[406,614,theory(equality)]),739,theory(equality)]) ).

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

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

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

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

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

cnf(1115,plain,
    inverse(multiply(multiply(X,multiply(inverse(X),Y)),multiply(Z,multiply(inverse(Z),inverse(U))))) = multiply(U,multiply(V,inverse(multiply(Y,V)))),
    inference('PARAMODULATE',[status(thm)],[1030,930,theory(equality)]) ).

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

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

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

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

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

cnf(4417,plain,
    multiply(inverse(X),X) = multiply(inverse(Y),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4364,1017,theory(equality)]),1017,theory(equality)]) ).

cnf(4418,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_these_axioms_1,4417,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP439-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n020.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 00:47:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.45  * 
% 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-14T00:47:20
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-14T00:47:20
% 3.99/4.20  
% 3.99/4.20  
% 3.99/4.20  #||
% 3.99/4.20  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/4.20  % SZS output start Refutation
% See solution above
% 3.99/4.20  ||#
% 3.99/4.20  
% 3.99/4.20  ; Summary of computation:
% 3.99/4.20  ;      8477 formulas have been input or derived (from 51 formulas).
% 3.99/4.20  ;      4418 (52%) were retained.  Of these,
% 3.99/4.20  ;          125 ( 3%) were simplified or subsumed later,
% 3.99/4.20  ;         4293 (97%) are still being kept.
% 3.99/4.20  ; 
% 3.99/4.20  ; Run time in seconds excluding printing time:
% 3.99/4.20  ;     0.001   0%   Read assertion file          (1 call)
% 3.99/4.20  ;     0.000   0%   Assert                       (2 calls)
% 3.99/4.20  ;     1.486  40%   Process new row              (8,159 calls)
% 3.99/4.20  ;     0.019   1%   Resolution                   (100 calls)
% 3.99/4.20  ;     0.446  12%   Paramodulation               (50 calls)
% 3.99/4.20  ;     1.382  37%   Forward simplification       (7,094 calls)
% 3.99/4.20  ;     0.318   9%   Backward simplification      (4,418 calls)
% 3.99/4.20  ;     0.028   1%   Ordering                     (16,612 calls)
% 3.99/4.20  ;     0.000   0%   Sortal reasoning             (32 calls)
% 3.99/4.20  ;     0.000   0%   Purity testing               (1 call)
% 3.99/4.20  ;     0.060   2%   Other
% 3.99/4.20  ;     3.740        Total
% 3.99/4.20  ;     3.743        Real time
% 3.99/4.20  ; 
% 3.99/4.20  ; Term-hash-array has 30,201 terms in all.
% 3.99/4.20  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.99/4.20  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.99/4.20  ; Path-index has 29,446 entries (29,453 at peak, 30,229 added, 783 deleted).
% 3.99/4.20  ; Path-index has 45,695 nodes (45,707 at peak, 45,805 added, 110 deleted).
% 3.99/4.20  ; Trie-index has 29,446 entries (29,453 at peak, 30,229 added, 783 deleted).
% 3.99/4.20  ; Trie-index has 225,476 nodes (225,490 at peak, 229,656 added, 4,180 deleted).
% 3.99/4.20  ; Retrieved 10,235 generalization terms in 134,765 calls.
% 3.99/4.20  ; Retrieved 8,945 instance terms in 4,421 calls.
% 3.99/4.20  ; Retrieved 245,451 unifiable terms in 700 calls.
% 3.99/4.20  ; 
% 3.99/4.20  ; The agenda of rows to process has 291 entries:
% 3.99/4.20  ;     7 with value 47              6 with value 57              12 with value 67
% 3.99/4.20  ;    10 with value 48              4 with value 58              12 with value 68
% 3.99/4.20  ;    16 with value 49              4 with value 59               8 with value 69
% 3.99/4.20  ;    26 with value 50             14 with value 60              14 with value 70
% 3.99/4.20  ;    30 with value 51             12 with value 61               8 with value 71
% 3.99/4.20  ;    14 with value 52              6 with value 62               6 with value 72
% 3.99/4.20  ;     4 with value 53              6 with value 63              12 with value 73
% 3.99/4.20  ;     2 with value 54              8 with value 64              10 with value 74
% 3.99/4.20  ;    10 with value 55              8 with value 65               6 with value 75
% 3.99/4.20  ;     8 with value 56              6 with value 66               2 with value 79
% 3.99/4.20  ; The agenda of rows to give has 4248 entries:
% 3.99/4.20  ;     1 with value (4 26)        109 with value (4 55)          76 with value (4 78)
% 3.99/4.20  ;     4 with value (4 33)         99 with value (4 56)          84 with value (4 79)
% 3.99/4.20  ;     1 with value (4 34)        106 with value (4 57)          58 with value (4 80)
% 3.99/4.20  ;     6 with value (4 35)         83 with value (4 58)          77 with value (4 81)
% 3.99/4.20  ;     7 with value (4 36)         74 with value (4 59)          54 with value (4 82)
% 3.99/4.20  ;     6 with value (4 37)        104 with value (4 60)          46 with value (4 83)
% 3.99/4.20  ;    10 with value (4 38)         89 with value (4 61)          35 with value (4 84)
% 3.99/4.20  ;    15 with value (4 39)         94 with value (4 62)          17 with value (4 85)
% 3.99/4.20  ;    30 with value (4 40)        114 with value (4 63)          34 with value (4 86)
% 3.99/4.20  ;    36 with value (4 41)        108 with value (4 64)          22 with value (4 87)
% 3.99/4.20  ;    38 with value (4 42)        105 with value (4 65)          25 with value (4 88)
% 3.99/4.20  ;    67 with value (4 43)         98 with value (4 66)          15 with value (4 89)
% 3.99/4.20  ;    62 with value (4 44)         94 with value (4 67)          13 with value (4 90)
% 3.99/4.20  ;    64 with value (4 45)        132 with value (4 68)          10 with value (4 91)
% 3.99/4.20  ;    64 with value (4 46)        132 with value (4 69)           5 with value (4 92)
% 3.99/4.20  ;    97 with value (4 47)        140 with value (4 70)          12 with value (4 93)
% 3.99/4.20  ;    85 with value (4 48)        138 with value (4 71)          10 with value (4 94)
% 3.99/4.20  ;    84 with value (4 49)        109 with value (4 72)           7 with value (4 95)
% 3.99/4.20  ;    94 with value (4 50)        112 with value (4 73)           5 with value (4 96)
% 3.99/4.20  ;   111 with value (4 51)        107 with value (4 74)           1 with value (4 97)
% 3.99/4.20  ;    98 with value (4 52)        111 with value (4 75)           4 with value (4 98)
% 3.99/4.20  ;   100 with value (4 53)        107 with value (4 76)           1 with value (4 99)
% 3.99/4.20  ;    91 with value (4 54)         99 with value (4 77)           2 with value (4 100)
% 3.99/4.20  Evaluation took:
% 3.99/4.20    3.744 seconds of real time
% 3.99/4.20    3.53633 seconds of user run time
% 3.99/4.20    0.207941 seconds of system run time
% 3.99/4.20    [Run times include 0.715 seconds GC run time.]
% 3.99/4.20    0 calls to %EVAL
% 3.99/4.20    0 page faults and
% 3.99/4.20    205,342,992 bytes consed.
% 3.99/4.20  :PROOF-FOUND
% 3.99/4.20  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:47:23
% 3.99/4.20  :PROOF-FOUND
% 3.99/4.20  * 
%------------------------------------------------------------------------------