↑ Up

SNARK---20120808r022.THM-Ref.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    mult(X,ld(X,Y)) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

cnf(2,axiom,
    ld(X,mult(X,Y)) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

cnf(4,axiom,
    rd(mult(X,Y),Y) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

cnf(5,axiom,
    mult(mult(X,Y),mult(Z,X)) = mult(mult(X,mult(Y,Z)),X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

cnf(6,negated_conjecture,
    ( mult('SKOLEMAAAV1'(X),X) != 'SKOLEMAAAV1'(X)
    | mult(X,'SKOLEMAAAV1'(X)) != 'SKOLEMAAAV1'(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(10,plain,
    ld(mult(X,mult(Y,Z)),mult(mult(X,Y),mult(Z,X))) = X,
    inference('PARAMODULATE',[status(thm)],[2,5,theory(equality)]) ).

cnf(12,plain,
    mult(mult(X,Y),mult(ld(Y,Z),X)) = mult(mult(X,Z),X),
    inference('PARAMODULATE',[status(thm)],[5,1,theory(equality)]) ).

cnf(35,plain,
    ld(mult(X,Y),mult(mult(X,Z),X)) = mult(ld(Y,Z),X),
    inference('PARAMODULATE',[status(thm)],[2,12,theory(equality)]) ).

cnf(36,plain,
    mult(ld(X,X),Y) = Y,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,12,theory(equality)]),35,1,theory(equality)]) ).

cnf(49,plain,
    rd(X,X) = ld(Y,Y),
    inference('PARAMODULATE',[status(thm)],[4,36,theory(equality)]) ).

cnf(51,plain,
    mult('SKOLEMAAAV1'(ld(X,X)),ld(X,X)) != 'SKOLEMAAAV1'(ld(X,X)),
    inference('UR-RESOLVE',[status(thm)],[6,36]) ).

cnf(59,plain,
    ld(X,X) = ld(Y,Y),
    inference('PARAMODULATE',[status(thm)],[49,49,theory(equality)]) ).

cnf(65,plain,
    mult(X,ld(Y,Y)) = X,
    inference('PARAMODULATE',[status(thm)],[1,59,theory(equality)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP656+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 08:45:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T08:45:54
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-14T08:45:54
% 0.20/0.53  
% 0.20/0.53  
% 0.20/0.53  #||
% 0.20/0.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53  % SZS output start Refutation
% See solution above
% 0.20/0.53  ||#
% 0.20/0.53  
% 0.20/0.53  ; Summary of computation:
% 0.20/0.53  ;       153 formulas have been input or derived (from 17 formulas).
% 0.20/0.53  ;        67 (44%) were retained.  Of these,
% 0.20/0.53  ;            8 (12%) were simplified or subsumed later,
% 0.20/0.53  ;           59 (88%) are still being kept.
% 0.20/0.53  ; 
% 0.20/0.53  ; Run time in seconds excluding printing time:
% 0.20/0.53  ;     0.001   2%   Read assertion file          (1 call)
% 0.20/0.53  ;     0.001   2%   Assert                       (6 calls)
% 0.20/0.53  ;     0.010  21%   Process new row              (141 calls)
% 0.20/0.53  ;     0.001   2%   Resolution                   (32 calls)
% 0.20/0.53  ;     0.005  10%   Paramodulation               (16 calls)
% 0.20/0.53  ;     0.000   0%   Condensing                   (1 call)
% 0.20/0.53  ;     0.000   0%   Forward subsumption          (1 call)
% 0.20/0.53  ;     0.000   0%   Backward subsumption         (1 call)
% 0.20/0.53  ;     0.002   4%   Forward simplification       (136 calls)
% 0.20/0.53  ;     0.000   0%   Backward simplification      (67 calls)
% 0.20/0.53  ;     0.004   8%   Ordering                     (353 calls)
% 0.20/0.53  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.20/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.53  ;     0.023  48%   Other
% 0.20/0.53  ;     0.048        Total
% 0.20/0.53  ;     0.051        Real time
% 0.20/0.53  ; 
% 0.20/0.53  ; Term-hash-array has 286 terms in all.
% 0.20/0.53  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.20/0.53  ; Feature-vector-row-index has 7 nodes (7 at peak, 7 added, 0 deleted).
% 0.20/0.53  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.20/0.53  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.20/0.53  ; Path-index has 265 entries (282 at peak, 286 added, 21 deleted).
% 0.20/0.53  ; Path-index has 945 nodes (965 at peak, 969 added, 24 deleted).
% 0.20/0.53  ; Trie-index has 265 entries (282 at peak, 286 added, 21 deleted).
% 0.20/0.53  ; Trie-index has 1,510 nodes (1,612 at peak, 1,637 added, 127 deleted).
% 0.20/0.53  ; Retrieved 220 generalization terms in 803 calls.
% 0.20/0.53  ; Retrieved 203 instance terms in 77 calls.
% 0.20/0.53  ; Retrieved 453 unifiable terms in 94 calls.
% 0.20/0.53  ; 
% 0.20/0.53  ; The agenda of rows to process has 9 entries:
% 0.20/0.53  ;     7 with value 15              2 with value 24
% 0.20/0.53  ; The agenda of rows to give has 43 entries:
% 0.20/0.53  ;     1 with value (4 13)          1 with value (4 23)           1 with value (4 34)
% 0.20/0.53  ;     4 with value (4 14)          2 with value (4 25)           4 with value (4 35)
% 0.20/0.53  ;     1 with value (4 15)          2 with value (4 26)           3 with value (4 38)
% 0.20/0.53  ;     1 with value (4 17)          3 with value (4 29)           3 with value (4 39)
% 0.20/0.53  ;     4 with value (4 21)          5 with value (4 30)           1 with value (4 45)
% 0.20/0.53  ;     4 with value (4 22)          2 with value (4 31)           1 with value (4 46)
% 0.20/0.53  Evaluation took:
% 0.20/0.53    0.051 seconds of real time
% 0.20/0.53    0.044331 seconds of user run time
% 0.20/0.53    0.006804 seconds of system run time
% 0.20/0.53    0 calls to %EVAL
% 0.20/0.53    0 page faults and
% 0.20/0.53    3,361,520 bytes consed.
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.54  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T08:45:54
% 0.20/0.54  :PROOF-FOUND
% 0.20/0.54  * 
%------------------------------------------------------------------------------