↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : KLE040+2 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 02:26:21 EDT 2022

% Result   : Theorem 0.38s 0.60s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  18 unt;   0 nHn;   6 RR)
%            Number of literals    :   26 (  12 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   31 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    addition(X,X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).

cnf(3,plain,
    addition(X,addition(X,Y)) = addition(X,Y),
    inference('EMBED',[status(thm)],[2]) ).

cnf(5,axiom,
    multiplication(X,one) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).

cnf(6,axiom,
    multiplication(one,X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).

cnf(7,axiom,
    multiplication(X,addition(Y,Z)) = addition(multiplication(X,Y),multiplication(X,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).

cnf(8,axiom,
    multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).

cnf(11,axiom,
    ( ~ leq(X,Y)
    | addition(X,Y) = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).

cnf(12,axiom,
    ( leq(X,Y)
    | addition(X,Y) != Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).

cnf(13,axiom,
    leq(addition(one,multiplication(X,star(X))),star(X)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).

cnf(15,axiom,
    ( ~ leq(addition(multiplication(X,Y),Z),Y)
    | leq(multiplication(star(X),Z),Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).

cnf(17,negated_conjecture,
    ( ~ leq(multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV1')),star('SKOLEMAAAV1'))
    | ~ leq(star('SKOLEMAAAV1'),multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV1'))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(19,plain,
    leq(X,X),
    inference('HYPERRESOLVE',[status(thm)],[12,2]) ).

cnf(20,plain,
    leq(X,addition(X,Y)),
    inference('HYPERRESOLVE',[status(thm)],[12,3]) ).

cnf(26,plain,
    addition(one,addition(multiplication(X,star(X)),star(X))) = star(X),
    inference('HYPERRESOLVE',[status(thm)],[11,13]) ).

cnf(111,plain,
    leq(one,star(X)),
    inference('PARAMODULATE',[status(thm)],[20,26,theory(equality)]) ).

cnf(119,plain,
    leq(addition(star(X),multiplication(star(X),star(X))),star(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,26,theory(equality)]),5,7,19,theory(equality)]) ).

cnf(130,plain,
    star(X) = addition(one,star(X)),
    inference('HYPERRESOLVE',[status(thm)],[11,111]) ).

cnf(140,plain,
    multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,130,theory(equality)]),6,theory(equality)]) ).

cnf(144,plain,
    leq(multiplication(star(X),star(X)),star(X)),
    inference('REWRITE',[status(thm)],[119,140,theory(equality)]) ).

cnf(145,plain,
    ~ leq(star('SKOLEMAAAV1'),multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV1'))),
    inference('REWRITE',[status(thm)],[17,144]) ).

cnf(146,plain,
    multiplication(X,star(Y)) = addition(X,multiplication(X,star(Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,130,theory(equality)]),5,theory(equality)]) ).

cnf(150,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[12,145]),146,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE040+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Thu Jun 16 09:27:22 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-16T09:27:22
% 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-16T09:27:22
% 0.19/0.48  
% 0.19/0.48  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.19/0.48  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.19/0.48  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.19/0.48  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.19/0.48  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.19/0.48  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.19/0.48  ; Declaring addition to be commutative.
% 0.38/0.60  ; Declaring addition to be associative-commutative.
% 0.38/0.60  
% 0.38/0.60  #||
% 0.38/0.60  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.60  % SZS output start Refutation
% See solution above
% 0.38/0.60  ||#
% 0.38/0.60  
% 0.38/0.60  ; Summary of computation:
% 0.38/0.60  ;       793 formulas have been input or derived (from 46 formulas).
% 0.38/0.60  ;       150 (19%) were retained.  Of these,
% 0.38/0.60  ;           56 (37%) were simplified or subsumed later,
% 0.38/0.60  ;           94 (63%) are still being kept.
% 0.38/0.60  ; 
% 0.38/0.60  ; Run time in seconds excluding printing time:
% 0.38/0.60  ;     0.004   3%   Read assertion file          (1 call)
% 0.38/0.60  ;     0.001   1%   Assert                       (17 calls)
% 0.38/0.60  ;     0.019  15%   Process new row              (732 calls)
% 0.38/0.60  ;     0.003   2%   Resolution                   (90 calls)
% 0.38/0.60  ;     0.017  13%   Paramodulation               (45 calls)
% 0.38/0.60  ;     0.000   0%   Embedding                    (26 calls)
% 0.38/0.60  ;     0.009   7%   Condensing                   (133 calls)
% 0.38/0.60  ;     0.006   5%   Forward subsumption          (133 calls)
% 0.38/0.60  ;     0.002   2%   Backward subsumption         (55 calls)
% 0.38/0.60  ;     0.004   3%   Clause clause subsumption    (210 calls)
% 0.38/0.60  ;     0.034  27%   Forward simplification       (703 calls)
% 0.38/0.60  ;     0.004   3%   Backward simplification      (127 calls)
% 0.38/0.60  ;     0.000   0%   Ordering                     (483 calls)
% 0.38/0.60  ;     0.000   0%   Ordering ac                  (67 calls)
% 0.38/0.60  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.38/0.60  ;     0.000   0%   Purity testing               (1 call)
% 0.38/0.60  ;     0.023  18%   Other
% 0.38/0.60  ;     0.127        Total
% 0.38/0.60  ;     0.129        Real time
% 0.38/0.60  ; 
% 0.38/0.60  ; Term-hash-array has 369 terms in all.
% 0.38/0.60  ; Feature-vector-row-index has 40 entries (45 at peak, 55 added, 15 deleted).
% 0.38/0.60  ; Feature-vector-row-index has 184 nodes (247 at peak, 328 added, 144 deleted).
% 0.38/0.60  ;  Retrieved 251 possibly forward subsuming rows in 133 calls.
% 0.38/0.60  ;  Retrieved 17 possibly backward subsumed rows in 55 calls.
% 0.38/0.60  ; Path-index has 269 entries (287 at peak, 387 added, 118 deleted).
% 0.38/0.60  ; Path-index has 327 nodes (341 at peak, 386 added, 59 deleted).
% 0.38/0.60  ; Trie-index has 269 entries (287 at peak, 387 added, 118 deleted).
% 0.38/0.60  ; Trie-index has 284 nodes (291 at peak, 358 added, 74 deleted).
% 0.38/0.60  ; Retrieved 17,585 generalization terms in 4,161 calls.
% 0.38/0.60  ; Retrieved 172 instance terms in 89 calls.
% 0.38/0.60  ; Retrieved 1,641 unifiable terms in 275 calls.
% 0.38/0.60  ; 
% 0.38/0.60  ; The agenda of rows to give has 62 entries:
% 0.38/0.60  ;     2 with value (4 13)          5 with value (4 20)           5 with value (4 27)
% 0.38/0.60  ;     1 with value (4 14)          3 with value (4 21)          14 with value (4 28)
% 0.38/0.60  ;     4 with value (4 15)          2 with value (4 22)           1 with value (4 29)
% 0.38/0.60  ;     1 with value (4 16)          4 with value (4 23)           2 with value (4 30)
% 0.38/0.60  ;     4 with value (4 17)          1 with value (4 25)           2 with value (4 35)
% 0.38/0.60  ;     6 with value (4 19)          5 with value (4 26)
% 0.38/0.60  Evaluation took:
% 0.38/0.60    0.131 seconds of real time
% 0.38/0.60    0.116844 seconds of user run time
% 0.38/0.60    0.013031 seconds of system run time
% 0.38/0.60    0 calls to %EVAL
% 0.38/0.60    0 page faults and
% 0.38/0.60    8,910,176 bytes consed.
% 0.38/0.60  :PROOF-FOUND
% 0.38/0.60  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T09:27:22
% 0.38/0.60  :PROOF-FOUND
% 0.38/0.60  * 
%------------------------------------------------------------------------------