TSTP Solution File: KLE007+2 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n003.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:04 EDT 2022

% Result   : Theorem 0.41s 0.58s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   28 (  18 unt;   0 nHn;  21 RR)
%            Number of literals    :   42 (  20 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   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   :   26 (   0 sgn)

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

cnf(5,axiom,
    multiplication(X,one) = X,
    file('/export/starexec/sandbox2/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/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(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('SKOLEMAAAV1'(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('SKOLEMAAAV3'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

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

cnf(24,negated_conjecture,
    ( ~ leq(one,addition(multiplication(addition('SKOLEMAAAV2',c('SKOLEMAAAV2')),'SKOLEMAAAV3'),multiplication(addition('SKOLEMAAAV2',c('SKOLEMAAAV2')),c('SKOLEMAAAV3'))))
    | ~ leq(addition(multiplication(addition('SKOLEMAAAV2',c('SKOLEMAAAV2')),'SKOLEMAAAV3'),multiplication(addition('SKOLEMAAAV2',c('SKOLEMAAAV2')),c('SKOLEMAAAV3'))),one) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(25,plain,
    ( ~ leq(one,addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),addition(multiplication(c('SKOLEMAAAV2'),'SKOLEMAAAV3'),addition(multiplication('SKOLEMAAAV2',c('SKOLEMAAAV3')),multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3'))))))
    | ~ leq(addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),addition(multiplication(c('SKOLEMAAAV2'),'SKOLEMAAAV3'),addition(multiplication('SKOLEMAAAV2',c('SKOLEMAAAV3')),multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3'))))),one) ),
    inference('REWRITE',[status(thm)],[24,8,theory(equality)]) ).

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

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

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

cnf(78,plain,
    addition('SKOLEMAAAV1'('SKOLEMAAAV3'),'SKOLEMAAAV3') = one,
    inference('HYPERRESOLVE',[status(thm)],[17,26]) ).

cnf(80,plain,
    multiplication('SKOLEMAAAV1'('SKOLEMAAAV3'),'SKOLEMAAAV3') = zero,
    inference('HYPERRESOLVE',[status(thm)],[16,26]) ).

cnf(81,plain,
    multiplication('SKOLEMAAAV3','SKOLEMAAAV1'('SKOLEMAAAV3')) = zero,
    inference('HYPERRESOLVE',[status(thm)],[15,26]) ).

cnf(94,plain,
    addition('SKOLEMAAAV2',c('SKOLEMAAAV2')) = one,
    inference('HYPERRESOLVE',[status(thm)],[17,36]) ).

cnf(114,plain,
    X = addition(multiplication(X,'SKOLEMAAAV1'('SKOLEMAAAV3')),multiplication(X,'SKOLEMAAAV3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,78,theory(equality)]),5,theory(equality)]) ).

cnf(116,plain,
    complement('SKOLEMAAAV3','SKOLEMAAAV1'('SKOLEMAAAV3')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,78,theory(equality)]),81,80,theory(equality)]) ).

cnf(122,plain,
    c('SKOLEMAAAV3') = 'SKOLEMAAAV1'('SKOLEMAAAV3'),
    inference('HYPERRESOLVE',[status(thm)],[20,116,22]) ).

cnf(130,plain,
    X = addition(multiplication(X,c('SKOLEMAAAV3')),multiplication(X,'SKOLEMAAAV3')),
    inference('REWRITE',[status(thm)],[114,122,theory(equality)]) ).

cnf(132,plain,
    $false,
    inference('REWRITE',[status(thm)],[25,30,94,130,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KLE007+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun 16 13:30:56 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45  * 
% 0.20/0.45  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T13:30:57
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n003.cluster.edu at 2022-06-16T13:30:57
% 0.20/0.47  
% 0.20/0.47  ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.47  ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.47  ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.47  ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.47  ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.48  ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.48  ; Declaring addition to be commutative.
% 0.41/0.58  ; Declaring addition to be associative-commutative.
% 0.41/0.58  
% 0.41/0.58  #||
% 0.41/0.58  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.58  % SZS output start Refutation
% See solution above
% 0.41/0.59  ||#
% 0.41/0.59  
% 0.41/0.59  ; Summary of computation:
% 0.41/0.59  ;       554 formulas have been input or derived (from 51 formulas).
% 0.41/0.59  ;       132 (24%) were retained.  Of these,
% 0.41/0.59  ;           26 (20%) were simplified or subsumed later,
% 0.41/0.59  ;          106 (80%) are still being kept.
% 0.41/0.59  ; 
% 0.41/0.59  ; Run time in seconds excluding printing time:
% 0.41/0.59  ;     0.005   4%   Read assertion file          (1 call)
% 0.41/0.59  ;     0.000   0%   Assert                       (17 calls)
% 0.41/0.59  ;     0.020  16%   Process new row              (493 calls)
% 0.41/0.59  ;     0.005   4%   Resolution                   (100 calls)
% 0.41/0.59  ;     0.008   7%   Paramodulation               (50 calls)
% 0.41/0.59  ;     0.000   0%   Factoring                    (1 call)
% 0.41/0.59  ;     0.000   0%   Embedding                    (18 calls)
% 0.41/0.59  ;     0.022  18%   Condensing                   (95 calls)
% 0.41/0.59  ;     0.002   2%   Forward subsumption          (95 calls)
% 0.41/0.59  ;     0.002   2%   Backward subsumption         (46 calls)
% 0.41/0.59  ;     0.005   4%   Clause clause subsumption    (155 calls)
% 0.41/0.59  ;     0.027  22%   Forward simplification       (468 calls)
% 0.41/0.59  ;     0.000   0%   Backward simplification      (116 calls)
% 0.41/0.59  ;     0.000   0%   Ordering                     (354 calls)
% 0.41/0.59  ;     0.002   2%   Ordering ac                  (37 calls)
% 0.41/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.41/0.59  ;     0.001   1%   Purity testing               (1 call)
% 0.41/0.59  ;     0.024  20%   Other
% 0.41/0.59  ;     0.123        Total
% 0.41/0.59  ;     0.126        Real time
% 0.41/0.59  ; 
% 0.41/0.59  ; Term-hash-array has 319 terms in all.
% 0.41/0.59  ; Feature-vector-row-index has 40 entries (41 at peak, 46 added, 6 deleted).
% 0.41/0.59  ; Feature-vector-row-index has 144 nodes (164 at peak, 195 added, 51 deleted).
% 0.41/0.59  ;  Retrieved 210 possibly forward subsuming rows in 95 calls.
% 0.41/0.59  ;  Retrieved 20 possibly backward subsumed rows in 46 calls.
% 0.41/0.59  ; Path-index has 275 entries (297 at peak, 327 added, 52 deleted).
% 0.41/0.59  ; Path-index has 310 nodes (327 at peak, 350 added, 40 deleted).
% 0.41/0.59  ; Trie-index has 275 entries (297 at peak, 327 added, 52 deleted).
% 0.41/0.59  ; Trie-index has 298 nodes (321 at peak, 351 added, 53 deleted).
% 0.41/0.59  ; Retrieved 7,039 generalization terms in 2,988 calls.
% 0.41/0.59  ; Retrieved 113 instance terms in 87 calls.
% 0.41/0.59  ; Retrieved 1,769 unifiable terms in 433 calls.
% 0.41/0.59  ; 
% 0.41/0.59  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.41/0.59  ;     3 with value 0
% 0.41/0.59  ; The agenda of rows to process has 7 entries:
% 0.41/0.59  ;     6 with value 13              1 with value 17
% 0.41/0.59  ; The agenda of rows to give has 62 entries:
% 0.41/0.59  ;     1 with value (4 7)           4 with value (4 17)           2 with value (4 41)
% 0.41/0.59  ;     1 with value (4 9)           2 with value (4 18)           2 with value (4 51)
% 0.41/0.59  ;    16 with value (4 11)          5 with value (4 20)           1 with value (4 59)
% 0.41/0.59  ;     4 with value (4 12)          1 with value (4 21)           1 with value (4 61)
% 0.41/0.59  ;     3 with value (4 13)          6 with value (4 28)           2 with value (4 79)
% 0.41/0.59  ;     2 with value (4 15)          4 with value (4 38)           1 with value (4 107)
% 0.41/0.59  ;     2 with value (4 16)          2 with value (4 39)
% 0.41/0.59  Evaluation took:
% 0.41/0.59    0.127 seconds of real time
% 0.41/0.59    0.113514 seconds of user run time
% 0.41/0.59    0.013263 seconds of system run time
% 0.41/0.59    0 calls to %EVAL
% 0.41/0.59    0 page faults and
% 0.41/0.59    8,537,040 bytes consed.
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T13:30:57
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  * 
%------------------------------------------------------------------------------