↑ Up

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

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

% Computer : n013.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:37:30 EDT 2022

% Result   : Unsatisfiable 0.77s 0.97s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   21 (  21 unt;   0 nHn;   5 RR)
%            Number of literals    :   21 (  20 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_of_multiply,axiom,
    multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply) ).

cnf(condition,hypothesis,
    multiply(X,multiply(Y,Y)) = multiply(Y,multiply(Y,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).

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

cnf(4,plain,
    multiply(multiply(multiply(a,multiply(a,a)),multiply(b,b)),multiply(multiply(a,b),b)) != multiply(multiply(multiply(a,b),multiply(b,a)),multiply(multiply(a,a),multiply(b,b))),
    inference('REWRITE',[status(thm)],[prove_this,condition,associativity_of_multiply,theory(equality)]) ).

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

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

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

cnf(10,plain,
    multiply(multiply(X,Y),Y) = multiply(Y,multiply(Y,X)),
    inference('PARAMODULATE',[status(thm)],[associativity_of_multiply,condition,theory(equality)]) ).

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

cnf(18,plain,
    multiply(multiply(multiply(multiply(a,a),a),multiply(b,b)),multiply(multiply(a,b),b)) != multiply(multiply(multiply(a,b),multiply(b,a)),multiply(multiply(a,a),multiply(b,b))),
    inference('PARAMODULATE',[status(thm)],[4,associativity_of_multiply,theory(equality)]) ).

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

cnf(43,plain,
    multiply(multiply(X,X),multiply(Y,Y)) = multiply(multiply(Y,X),multiply(X,Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condition,11,theory(equality)]),9,theory(equality)]) ).

cnf(44,plain,
    multiply(multiply(multiply(multiply(a,a),a),multiply(b,b)),multiply(multiply(a,b),b)) != multiply(multiply(multiply(a,b),multiply(b,a)),multiply(multiply(b,a),multiply(a,b))),
    inference('REWRITE',[status(thm)],[18,43,theory(equality)]) ).

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

cnf(69,plain,
    multiply(multiply(multiply(X,Y),multiply(Z,U)),V) = multiply(multiply(X,multiply(Y,Z)),multiply(U,V)),
    inference('PARAMODULATE',[status(thm)],[associativity_of_multiply,5,theory(equality)]) ).

cnf(92,plain,
    multiply(multiply(X,multiply(Y,multiply(Z,U))),V) = multiply(multiply(X,multiply(Y,Z)),multiply(U,V)),
    inference('PARAMODULATE',[status(thm)],[5,associativity_of_multiply,theory(equality)]) ).

cnf(95,plain,
    multiply(multiply(X,multiply(multiply(Y,Z),U)),V) = multiply(multiply(X,Y),multiply(multiply(Z,U),V)),
    inference('PARAMODULATE',[status(thm)],[5,associativity_of_multiply,theory(equality)]) ).

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

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

cnf(362,plain,
    multiply(multiply(multiply(X,Y),multiply(Z,U)),multiply(multiply(Y,Z),U)) = multiply(multiply(multiply(Y,Z),multiply(U,Y)),multiply(multiply(Z,U),X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,8,theory(equality)]),309,115,92,69,95,theory(equality)]) ).

cnf(363,plain,
    $false,
    inference('REWRITE',[status(thm)],[44,53,362,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n013.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 10:05:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-13T10:05:59
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-13T10:05:59
% 0.19/0.48  
% 0.77/0.97  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.77/0.97  
% 0.77/0.97  #||
% 0.77/0.97  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/0.97  % SZS output start Refutation
% See solution above
% 0.77/0.97  ||#
% 0.77/0.97  
% 0.77/0.97  ; Summary of computation:
% 0.77/0.97  ;       635 formulas have been input or derived (from 11 formulas).
% 0.77/0.97  ;       363 (57%) were retained.  Of these,
% 0.77/0.97  ;           16 ( 4%) were simplified or subsumed later,
% 0.77/0.97  ;          347 (96%) are still being kept.
% 0.77/0.97  ; 
% 0.77/0.97  ; Run time in seconds excluding printing time:
% 0.77/0.97  ;     0.001   0%   Read assertion file          (1 call)
% 0.77/0.97  ;     0.001   0%   Assert                       (3 calls)
% 0.77/0.97  ;     0.046   9%   Process new row              (630 calls)
% 0.77/0.97  ;     0.001   0%   Resolution                   (20 calls)
% 0.77/0.97  ;     0.010   2%   Paramodulation               (10 calls)
% 0.77/0.97  ;     0.140  28%   Forward simplification       (626 calls)
% 0.77/0.97  ;     0.037   7%   Backward simplification      (362 calls)
% 0.77/0.97  ;     0.234  47%   Ordering                     (27,236 calls)
% 0.77/0.97  ;     0.002   0%   Sortal reasoning             (32 calls)
% 0.77/0.97  ;     0.000   0%   Purity testing               (1 call)
% 0.77/0.97  ;     0.023   5%   Other
% 0.77/0.97  ;     0.495        Total
% 0.77/0.97  ;     0.498        Real time
% 0.77/0.97  ; 
% 0.77/0.97  ; Term-hash-array has 791 terms in all.
% 0.77/0.97  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.77/0.97  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.77/0.97  ; Path-index has 764 entries (766 at peak, 804 added, 40 deleted).
% 0.77/0.97  ; Path-index has 372 nodes (376 at peak, 402 added, 30 deleted).
% 0.77/0.97  ; Trie-index has 764 entries (766 at peak, 804 added, 40 deleted).
% 0.77/0.97  ; Trie-index has 2,598 nodes (2,635 at peak, 2,926 added, 328 deleted).
% 0.77/0.97  ; Retrieved 47,922 generalization terms in 5,492 calls.
% 0.77/0.97  ; Retrieved 10,152 instance terms in 1,033 calls.
% 0.77/0.97  ; Retrieved 2,906 unifiable terms in 86 calls.
% 0.77/0.97  ; 
% 0.77/0.97  ; The agenda of rows to process has 3 entries:
% 0.77/0.97  ;     1 with value 36              2 with value 37
% 0.77/0.97  ; The agenda of rows to give has 337 entries:
% 0.77/0.97  ;     7 with value (4 20)        106 with value (4 26)           1 with value (4 33)
% 0.77/0.97  ;    21 with value (4 21)         17 with value (4 27)          14 with value (4 34)
% 0.77/0.97  ;     5 with value (4 22)          2 with value (4 29)           6 with value (4 35)
% 0.77/0.97  ;     1 with value (4 24)         32 with value (4 30)           2 with value (4 36)
% 0.77/0.97  ;    25 with value (4 25)         93 with value (4 31)           5 with value (4 37)
% 0.77/0.97  Evaluation took:
% 0.77/0.97    0.498 seconds of real time
% 0.77/0.97    0.451785 seconds of user run time
% 0.77/0.97    0.046206 seconds of system run time
% 0.77/0.97    [Run times include 0.009 seconds GC run time.]
% 0.77/0.97    0 calls to %EVAL
% 0.77/0.97    0 page faults and
% 0.77/0.97    29,455,072 bytes consed.
% 0.77/0.97  :PROOF-FOUND
% 0.77/0.97  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:05:59
% 0.77/0.97  :PROOF-FOUND
% 0.77/0.97  * 
%------------------------------------------------------------------------------