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

View Problem - Process Solution

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

% Computer : n019.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.35s 0.52s
% Output   : Refutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   9 unt;   0 nHn;   3 RR)
%            Number of literals    :    9 (   8 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   1 sgn)

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

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

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

cnf(17,plain,
    addition(antidomain(antidomain(X)),addition(antidomain(X),Y)) = addition(one,Y),
    inference('EMBED',[status(thm)],[16]) ).

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

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

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

cnf(38,plain,
    addition(one,antidomain(X)) = one,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,17,theory(equality)]),16,theory(equality)]) ).

cnf(40,plain,
    $false,
    inference('REWRITE',[status(thm)],[26,38,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KLE085+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun 16 15:57:24 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T15:57:24
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-16T15:57:24
% 0.20/0.49  
% 0.20/0.49  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.49  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.49  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.49  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.49  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.49  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.49  ; Recognized possible left inverse assertion (= (|multiplication| (|antidomain| ?X) ?X) |zero|).
% 0.20/0.49  ; Recognized possible right inverse assertion (= (|multiplication| ?X (|coantidomain| ?X)) |zero|).
% 0.20/0.49  ; Declaring addition to be commutative.
% 0.35/0.52  ; Declaring addition to be associative-commutative.
% 0.35/0.52  
% 0.35/0.52  #||
% 0.35/0.52  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.52  % SZS output start Refutation
% See solution above
% 0.35/0.52  ||#
% 0.35/0.52  
% 0.35/0.52  ; Summary of computation:
% 0.35/0.52  ;       119 formulas have been input or derived (from 17 formulas).
% 0.35/0.52  ;        40 (34%) were retained.  Of these,
% 0.35/0.52  ;            2 ( 5%) were simplified or subsumed later,
% 0.35/0.52  ;           38 (95%) are still being kept.
% 0.35/0.52  ; 
% 0.35/0.52  ; Run time in seconds:
% 0.35/0.52  ;     0.005  11%   Read assertion file          (1 call)
% 0.35/0.52  ;     0.001   2%   Assert                       (21 calls)
% 0.35/0.52  ;     0.004   9%   Process new row              (92 calls)
% 0.35/0.52  ;     0.001   2%   Resolution                   (32 calls)
% 0.35/0.52  ;     0.004   9%   Paramodulation               (16 calls)
% 0.35/0.52  ;     0.000   0%   Embedding                    (9 calls)
% 0.35/0.52  ;     0.003   7%   Condensing                   (27 calls)
% 0.35/0.52  ;     0.000   0%   Forward subsumption          (27 calls)
% 0.35/0.52  ;     0.000   0%   Backward subsumption         (7 calls)
% 0.35/0.52  ;     0.000   0%   Clause clause subsumption    (30 calls)
% 0.35/0.52  ;     0.006  13%   Forward simplification       (86 calls)
% 0.35/0.52  ;     0.000   0%   Backward simplification      (33 calls)
% 0.35/0.52  ;     0.000   0%   Ordering                     (116 calls)
% 0.35/0.52  ;     0.000   0%   Ordering ac                  (14 calls)
% 0.35/0.52  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.35/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.35/0.52  ;     0.021  46%   Other
% 0.35/0.52  ;     0.046        Total
% 0.35/0.52  ;     0.049        Real time
% 0.35/0.52  ; 
% 0.35/0.52  ; Term-hash-array has 95 terms in all.
% 0.35/0.52  ; Feature-vector-row-index has 7 entries (7 at peak, 7 added, 0 deleted).
% 0.35/0.52  ; Feature-vector-row-index has 25 nodes (25 at peak, 25 added, 0 deleted).
% 0.35/0.52  ;  Retrieved 48 possibly forward subsuming rows in 27 calls.
% 0.35/0.52  ;  Retrieved 0 possibly backward subsumed rows in 7 calls.
% 0.35/0.52  ; Path-index has 96 entries (96 at peak, 98 added, 2 deleted).
% 0.35/0.52  ; Path-index has 214 nodes (216 at peak, 216 added, 2 deleted).
% 0.35/0.52  ; Trie-index has 96 entries (96 at peak, 98 added, 2 deleted).
% 0.35/0.52  ; Trie-index has 157 nodes (157 at peak, 157 added, 0 deleted).
% 0.35/0.52  ; Retrieved 870 generalization terms in 275 calls.
% 0.35/0.52  ; Retrieved 31 instance terms in 27 calls.
% 0.35/0.52  ; Retrieved 281 unifiable terms in 77 calls.
% 0.35/0.52  ; 
% 0.35/0.52  ; The agenda of rows to process has 20 entries:
% 0.35/0.52  ;     3 with value 17              3 with value 22               1 with value 27
% 0.35/0.52  ;     2 with value 19              2 with value 23               1 with value 28
% 0.35/0.52  ;     2 with value 20              1 with value 24               1 with value 30
% 0.35/0.52  ;     1 with value 21              2 with value 26               1 with value 33
% 0.35/0.52  ; The agenda of input rows to give has 9 entries:
% 0.35/0.52  ;     2 with value 12              2 with value 16               4 with value 24
% 0.35/0.52  ;     1 with value 14
% 0.35/0.52  ; The agenda of rows to give has 13 entries:
% 0.35/0.52  ;     2 with value (4 5)           2 with value (4 9)            1 with value (4 16)
% 0.35/0.52  ;     2 with value (4 7)           2 with value (4 10)           1 with value (4 18)
% 0.35/0.52  ;     1 with value (4 8)           1 with value (4 15)           1 with value (4 21)
% 0.35/0.52  Evaluation took:
% 0.35/0.52    0.049 seconds of real time
% 0.35/0.52    0.043482 seconds of user run time
% 0.35/0.52    0.004236 seconds of system run time
% 0.35/0.52    0 calls to %EVAL
% 0.35/0.52    0 page faults and
% 0.35/0.52    2,689,368 bytes consed.
% 0.35/0.52  :PROOF-FOUND
% 0.35/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T15:57:25
% 0.35/0.52  :PROOF-FOUND
% 0.35/0.52  * 
%------------------------------------------------------------------------------