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

View Problem - Process Solution

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

% Computer : n026.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:34 EDT 2022

% Result   : Theorem 0.40s 0.62s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   5 RR)
%            Number of literals    :   10 (   9 equ;   2 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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    addition(X,zero) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

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

cnf(13,axiom,
    multiplication(antidomain(X),X) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).

cnf(16,axiom,
    addition(antidomain(antidomain(X)),antidomain(X)) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).

cnf(18,axiom,
    domain(X) = antidomain(antidomain(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).

cnf(25,negated_conjecture,
    domain(zero) != zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(26,plain,
    antidomain(antidomain(zero)) != zero,
    inference('REWRITE',[status(thm)],[25,18,theory(equality)]) ).

cnf(27,plain,
    zero = antidomain(one),
    inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).

cnf(158,plain,
    antidomain(zero) = one,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,27,theory(equality)]),1,theory(equality)]) ).

cnf(159,plain,
    $false,
    inference('REWRITE',[status(thm)],[26,27,158,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE086+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n026.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 07:59:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49  * 
% 0.20/0.49  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T07:59:08
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-16T07:59:08
% 0.20/0.51  
% 0.20/0.51  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.51  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.51  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.51  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.51  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.51  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.51  ; Recognized possible left inverse assertion (= (|multiplication| (|antidomain| ?X) ?X) |zero|).
% 0.20/0.51  ; Recognized possible right inverse assertion (= (|multiplication| ?X (|coantidomain| ?X)) |zero|).
% 0.20/0.51  ; Declaring addition to be commutative.
% 0.40/0.62  ; Declaring addition to be associative-commutative.
% 0.40/0.62  
% 0.40/0.62  #||
% 0.40/0.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.62  % SZS output start Refutation
% See solution above
% 0.40/0.62  ||#
% 0.40/0.62  
% 0.40/0.62  ; Summary of computation:
% 0.40/0.62  ;       505 formulas have been input or derived (from 29 formulas).
% 0.40/0.62  ;       159 (31%) were retained.  Of these,
% 0.40/0.62  ;           12 ( 8%) were simplified or subsumed later,
% 0.40/0.62  ;          147 (92%) are still being kept.
% 0.40/0.62  ; 
% 0.40/0.62  ; Run time in seconds:
% 0.40/0.62  ;     0.005   4%   Read assertion file          (1 call)
% 0.40/0.62  ;     0.001   1%   Assert                       (21 calls)
% 0.40/0.62  ;     0.023  18%   Process new row              (478 calls)
% 0.40/0.62  ;     0.001   1%   Resolution                   (56 calls)
% 0.40/0.62  ;     0.014  11%   Paramodulation               (28 calls)
% 0.40/0.62  ;     0.001   1%   Embedding                    (49 calls)
% 0.40/0.62  ;     0.004   3%   Condensing                   (69 calls)
% 0.40/0.62  ;     0.001   1%   Forward subsumption          (69 calls)
% 0.40/0.62  ;     0.000   0%   Backward subsumption         (33 calls)
% 0.40/0.62  ;     0.001   1%   Clause clause subsumption    (117 calls)
% 0.40/0.62  ;     0.046  36%   Forward simplification       (432 calls)
% 0.40/0.62  ;     0.002   2%   Backward simplification      (112 calls)
% 0.40/0.62  ;     0.002   2%   Ordering                     (542 calls)
% 0.40/0.62  ;     0.002   2%   Ordering ac                  (101 calls)
% 0.40/0.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.40/0.62  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.62  ;     0.026  20%   Other
% 0.40/0.62  ;     0.129        Total
% 0.40/0.62  ;     0.130        Real time
% 0.40/0.62  ; 
% 0.40/0.62  ; Term-hash-array has 512 terms in all.
% 0.40/0.62  ; Feature-vector-row-index has 33 entries (33 at peak, 33 added, 0 deleted).
% 0.40/0.62  ; Feature-vector-row-index has 266 nodes (266 at peak, 266 added, 0 deleted).
% 0.40/0.62  ;  Retrieved 135 possibly forward subsuming rows in 69 calls.
% 0.40/0.62  ;  Retrieved 0 possibly backward subsumed rows in 33 calls.
% 0.40/0.62  ; Path-index has 475 entries (514 at peak, 514 added, 39 deleted).
% 0.40/0.62  ; Path-index has 946 nodes (975 at peak, 975 added, 29 deleted).
% 0.40/0.62  ; Trie-index has 475 entries (514 at peak, 514 added, 39 deleted).
% 0.40/0.62  ; Trie-index has 600 nodes (641 at peak, 641 added, 41 deleted).
% 0.40/0.62  ; Retrieved 29,764 generalization terms in 5,370 calls.
% 0.40/0.62  ; Retrieved 118 instance terms in 96 calls.
% 0.40/0.62  ; Retrieved 1,119 unifiable terms in 147 calls.
% 0.40/0.62  ; 
% 0.40/0.62  ; The agenda of backward simplifiable rows to process has 5 entries:
% 0.40/0.62  ;     5 with value 0
% 0.40/0.62  ; The agenda of rows to process has 1 entry:
% 0.40/0.62  ;     1 with value 23
% 0.40/0.62  ; The agenda of rows to give has 119 entries:
% 0.40/0.62  ;     1 with value (4 7)          14 with value (4 18)           8 with value (4 31)
% 0.40/0.62  ;     2 with value (4 8)           9 with value (4 20)          16 with value (4 32)
% 0.40/0.62  ;     1 with value (4 9)          13 with value (4 21)           2 with value (4 33)
% 0.40/0.62  ;     4 with value (4 10)          2 with value (4 22)           4 with value (4 34)
% 0.40/0.62  ;     2 with value (4 12)          4 with value (4 23)           2 with value (4 39)
% 0.40/0.62  ;     2 with value (4 13)          2 with value (4 25)           4 with value (4 40)
% 0.40/0.62  ;     1 with value (4 15)          4 with value (4 26)           4 with value (4 42)
% 0.40/0.62  ;     2 with value (4 16)          8 with value (4 28)           2 with value (4 45)
% 0.40/0.62  ;     2 with value (4 17)          2 with value (4 30)           2 with value (4 47)
% 0.40/0.62  Evaluation took:
% 0.40/0.62    0.131 seconds of real time
% 0.40/0.62    0.120425 seconds of user run time
% 0.40/0.62    0.010165 seconds of system run time
% 0.40/0.62    0 calls to %EVAL
% 0.40/0.62    0 page faults and
% 0.40/0.62    6,822,408 bytes consed.
% 0.40/0.62  :PROOF-FOUND
% 0.40/0.62  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T07:59:08
% 0.40/0.63  :PROOF-FOUND
% 0.40/0.63  * 
%------------------------------------------------------------------------------