TSTP Solution File: KLE139+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : KLE139+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n022.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:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).

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

cnf(9,axiom,
    multiplication(zero,X) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).

cnf(12,axiom,
    addition(one,multiplication(star(X),X)) = star(X),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).

cnf(19,axiom,
    strong_iteration(X) = addition(star(X),multiplication(strong_iteration(X),zero)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',isolation) ).

cnf(23,negated_conjecture,
    strong_iteration('SKOLEMAAAV1') != addition(multiplication(strong_iteration('SKOLEMAAAV1'),'SKOLEMAAAV1'),one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(82,plain,
    multiplication(X,zero) = multiplication(multiplication(X,zero),Y),
    inference('PARAMODULATE',[status(thm)],[4,9,theory(equality)]) ).

cnf(132,plain,
    multiplication(strong_iteration(X),Y) = addition(multiplication(star(X),Y),multiplication(strong_iteration(X),zero)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,19,theory(equality)]),82,theory(equality)]) ).

cnf(134,plain,
    $false,
    inference('REWRITE',[status(thm)],[23,19,12,132,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KLE139+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n022.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 : Thu Jun 16 09:03:47 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 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-16T09:03:47
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-16T09:03:47
% 0.20/0.50  
% 0.20/0.50  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.50  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.50  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.50  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.50  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.50  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.50  ; Declaring addition to be commutative.
% 0.20/0.59  ; Declaring addition to be associative-commutative.
% 0.20/0.59  
% 0.20/0.59  #||
% 0.20/0.59  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.59  % SZS output start Refutation
% See solution above
% 0.20/0.59  ||#
% 0.20/0.59  
% 0.20/0.59  ; Summary of computation:
% 0.20/0.59  ;       418 formulas have been input or derived (from 21 formulas).
% 0.20/0.59  ;       134 (32%) were retained.  Of these,
% 0.20/0.59  ;           13 (10%) were simplified or subsumed later,
% 0.20/0.59  ;          121 (90%) are still being kept.
% 0.20/0.59  ; 
% 0.20/0.59  ; Run time in seconds:
% 0.20/0.59  ;     0.004   4%   Read assertion file          (1 call)
% 0.20/0.59  ;     0.000   0%   Assert                       (19 calls)
% 0.20/0.59  ;     0.010   9%   Process new row              (343 calls)
% 0.20/0.59  ;     0.001   1%   Resolution                   (40 calls)
% 0.20/0.59  ;     0.014  13%   Paramodulation               (20 calls)
% 0.20/0.59  ;     0.001   1%   Embedding                    (40 calls)
% 0.20/0.59  ;     0.004   4%   Condensing                   (76 calls)
% 0.20/0.59  ;     0.008   7%   Forward subsumption          (76 calls)
% 0.20/0.59  ;     0.000   0%   Backward subsumption         (40 calls)
% 0.20/0.59  ;     0.000   0%   Clause clause subsumption    (127 calls)
% 0.20/0.59  ;     0.028  25%   Forward simplification       (306 calls)
% 0.20/0.59  ;     0.003   3%   Backward simplification      (97 calls)
% 0.20/0.59  ;     0.004   4%   Ordering                     (528 calls)
% 0.20/0.59  ;     0.003   3%   Ordering ac                  (167 calls)
% 0.20/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.59  ;     0.030  27%   Other
% 0.20/0.59  ;     0.110        Total
% 0.20/0.59  ;     0.110        Real time
% 0.20/0.59  ; 
% 0.20/0.59  ; Term-hash-array has 368 terms in all.
% 0.20/0.59  ; Feature-vector-row-index has 40 entries (40 at peak, 40 added, 0 deleted).
% 0.20/0.59  ; Feature-vector-row-index has 272 nodes (272 at peak, 272 added, 0 deleted).
% 0.20/0.59  ;  Retrieved 136 possibly forward subsuming rows in 76 calls.
% 0.20/0.59  ;  Retrieved 9 possibly backward subsumed rows in 40 calls.
% 0.20/0.59  ; Path-index has 339 entries (340 at peak, 375 added, 36 deleted).
% 0.20/0.59  ; Path-index has 326 nodes (334 at peak, 343 added, 17 deleted).
% 0.20/0.59  ; Trie-index has 339 entries (340 at peak, 375 added, 36 deleted).
% 0.20/0.59  ; Trie-index has 296 nodes (301 at peak, 307 added, 11 deleted).
% 0.20/0.59  ; Retrieved 18,851 generalization terms in 2,856 calls.
% 0.20/0.59  ; Retrieved 198 instance terms in 85 calls.
% 0.20/0.59  ; Retrieved 828 unifiable terms in 105 calls.
% 0.20/0.59  ; 
% 0.20/0.59  ; The agenda of rows to process has 65 entries:
% 0.20/0.59  ;     8 with value 24              4 with value 27               4 with value 31
% 0.20/0.59  ;     6 with value 25              3 with value 28               2 with value 32
% 0.20/0.59  ;    22 with value 26             15 with value 30               1 with value 36
% 0.20/0.59  ; The agenda of input rows to give has 3 entries:
% 0.20/0.59  ;     3 with value 19
% 0.20/0.59  ; The agenda of rows to give has 98 entries:
% 0.20/0.59  ;     2 with value (4 5)           3 with value (4 16)           2 with value (4 25)
% 0.20/0.59  ;     2 with value (4 7)           9 with value (4 18)           2 with value (4 26)
% 0.20/0.59  ;     1 with value (4 8)          14 with value (4 19)          12 with value (4 28)
% 0.20/0.59  ;     1 with value (4 9)          14 with value (4 20)           1 with value (4 29)
% 0.20/0.59  ;     4 with value (4 11)          2 with value (4 21)           1 with value (4 30)
% 0.20/0.59  ;     2 with value (4 12)          5 with value (4 22)           3 with value (4 32)
% 0.20/0.59  ;     1 with value (4 13)          3 with value (4 23)           1 with value (4 33)
% 0.20/0.59  ;     9 with value (4 15)          4 with value (4 24)
% 0.20/0.59  Evaluation took:
% 0.20/0.59    0.111 seconds of real time
% 0.20/0.59    0.101085 seconds of user run time
% 0.20/0.59    0.010139 seconds of system run time
% 0.20/0.59    0 calls to %EVAL
% 0.20/0.59    0 page faults and
% 0.20/0.59    5,429,544 bytes consed.
% 0.20/0.59  :PROOF-FOUND
% 0.20/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T09:03:47
% 0.20/0.59  :PROOF-FOUND
% 0.20/0.59  * 
%------------------------------------------------------------------------------