TSTP Solution File: KLE022+4 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n015.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:13 EDT 2022

% Result   : Theorem 0.40s 0.58s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   22 (  14 unt;   0 nHn;  16 RR)
%            Number of literals    :   33 (  17 equ;  12 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 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   :   21 (   0 sgn)

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

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

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

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

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

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

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

cnf(17,axiom,
    ( ~ complement(X,Y)
    | addition(X,Y) = one ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).

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

cnf(24,negated_conjecture,
    test('SKOLEMAAAU3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(25,negated_conjecture,
    ( ~ leq('SKOLEMAAAU2',addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),multiplication('SKOLEMAAAU2',c('SKOLEMAAAU3'))))
    | ~ leq(addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),multiplication('SKOLEMAAAU2',c('SKOLEMAAAU3'))),'SKOLEMAAAU2') ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(26,plain,
    complement('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3'),
    inference('HYPERRESOLVE',[status(thm)],[13,24]) ).

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

cnf(89,plain,
    addition('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3') = one,
    inference('HYPERRESOLVE',[status(thm)],[17,26]) ).

cnf(91,plain,
    multiplication('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3') = zero,
    inference('HYPERRESOLVE',[status(thm)],[16,26]) ).

cnf(92,plain,
    multiplication('SKOLEMAAAU3','SKOLEMAAAU1'('SKOLEMAAAU3')) = zero,
    inference('HYPERRESOLVE',[status(thm)],[15,26]) ).

cnf(126,plain,
    X = addition(multiplication(X,'SKOLEMAAAU1'('SKOLEMAAAU3')),multiplication(X,'SKOLEMAAAU3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,89,theory(equality)]),5,theory(equality)]) ).

cnf(128,plain,
    complement('SKOLEMAAAU3','SKOLEMAAAU1'('SKOLEMAAAU3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,89,theory(equality)]),92,91,theory(equality)]) ).

cnf(134,plain,
    c('SKOLEMAAAU3') = 'SKOLEMAAAU1'('SKOLEMAAAU3'),
    inference('HYPERRESOLVE',[status(thm)],[20,128,24]) ).

cnf(142,plain,
    X = addition(multiplication(X,c('SKOLEMAAAU3')),multiplication(X,'SKOLEMAAAU3')),
    inference('REWRITE',[status(thm)],[126,134,theory(equality)]) ).

cnf(144,plain,
    $false,
    inference('REWRITE',[status(thm)],[25,29,142,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n015.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 16 13:13:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45   (USE-FACTORING :POS)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45  * 
% 0.18/0.45  "."
% 0.18/0.45  * 
% 0.18/0.45  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T13:13:56
% 0.18/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-16T13:13:56
% 0.18/0.47  
% 0.18/0.47  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.18/0.47  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.18/0.47  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.18/0.47  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.18/0.47  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.18/0.47  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.18/0.47  ; Declaring addition to be commutative.
% 0.40/0.58  ; Declaring addition to be associative-commutative.
% 0.40/0.58  
% 0.40/0.58  #||
% 0.40/0.58  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58  % SZS output start Refutation
% See solution above
% 0.40/0.58  ||#
% 0.40/0.58  
% 0.40/0.58  ; Summary of computation:
% 0.40/0.58  ;       612 formulas have been input or derived (from 50 formulas).
% 0.40/0.58  ;       144 (24%) were retained.  Of these,
% 0.40/0.58  ;           26 (18%) were simplified or subsumed later,
% 0.40/0.58  ;          118 (82%) are still being kept.
% 0.40/0.58  ; 
% 0.40/0.58  ; Run time in seconds excluding printing time:
% 0.40/0.58  ;     0.005   4%   Read assertion file          (1 call)
% 0.40/0.58  ;     0.002   2%   Assert                       (19 calls)
% 0.40/0.58  ;     0.016  12%   Process new row              (550 calls)
% 0.40/0.58  ;     0.006   5%   Resolution                   (98 calls)
% 0.40/0.58  ;     0.004   3%   Paramodulation               (49 calls)
% 0.40/0.58  ;     0.000   0%   Factoring                    (1 call)
% 0.40/0.58  ;     0.000   0%   Embedding                    (19 calls)
% 0.40/0.58  ;     0.025  20%   Condensing                   (112 calls)
% 0.40/0.58  ;     0.003   2%   Forward subsumption          (112 calls)
% 0.40/0.58  ;     0.002   2%   Backward subsumption         (61 calls)
% 0.40/0.58  ;     0.005   4%   Clause clause subsumption    (167 calls)
% 0.40/0.58  ;     0.033  26%   Forward simplification       (524 calls)
% 0.40/0.58  ;     0.003   2%   Backward simplification      (128 calls)
% 0.40/0.58  ;     0.001   1%   Ordering                     (409 calls)
% 0.40/0.58  ;     0.000   0%   Ordering ac                  (37 calls)
% 0.40/0.58  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.40/0.58  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.58  ;     0.022  17%   Other
% 0.40/0.58  ;     0.128        Total
% 0.40/0.58  ;     0.130        Real time
% 0.40/0.58  ; 
% 0.40/0.58  ; Term-hash-array has 353 terms in all.
% 0.40/0.58  ; Feature-vector-row-index has 55 entries (56 at peak, 61 added, 6 deleted).
% 0.40/0.58  ; Feature-vector-row-index has 221 nodes (239 at peak, 271 added, 50 deleted).
% 0.40/0.58  ;  Retrieved 218 possibly forward subsuming rows in 112 calls.
% 0.40/0.58  ;  Retrieved 24 possibly backward subsumed rows in 61 calls.
% 0.40/0.58  ; Path-index has 309 entries (331 at peak, 360 added, 51 deleted).
% 0.40/0.58  ; Path-index has 333 nodes (350 at peak, 373 added, 40 deleted).
% 0.40/0.58  ; Trie-index has 309 entries (331 at peak, 360 added, 51 deleted).
% 0.40/0.58  ; Trie-index has 352 nodes (383 at peak, 406 added, 54 deleted).
% 0.40/0.58  ; Retrieved 7,938 generalization terms in 3,476 calls.
% 0.40/0.58  ; Retrieved 110 instance terms in 84 calls.
% 0.40/0.58  ; Retrieved 2,017 unifiable terms in 476 calls.
% 0.40/0.58  ; 
% 0.40/0.58  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.40/0.58  ;     3 with value 0
% 0.40/0.58  ; The agenda of rows to process has 7 entries:
% 0.40/0.58  ;     6 with value 13              1 with value 17
% 0.40/0.58  ; The agenda of rows to give has 75 entries:
% 0.40/0.58  ;     1 with value (4 7)           4 with value (4 17)           2 with value (4 39)
% 0.40/0.58  ;     1 with value (4 9)           4 with value (4 18)           2 with value (4 41)
% 0.40/0.58  ;     8 with value (4 11)          9 with value (4 20)           2 with value (4 51)
% 0.40/0.58  ;     5 with value (4 12)          2 with value (4 21)           1 with value (4 59)
% 0.40/0.58  ;     3 with value (4 13)          4 with value (4 25)           1 with value (4 61)
% 0.40/0.58  ;     2 with value (4 14)          2 with value (4 26)           2 with value (4 79)
% 0.40/0.58  ;     6 with value (4 15)          6 with value (4 28)           1 with value (4 107)
% 0.40/0.58  ;     3 with value (4 16)          4 with value (4 38)
% 0.40/0.58  Evaluation took:
% 0.40/0.58    0.13 seconds of real time
% 0.40/0.58    0.121124 seconds of user run time
% 0.40/0.58    0.008929 seconds of system run time
% 0.40/0.58    0 calls to %EVAL
% 0.40/0.58    0 page faults and
% 0.40/0.58    8,279,792 bytes consed.
% 0.40/0.58  :PROOF-FOUND
% 0.40/0.58  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T13:13:56
% 0.40/0.58  :PROOF-FOUND
% 0.40/0.58  * 
%------------------------------------------------------------------------------