TSTP Solution File: KLE011+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE011+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:07 EDT 2022
% Result : Theorem 0.46s 0.63s
% Output : Refutation 0.46s
% 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/sandbox/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/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
cnf(11,axiom,
( ~ leq(X,Y)
| addition(X,Y) = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
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('SKOLEMAAAV1'(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(19,axiom,
( ~ test(X)
| c(X) != Y
| complement(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
cnf(20,axiom,
( ~ test(X)
| c(X) = Y
| ~ complement(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
cnf(22,negated_conjecture,
test('SKOLEMAAAV3'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(23,negated_conjecture,
test('SKOLEMAAAV2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(24,negated_conjecture,
one != addition(multiplication(addition('SKOLEMAAAV3',c('SKOLEMAAAV3')),'SKOLEMAAAV2'),addition(multiplication(addition('SKOLEMAAAV2',c('SKOLEMAAAV2')),'SKOLEMAAAV3'),multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3')))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(25,plain,
one != addition(multiplication('SKOLEMAAAV3','SKOLEMAAAV2'),addition(multiplication(c('SKOLEMAAAV3'),'SKOLEMAAAV2'),addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),addition(multiplication(c('SKOLEMAAAV2'),'SKOLEMAAAV3'),multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3')))))),
inference('REWRITE',[status(thm)],[24,8,theory(equality)]) ).
cnf(26,plain,
complement('SKOLEMAAAV1'('SKOLEMAAAV3'),'SKOLEMAAAV3'),
inference('HYPERRESOLVE',[status(thm)],[13,22]) ).
cnf(31,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(36,plain,
complement('SKOLEMAAAV2',c('SKOLEMAAAV2')),
inference('HYPERRESOLVE',[status(thm)],[19,23,theory(equality)]) ).
cnf(73,plain,
~ complement(addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),addition(multiplication(c('SKOLEMAAAV3'),'SKOLEMAAAV2'),multiplication('SKOLEMAAAV3','SKOLEMAAAV2'))),addition(multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3')),multiplication(c('SKOLEMAAAV2'),'SKOLEMAAAV3'))),
inference('UR-RESOLVE',[status(thm)],[17,25]) ).
cnf(108,plain,
addition('SKOLEMAAAV1'('SKOLEMAAAV3'),'SKOLEMAAAV3') = one,
inference('HYPERRESOLVE',[status(thm)],[17,26]) ).
cnf(110,plain,
multiplication('SKOLEMAAAV1'('SKOLEMAAAV3'),'SKOLEMAAAV3') = zero,
inference('HYPERRESOLVE',[status(thm)],[16,26]) ).
cnf(111,plain,
multiplication('SKOLEMAAAV3','SKOLEMAAAV1'('SKOLEMAAAV3')) = zero,
inference('HYPERRESOLVE',[status(thm)],[15,26]) ).
cnf(138,plain,
leq('SKOLEMAAAV3',one),
inference('PARAMODULATE',[status(thm)],[31,108,theory(equality)]) ).
cnf(142,plain,
X = addition(multiplication('SKOLEMAAAV1'('SKOLEMAAAV3'),X),multiplication('SKOLEMAAAV3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,108,theory(equality)]),6,theory(equality)]) ).
cnf(144,plain,
X = addition(multiplication(X,'SKOLEMAAAV1'('SKOLEMAAAV3')),multiplication(X,'SKOLEMAAAV3')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,108,theory(equality)]),5,theory(equality)]) ).
cnf(146,plain,
complement('SKOLEMAAAV3','SKOLEMAAAV1'('SKOLEMAAAV3')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,108,theory(equality)]),111,110,theory(equality)]) ).
cnf(147,plain,
addition('SKOLEMAAAV3',one) = one,
inference('HYPERRESOLVE',[status(thm)],[11,138]) ).
cnf(152,plain,
c('SKOLEMAAAV3') = 'SKOLEMAAAV1'('SKOLEMAAAV3'),
inference('HYPERRESOLVE',[status(thm)],[20,146,22]) ).
cnf(158,plain,
X = addition(multiplication(c('SKOLEMAAAV3'),X),multiplication('SKOLEMAAAV3',X)),
inference('REWRITE',[status(thm)],[142,152,theory(equality)]) ).
cnf(168,plain,
~ complement(addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),'SKOLEMAAAV2'),addition(multiplication(c('SKOLEMAAAV2'),c('SKOLEMAAAV3')),multiplication(c('SKOLEMAAAV2'),'SKOLEMAAAV3'))),
inference('REWRITE',[status(thm)],[73,158,theory(equality)]) ).
cnf(175,plain,
X = addition(multiplication(X,c('SKOLEMAAAV3')),multiplication(X,'SKOLEMAAAV3')),
inference('REWRITE',[status(thm)],[144,152,theory(equality)]) ).
cnf(178,plain,
~ complement(addition(multiplication('SKOLEMAAAV2','SKOLEMAAAV3'),'SKOLEMAAAV2'),c('SKOLEMAAAV2')),
inference('REWRITE',[status(thm)],[168,175,theory(equality)]) ).
cnf(285,plain,
X = addition(multiplication(X,'SKOLEMAAAV3'),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.06/0.12 % Problem : KLE011+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n008.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 10:22:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.47 #<PACKAGE "SNARK-USER">
% 0.18/0.47 *
% 0.18/0.47 SNARK-TPTP-OPTIONS
% 0.18/0.47 *
% 0.18/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47 (USE-FACTORING :POS)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47 *
% 0.18/0.47 "."
% 0.18/0.47 *
% 0.18/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T10:22:22
% 0.18/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-06-16T10:22:22
% 0.18/0.48
% 0.18/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.18/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.18/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.18/0.48 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.18/0.48 ; Declaring addition to be commutative.
% 0.46/0.63 ; Declaring addition to be associative-commutative.
% 0.46/0.63
% 0.46/0.63 #||
% 0.46/0.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.63 % SZS output start Refutation
% See solution above
% 0.46/0.63 ||#
% 0.46/0.63
% 0.46/0.63 ; Summary of computation:
% 0.46/0.63 ; 976 formulas have been input or derived (from 78 formulas).
% 0.46/0.63 ; 287 (29%) were retained. Of these,
% 0.46/0.63 ; 88 (31%) were simplified or subsumed later,
% 0.46/0.63 ; 199 (69%) are still being kept.
% 0.46/0.63 ;
% 0.46/0.63 ; Run time in seconds excluding printing time:
% 0.46/0.63 ; 0.004 2% Read assertion file (1 call)
% 0.46/0.63 ; 0.001 1% Assert (17 calls)
% 0.46/0.63 ; 0.029 18% Process new row (890 calls)
% 0.46/0.63 ; 0.007 4% Resolution (154 calls)
% 0.46/0.63 ; 0.011 7% Paramodulation (77 calls)
% 0.46/0.63 ; 0.000 0% Factoring (1 call)
% 0.46/0.63 ; 0.000 0% Embedding (28 calls)
% 0.46/0.63 ; 0.024 15% Condensing (144 calls)
% 0.46/0.63 ; 0.004 2% Forward subsumption (144 calls)
% 0.46/0.63 ; 0.002 1% Backward subsumption (77 calls)
% 0.46/0.63 ; 0.005 3% Clause clause subsumption (262 calls)
% 0.46/0.63 ; 0.041 25% Forward simplification (841 calls)
% 0.46/0.63 ; 0.007 4% Backward simplification (261 calls)
% 0.46/0.63 ; 0.002 1% Ordering (566 calls)
% 0.46/0.63 ; 0.000 0% Ordering ac (67 calls)
% 0.46/0.63 ; 0.000 0% Sortal reasoning (32 calls)
% 0.46/0.63 ; 0.000 0% Purity testing (1 call)
% 0.46/0.63 ; 0.027 16% Other
% 0.46/0.63 ; 0.164 Total
% 0.46/0.63 ; 0.167 Real time
% 0.46/0.63 ;
% 0.46/0.63 ; Term-hash-array has 614 terms in all.
% 0.46/0.63 ; Feature-vector-row-index has 67 entries (67 at peak, 77 added, 10 deleted).
% 0.46/0.63 ; Feature-vector-row-index has 370 nodes (370 at peak, 440 added, 70 deleted).
% 0.46/0.63 ; Retrieved 321 possibly forward subsuming rows in 144 calls.
% 0.46/0.63 ; Retrieved 27 possibly backward subsumed rows in 77 calls.
% 0.46/0.63 ; Path-index has 477 entries (481 at peak, 635 added, 158 deleted).
% 0.46/0.63 ; Path-index has 395 nodes (395 at peak, 467 added, 72 deleted).
% 0.46/0.63 ; Trie-index has 477 entries (481 at peak, 635 added, 158 deleted).
% 0.46/0.63 ; Trie-index has 433 nodes (436 at peak, 565 added, 132 deleted).
% 0.46/0.63 ; Retrieved 17,375 generalization terms in 5,212 calls.
% 0.46/0.63 ; Retrieved 285 instance terms in 201 calls.
% 0.46/0.63 ; Retrieved 4,346 unifiable terms in 757 calls.
% 0.46/0.63 ;
% 0.46/0.63 ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.46/0.63 ; 3 with value 0
% 0.46/0.63 ; The agenda of rows to process has 2 entries:
% 0.46/0.63 ; 2 with value 27
% 0.46/0.63 ; The agenda of rows to give has 132 entries:
% 0.46/0.63 ; 11 with value (4 11) 13 with value (4 20) 4 with value (4 38)
% 0.46/0.63 ; 6 with value (4 12) 7 with value (4 21) 4 with value (4 39)
% 0.46/0.63 ; 11 with value (4 13) 2 with value (4 23) 2 with value (4 41)
% 0.46/0.63 ; 10 with value (4 14) 2 with value (4 25) 2 with value (4 51)
% 0.46/0.63 ; 11 with value (4 15) 2 with value (4 27) 5 with value (4 59)
% 0.46/0.63 ; 4 with value (4 16) 10 with value (4 28) 1 with value (4 61)
% 0.46/0.63 ; 8 with value (4 17) 4 with value (4 33) 2 with value (4 79)
% 0.46/0.63 ; 6 with value (4 19) 4 with value (4 36) 1 with value (4 107)
% 0.46/0.63 Evaluation took:
% 0.46/0.63 0.168 seconds of real time
% 0.46/0.63 0.153453 seconds of user run time
% 0.46/0.63 0.014147 seconds of system run time
% 0.46/0.63 0 calls to %EVAL
% 0.46/0.63 0 page faults and
% 0.46/0.63 12,284,520 bytes consed.
% 0.46/0.63 :PROOF-FOUND
% 0.46/0.63 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T10:22:23
% 0.46/0.63 :PROOF-FOUND
% 0.46/0.63 *
%------------------------------------------------------------------------------