↑ Up

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

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

% Computer : n006.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:40 EDT 2022

% Result   : Unsatisfiable 0.36s 0.55s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;   3 RR)
%            Number of literals    :   49 (  48 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   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   :  142 (   0 sgn)

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

cnf(multiply,axiom,
    multiply(X,Y) = inverse(double_divide(Y,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

cnf(prove_these_axioms_4,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).

cnf(4,plain,
    inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
    inference('REWRITE',[status(thm)],[prove_these_axioms_4,multiply,theory(equality)]) ).

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

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

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

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

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

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

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

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

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

cnf(42,plain,
    inverse(double_divide(X,double_divide(inverse(double_divide(inverse(double_divide(Y,Z)),X)),U))) = double_divide(Y,inverse(double_divide(Z,U))),
    inference('PARAMODULATE',[status(thm)],[5,11,theory(equality)]) ).

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

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

cnf(95,plain,
    inverse(double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(Y,Z)))),double_divide(X,U)),double_divide(U,V))) = double_divide(Y,inverse(double_divide(Z,V))),
    inference('PARAMODULATE',[status(thm)],[8,11,theory(equality)]) ).

cnf(113,plain,
    inverse(double_divide(inverse(double_divide(X,Y)),double_divide(double_divide(Z,double_divide(Z,inverse(double_divide(U,V)))),Y))) = double_divide(U,double_divide(inverse(V),X)),
    inference('PARAMODULATE',[status(thm)],[7,34,theory(equality)]) ).

cnf(122,plain,
    inverse(double_divide(X,inverse(double_divide(inverse(Y),Y)))) = X,
    inference('PARAMODULATE',[status(thm)],[69,11,theory(equality)]) ).

cnf(130,plain,
    inverse(double_divide(inverse(inverse(double_divide(inverse(X),X))),double_divide(Y,double_divide(Y,Z)))) = Z,
    inference('PARAMODULATE',[status(thm)],[34,122,theory(equality)]) ).

cnf(133,plain,
    double_divide(X,double_divide(X,Y)) = double_divide(Z,double_divide(Z,Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,122,theory(equality)]),122,theory(equality)]) ).

cnf(135,plain,
    inverse(double_divide(X,double_divide(Y,inverse(double_divide(inverse(Z),Z))))) = double_divide(inverse(double_divide(U,Y)),double_divide(U,X)),
    inference('PARAMODULATE',[status(thm)],[7,122,theory(equality)]) ).

cnf(146,plain,
    inverse(double_divide(X,double_divide(X,double_divide(inverse(Y),inverse(double_divide(Z,Y)))))) = Z,
    inference('PARAMODULATE',[status(thm)],[34,133,theory(equality)]) ).

cnf(149,plain,
    double_divide(inverse(double_divide(X,Y)),double_divide(X,inverse(double_divide(Z,double_divide(Z,U))))) = double_divide(Y,U),
    inference('PARAMODULATE',[status(thm)],[11,133,theory(equality)]) ).

cnf(150,plain,
    inverse(double_divide(X,double_divide(inverse(double_divide(Y,X)),double_divide(Z,double_divide(Z,U))))) = double_divide(Y,U),
    inference('PARAMODULATE',[status(thm)],[5,133,theory(equality)]) ).

cnf(151,plain,
    double_divide(inverse(double_divide(X,Y)),Z) = double_divide(U,double_divide(U,double_divide(X,inverse(double_divide(Y,Z))))),
    inference('PARAMODULATE',[status(thm)],[133,11,theory(equality)]) ).

cnf(152,plain,
    inverse(double_divide(inverse(double_divide(inverse(X),Y)),X)) = Y,
    inference('REWRITE',[status(thm)],[146,151,theory(equality)]) ).

cnf(170,plain,
    inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
    inference('PARAMODULATE',[status(thm)],[152,152,theory(equality)]) ).

cnf(172,plain,
    X = inverse(double_divide(inverse(inverse(double_divide(inverse(Y),Y))),X)),
    inference('PARAMODULATE',[status(thm)],[122,152,theory(equality)]) ).

cnf(173,plain,
    double_divide(X,double_divide(X,Y)) = Y,
    inference('REWRITE',[status(thm)],[130,172,theory(equality)]) ).

cnf(185,plain,
    inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(Z,U)),Y))) = double_divide(Z,double_divide(inverse(U),X)),
    inference('REWRITE',[status(thm)],[113,173,theory(equality)]) ).

cnf(186,plain,
    double_divide(inverse(double_divide(X,Y)),double_divide(inverse(Z),Y)) = double_divide(X,Z),
    inference('REWRITE',[status(thm)],[6,185,theory(equality)]) ).

cnf(188,plain,
    inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Y,double_divide(inverse(Z),X)),
    inference('REWRITE',[status(thm)],[185,186,theory(equality)]) ).

cnf(194,plain,
    inverse(inverse(double_divide(X,inverse(double_divide(Y,Z))))) = double_divide(Y,inverse(double_divide(Z,X))),
    inference('REWRITE',[status(thm)],[42,173,188,theory(equality)]) ).

cnf(213,plain,
    inverse(inverse(X)) = X,
    inference('REWRITE',[status(thm)],[170,173,188,theory(equality)]) ).

cnf(228,plain,
    double_divide(X,inverse(double_divide(Y,Z))) = double_divide(Y,inverse(double_divide(Z,X))),
    inference('REWRITE',[status(thm)],[194,213,theory(equality)]) ).

cnf(232,plain,
    inverse(double_divide(inverse(double_divide(X,Y)),inverse(double_divide(double_divide(Y,Z),Z)))) = X,
    inference('REWRITE',[status(thm)],[74,173,188,228,theory(equality)]) ).

cnf(248,plain,
    inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,U))) = double_divide(Y,U),
    inference('REWRITE',[status(thm)],[23,186,theory(equality)]) ).

cnf(251,plain,
    double_divide(inverse(double_divide(X,Y)),Z) = double_divide(X,inverse(double_divide(Y,Z))),
    inference('REWRITE',[status(thm)],[95,248,theory(equality)]) ).

cnf(253,plain,
    inverse(double_divide(inverse(X),inverse(double_divide(Y,X)))) = Y,
    inference('REWRITE',[status(thm)],[152,251,theory(equality)]) ).

cnf(276,plain,
    double_divide(inverse(double_divide(X,Y)),double_divide(X,inverse(Z))) = double_divide(Y,Z),
    inference('REWRITE',[status(thm)],[149,173,theory(equality)]) ).

cnf(287,plain,
    double_divide(X,double_divide(Y,double_divide(Z,Y))) = double_divide(Z,X),
    inference('REWRITE',[status(thm)],[150,213,188,173,theory(equality)]) ).

cnf(306,plain,
    inverse(X) = double_divide(X,inverse(double_divide(inverse(Y),Y))),
    inference('PARAMODULATE',[status(thm)],[213,122,theory(equality)]) ).

cnf(307,plain,
    inverse(double_divide(X,inverse(Y))) = double_divide(inverse(double_divide(Z,Y)),double_divide(Z,X)),
    inference('REWRITE',[status(thm)],[135,306,theory(equality)]) ).

cnf(312,plain,
    inverse(double_divide(inverse(X),inverse(Y))) = double_divide(Y,X),
    inference('REWRITE',[status(thm)],[276,307,theory(equality)]) ).

cnf(317,plain,
    double_divide(double_divide(X,Y),Y) = X,
    inference('REWRITE',[status(thm)],[253,312,theory(equality)]) ).

cnf(319,plain,
    double_divide(X,double_divide(Y,X)) = Y,
    inference('REWRITE',[status(thm)],[232,317,312,theory(equality)]) ).

cnf(320,plain,
    double_divide(X,Y) = double_divide(Y,X),
    inference('REWRITE',[status(thm)],[287,319,theory(equality)]) ).

cnf(352,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,320,theory(equality)]),theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : GRP612-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.05/0.10  % Command  : run-snark %s %d
% 0.09/0.30  % Computer : n006.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 600
% 0.09/0.30  % DateTime : Mon Jun 13 21:16:11 EDT 2022
% 0.09/0.30  % CPUTime  : 
% 0.14/0.40  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40  * 
% 0.14/0.40  * 
% 0.14/0.41  #<PACKAGE "SNARK-USER">
% 0.14/0.41  * 
% 0.14/0.41  SNARK-TPTP-OPTIONS
% 0.14/0.41  * 
% 0.14/0.41  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.41   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.41   (USE-FACTORING :POS)
% 0.14/0.41   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.41   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.41   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.41   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.41   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.41   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.41   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.41   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.41   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.41   (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.41  * 
% 0.14/0.41  "."
% 0.14/0.41  * 
% 0.14/0.41  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T21:16:11
% 0.14/0.41  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-13T21:16:11
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  #||
% 0.36/0.55  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.55  % SZS output start Refutation
% See solution above
% 0.37/0.56  ||#
% 0.37/0.56  
% 0.37/0.56  ; Summary of computation:
% 0.37/0.56  ;       693 formulas have been input or derived (from 20 formulas).
% 0.37/0.56  ;       352 (51%) were retained.  Of these,
% 0.37/0.56  ;          272 (77%) were simplified or subsumed later,
% 0.37/0.56  ;           80 (23%) are still being kept.
% 0.37/0.56  ; 
% 0.37/0.56  ; Run time in seconds excluding printing time:
% 0.37/0.56  ;     0.001   1%   Read assertion file          (1 call)
% 0.37/0.56  ;     0.000   0%   Assert                       (3 calls)
% 0.37/0.56  ;     0.037  26%   Process new row              (685 calls)
% 0.37/0.56  ;     0.000   0%   Resolution                   (38 calls)
% 0.37/0.56  ;     0.012   8%   Paramodulation               (19 calls)
% 0.37/0.56  ;     0.036  25%   Forward simplification       (624 calls)
% 0.37/0.56  ;     0.021  15%   Backward simplification      (351 calls)
% 0.37/0.56  ;     0.023  16%   Ordering                     (3,095 calls)
% 0.37/0.56  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.56  ;     0.000   0%   Purity testing               (1 call)
% 0.37/0.56  ;     0.013   9%   Other
% 0.37/0.56  ;     0.143        Total
% 0.37/0.56  ;     0.155        Real time
% 0.37/0.56  ; 
% 0.37/0.56  ; Term-hash-array has 1,609 terms in all.
% 0.37/0.56  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.37/0.56  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.37/0.56  ; Path-index has 359 entries (960 at peak, 1,760 added, 1,401 deleted).
% 0.37/0.56  ; Path-index has 2,399 nodes (2,828 at peak, 3,393 added, 994 deleted).
% 0.37/0.56  ; Trie-index has 359 entries (960 at peak, 1,760 added, 1,401 deleted).
% 0.37/0.56  ; Trie-index has 1,650 nodes (4,156 at peak, 7,285 added, 5,635 deleted).
% 0.37/0.56  ; Retrieved 2,031 generalization terms in 5,522 calls.
% 0.37/0.56  ; Retrieved 2,889 instance terms in 420 calls.
% 0.37/0.56  ; Retrieved 2,838 unifiable terms in 152 calls.
% 0.37/0.56  ; 
% 0.37/0.56  ; The agenda of rows to process has 3 entries:
% 0.37/0.56  ;     3 with value 20
% 0.37/0.56  ; The agenda of rows to give has 72 entries:
% 0.37/0.56  ;     1 with value (4 17)          3 with value (4 24)           6 with value (4 30)
% 0.37/0.56  ;     2 with value (4 18)          9 with value (4 25)           4 with value (4 31)
% 0.37/0.56  ;     1 with value (4 20)          4 with value (4 26)           2 with value (4 32)
% 0.37/0.56  ;     5 with value (4 21)          2 with value (4 27)           5 with value (4 33)
% 0.37/0.56  ;     9 with value (4 22)          7 with value (4 28)           2 with value (4 35)
% 0.37/0.56  ;     3 with value (4 23)          5 with value (4 29)           2 with value (4 36)
% 0.37/0.56  Evaluation took:
% 0.37/0.56    0.155 seconds of real time
% 0.37/0.56    0.14239 seconds of user run time
% 0.37/0.56    0.012153 seconds of system run time
% 0.37/0.56    [Run times include 0.006 seconds GC run time.]
% 0.37/0.56    0 calls to %EVAL
% 0.37/0.56    0 page faults and
% 0.37/0.56    16,100,328 bytes consed.
% 0.37/0.56  :PROOF-FOUND
% 0.37/0.56  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T21:16:12
% 0.37/0.56  :PROOF-FOUND
% 0.37/0.56  * 
%------------------------------------------------------------------------------