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

View Problem - Process Solution

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

% Computer : n162.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.75MB
% OS       : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Apr 25 11:48:06 EDT 2016

% Result   : Theorem 0.06s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   38 (  29 unt;   0 nHn;  26 RR)
%            Number of literals    :   51 (  28 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   35 (   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(5,axiom,
    multiplication(X,one) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

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

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

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

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

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

cnf(13,axiom,
    ( ~ test(X)
    | complement('SKOLEMAAAP1'(X),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).

cnf(15,axiom,
    ( ~ complement(X,Y)
    | multiplication(Y,X) = zero ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

cnf(16,axiom,
    ( ~ complement(X,Y)
    | multiplication(X,Y) = zero ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

cnf(17,axiom,
    ( ~ complement(X,Y)
    | addition(X,Y) = one ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

cnf(18,axiom,
    ( complement(X,Y)
    | multiplication(Y,X) != zero
    | multiplication(X,Y) != zero
    | addition(X,Y) != one ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

cnf(19,axiom,
    ( ~ test(X)
    | c(X) != Y
    | complement(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).

cnf(20,axiom,
    ( ~ test(X)
    | c(X) = Y
    | ~ complement(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).

cnf(22,negated_conjecture,
    test('SKOLEMAAAP3'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(23,negated_conjecture,
    test('SKOLEMAAAP2'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(24,negated_conjecture,
    one != addition(multiplication(addition('SKOLEMAAAP3',c('SKOLEMAAAP3')),'SKOLEMAAAP2'),addition(multiplication(addition('SKOLEMAAAP2',c('SKOLEMAAAP2')),'SKOLEMAAAP3'),multiplication(c('SKOLEMAAAP2'),c('SKOLEMAAAP3')))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(25,plain,
    one != addition(multiplication('SKOLEMAAAP3','SKOLEMAAAP2'),addition(multiplication(c('SKOLEMAAAP3'),'SKOLEMAAAP2'),addition(multiplication('SKOLEMAAAP2','SKOLEMAAAP3'),addition(multiplication(c('SKOLEMAAAP2'),'SKOLEMAAAP3'),multiplication(c('SKOLEMAAAP2'),c('SKOLEMAAAP3')))))),
    inference('REWRITE',[status(thm)],[24,8,theory(equality)]) ).

cnf(26,plain,
    complement('SKOLEMAAAP1'('SKOLEMAAAP3'),'SKOLEMAAAP3'),
    inference('HYPERRESOLVE',[status(thm)],[13,22]) ).

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

cnf(36,plain,
    complement('SKOLEMAAAP2',c('SKOLEMAAAP2')),
    inference('HYPERRESOLVE',[status(thm)],[19,23,theory(equality)]) ).

cnf(73,plain,
    ~ complement(addition(multiplication('SKOLEMAAAP2','SKOLEMAAAP3'),addition(multiplication(c('SKOLEMAAAP3'),'SKOLEMAAAP2'),multiplication('SKOLEMAAAP3','SKOLEMAAAP2'))),addition(multiplication(c('SKOLEMAAAP2'),c('SKOLEMAAAP3')),multiplication(c('SKOLEMAAAP2'),'SKOLEMAAAP3'))),
    inference('UR-RESOLVE',[status(thm)],[17,25]) ).

cnf(108,plain,
    addition('SKOLEMAAAP1'('SKOLEMAAAP3'),'SKOLEMAAAP3') = one,
    inference('HYPERRESOLVE',[status(thm)],[17,26]) ).

cnf(110,plain,
    multiplication('SKOLEMAAAP1'('SKOLEMAAAP3'),'SKOLEMAAAP3') = zero,
    inference('HYPERRESOLVE',[status(thm)],[16,26]) ).

cnf(111,plain,
    multiplication('SKOLEMAAAP3','SKOLEMAAAP1'('SKOLEMAAAP3')) = zero,
    inference('HYPERRESOLVE',[status(thm)],[15,26]) ).

cnf(138,plain,
    leq('SKOLEMAAAP3',one),
    inference('PARAMODULATE',[status(thm)],[31,108,theory(equality)]) ).

cnf(142,plain,
    X = addition(multiplication('SKOLEMAAAP1'('SKOLEMAAAP3'),X),multiplication('SKOLEMAAAP3',X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,108,theory(equality)]),6,theory(equality)]) ).

cnf(144,plain,
    X = addition(multiplication(X,'SKOLEMAAAP1'('SKOLEMAAAP3')),multiplication(X,'SKOLEMAAAP3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,108,theory(equality)]),5,theory(equality)]) ).

cnf(146,plain,
    complement('SKOLEMAAAP3','SKOLEMAAAP1'('SKOLEMAAAP3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,108,theory(equality)]),111,110,theory(equality)]) ).

cnf(147,plain,
    addition('SKOLEMAAAP3',one) = one,
    inference('HYPERRESOLVE',[status(thm)],[11,138]) ).

cnf(152,plain,
    c('SKOLEMAAAP3') = 'SKOLEMAAAP1'('SKOLEMAAAP3'),
    inference('HYPERRESOLVE',[status(thm)],[20,146,22]) ).

cnf(158,plain,
    X = addition(multiplication(c('SKOLEMAAAP3'),X),multiplication('SKOLEMAAAP3',X)),
    inference('REWRITE',[status(thm)],[142,152,theory(equality)]) ).

cnf(168,plain,
    ~ complement(addition(multiplication('SKOLEMAAAP2','SKOLEMAAAP3'),'SKOLEMAAAP2'),addition(multiplication(c('SKOLEMAAAP2'),c('SKOLEMAAAP3')),multiplication(c('SKOLEMAAAP2'),'SKOLEMAAAP3'))),
    inference('REWRITE',[status(thm)],[73,158,theory(equality)]) ).

cnf(175,plain,
    X = addition(multiplication(X,c('SKOLEMAAAP3')),multiplication(X,'SKOLEMAAAP3')),
    inference('REWRITE',[status(thm)],[144,152,theory(equality)]) ).

cnf(178,plain,
    ~ complement(addition(multiplication('SKOLEMAAAP2','SKOLEMAAAP3'),'SKOLEMAAAP2'),c('SKOLEMAAAP2')),
    inference('REWRITE',[status(thm)],[168,175,theory(equality)]) ).

cnf(285,plain,
    X = addition(multiplication(X,'SKOLEMAAAP3'),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,147,theory(equality)]),5,theory(equality)]) ).

cnf(287,plain,
    $false,
    inference('REWRITE',[status(thm)],[178,36,285,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE011+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04  % Command  : run-snark %s %d
% 0.02/0.23  % Computer : n162.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.75MB
% 0.02/0.23  % OS       : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Apr 22 19:59:49 CDT 2016
% 0.02/0.23  % CPUTime  : 
% 0.02/0.27  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27  * 
% 0.02/0.27  * 
% 0.02/0.28  #<PACKAGE "SNARK-USER">
% 0.02/0.28  * 
% 0.02/0.28  SNARK-TPTP-OPTIONS
% 0.02/0.28  * 
% 0.02/0.28  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.02/0.28   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.02/0.28   (USE-FACTORING :POS)
% 0.02/0.28   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.02/0.28   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.02/0.28   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.02/0.28   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.02/0.28   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.02/0.28   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.02/0.28   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.02/0.28   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.02/0.28   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.02/0.28   (DECLARE-TPTP-SYMBOLS2))
% 0.02/0.28  * 
% 0.02/0.28  "."
% 0.02/0.28  * 
% 0.02/0.28  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2016-04-22T19:59:49
% 0.02/0.28  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n162.star.cs.uiowa.edu at 2016-04-22T19:59:49
% 0.02/0.29  
% 0.02/0.29  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.02/0.29  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.02/0.29  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.02/0.29  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.02/0.29  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.02/0.29  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.02/0.29  ; Declaring addition to be commutative.
% 0.06/0.42  ; Declaring addition to be associative-commutative.
% 0.06/0.42  
% 0.06/0.42  #||
% 0.06/0.42  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.42  % SZS output start Refutation
% See solution above
% 0.06/0.42  % SZS output end Refutation
% 0.06/0.42  ||#
% 0.06/0.42  
% 0.06/0.42  ; Summary of computation:
% 0.06/0.42  ;       976 formulas have been input or derived (from 78 formulas).
% 0.06/0.42  ;       287 (29%) were retained.  Of these,
% 0.06/0.42  ;           88 (31%) were simplified or subsumed later,
% 0.06/0.42  ;          199 (69%) are still being kept.
% 0.06/0.42  ; 
% 0.06/0.42  ; Run time in seconds excluding printing time:
% 0.06/0.42  ;     0.003   2%   Read assertion file          (1 call)
% 0.06/0.42  ;     0.001   1%   Assert                       (17 calls)
% 0.06/0.42  ;     0.030  21%   Process new row              (890 calls)
% 0.06/0.42  ;     0.010   7%   Resolution                   (154 calls)
% 0.06/0.42  ;     0.009   6%   Paramodulation               (77 calls)
% 0.06/0.42  ;     0.000   0%   Factoring                    (1 call)
% 0.06/0.42  ;     0.000   0%   Embedding                    (28 calls)
% 0.06/0.42  ;     0.016  11%   Condensing                   (144 calls)
% 0.06/0.42  ;     0.004   3%   Forward subsumption          (144 calls)
% 0.06/0.42  ;     0.002   1%   Backward subsumption         (77 calls)
% 0.06/0.42  ;     0.003   2%   Clause clause subsumption    (262 calls)
% 0.06/0.42  ;     0.034  24%   Forward simplification       (841 calls)
% 0.06/0.42  ;     0.010   7%   Backward simplification      (261 calls)
% 0.06/0.42  ;     0.003   2%   Ordering                     (566 calls)
% 0.06/0.42  ;     0.001   1%   Ordering ac                  (67 calls)
% 0.06/0.42  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.06/0.42  ;     0.000   0%   Purity testing               (1 call)
% 0.06/0.42  ;     0.017  12%   Other
% 0.06/0.42  ;     0.143        Total
% 0.06/0.42  ;     0.146        Real time
% 0.06/0.42  ; 
% 0.06/0.42  ; Term-hash-array has 614 terms in all.
% 0.06/0.42  ; Feature-vector-row-index has 67 entries (67 at peak, 77 added, 10 deleted).
% 0.06/0.42  ; Feature-vector-row-index has 370 nodes (370 at peak, 440 added, 70 deleted).
% 0.06/0.42  ;  Retrieved 321 possibly forward subsuming rows in 144 calls.
% 0.06/0.42  ;  Retrieved 27 possibly backward subsumed rows in 77 calls.
% 0.06/0.42  ; Path-index has 477 entries (481 at peak, 635 added, 158 deleted).
% 0.06/0.42  ; Path-index has 395 nodes (395 at peak, 467 added, 72 deleted).
% 0.06/0.42  ; Trie-index has 477 entries (481 at peak, 635 added, 158 deleted).
% 0.06/0.42  ; Trie-index has 433 nodes (436 at peak, 565 added, 132 deleted).
% 0.06/0.42  ; Retrieved 17,375 generalization terms in 5,212 calls.
% 0.06/0.42  ; Retrieved 285 instance terms in 201 calls.
% 0.06/0.42  ; Retrieved 4,346 unifiable terms in 757 calls.
% 0.06/0.42  ; 
% 0.06/0.42  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.06/0.42  ;     3 with value 0
% 0.06/0.42  ; The agenda of rows to process has 2 entries:
% 0.06/0.42  ;     2 with value 27
% 0.06/0.42  ; The agenda of rows to give has 132 entries:
% 0.06/0.42  ;    11 with value (4 11)         13 with value (4 20)           4 with value (4 38)
% 0.06/0.42  ;     6 with value (4 12)          7 with value (4 21)           4 with value (4 39)
% 0.06/0.42  ;    11 with value (4 13)          2 with value (4 23)           2 with value (4 41)
% 0.06/0.42  ;    10 with value (4 14)          2 with value (4 25)           2 with value (4 51)
% 0.06/0.42  ;    11 with value (4 15)          2 with value (4 27)           5 with value (4 59)
% 0.06/0.42  ;     4 with value (4 16)         10 with value (4 28)           1 with value (4 61)
% 0.06/0.42  ;     8 with value (4 17)          4 with value (4 33)           2 with value (4 79)
% 0.06/0.42  ;     6 with value (4 19)          4 with value (4 36)           1 with value (4 107)
% 0.06/0.42  Evaluation took:
% 0.06/0.42    0.147 seconds of real time
% 0.06/0.42    0.137836 seconds of user run time
% 0.06/0.42    0.009088 seconds of system run time
% 0.06/0.42    0 calls to %EVAL
% 0.06/0.42    0 page faults and
% 0.06/0.42    12,277,136 bytes consed.
% 0.06/0.42:PROOF-FOUND
% 0.06/0.42  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2016-04-22T19:59:49
% 0.06/0.42:PROOF-FOUND
% 0.06/0.42  * 
%------------------------------------------------------------------------------