TSTP Solution File: KLE089+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE089+1 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n096.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:19 EDT 2016
% Result : Theorem 1.51s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 7 RR)
% Number of literals : 22 ( 21 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
addition(X,zero) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
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(4,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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(10,axiom,
multiplication(zero,X) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
cnf(13,axiom,
multiplication(antidomain(X),X) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).
cnf(16,axiom,
addition(antidomain(antidomain(X)),antidomain(X)) = one,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).
cnf(25,negated_conjecture,
addition(domain('SKOLEMAAAN1'),antidomain('SKOLEMAAAN2')) = antidomain('SKOLEMAAAN2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(26,plain,
addition(antidomain(antidomain('SKOLEMAAAN1')),antidomain('SKOLEMAAAN2')) = antidomain('SKOLEMAAAN2'),
inference('REWRITE',[status(thm)],[25,18,theory(equality)]) ).
cnf(27,plain,
addition(antidomain(antidomain('SKOLEMAAAN1')),addition(antidomain('SKOLEMAAAN2'),X)) = addition(antidomain('SKOLEMAAAN2'),X),
inference('EMBED',[status(thm)],[26]) ).
cnf(28,negated_conjecture,
multiplication(domain('SKOLEMAAAN1'),'SKOLEMAAAN2') != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(29,plain,
multiplication(antidomain(antidomain('SKOLEMAAAN1')),'SKOLEMAAAN2') != zero,
inference('REWRITE',[status(thm)],[28,18,theory(equality)]) ).
cnf(40,plain,
addition(one,antidomain(X)) = one,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,17,theory(equality)]),16,theory(equality)]) ).
cnf(61,plain,
addition(antidomain('SKOLEMAAAN2'),antidomain('SKOLEMAAAN1')) = one,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,27,theory(equality)]),40,theory(equality)]) ).
cnf(71,plain,
multiplication(antidomain(X),multiplication(X,Y)) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,13,theory(equality)]),10,theory(equality)]) ).
cnf(219,plain,
X = addition(multiplication(antidomain('SKOLEMAAAN2'),X),multiplication(antidomain('SKOLEMAAAN1'),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,61,theory(equality)]),6,theory(equality)]) ).
cnf(913,plain,
'SKOLEMAAAN2' = multiplication(antidomain('SKOLEMAAAN1'),'SKOLEMAAAN2'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[219,13,theory(equality)]),1,theory(equality)]) ).
cnf(935,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[71,913,theory(equality)]),29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE089+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : run-snark %s %d
% 0.02/0.23 % Computer : n096.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 20:25:34 CDT 2016
% 0.02/0.23 % CPUTime :
% 0.02/0.26 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 *
% 0.02/0.27 *
% 0.02/0.27 #<PACKAGE "SNARK-USER">
% 0.02/0.27 *
% 0.02/0.27 SNARK-TPTP-OPTIONS
% 0.02/0.27 *
% 0.02/0.27 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.02/0.27 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.02/0.27 (USE-FACTORING :POS)
% 0.02/0.27 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.02/0.27 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.02/0.27 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.02/0.27 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.02/0.27 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.02/0.27 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.02/0.27 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.02/0.27 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.02/0.27 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.02/0.27 (DECLARE-TPTP-SYMBOLS2))
% 0.02/0.27 *
% 0.02/0.27 "."
% 0.02/0.27 *
% 0.02/0.27 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2016-04-22T20:25:34
% 0.02/0.27 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n096.star.cs.uiowa.edu at 2016-04-22T20:25:34
% 0.02/0.28
% 0.02/0.28 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.02/0.28 ; 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 ; Recognized possible left inverse assertion (= (|multiplication| (|antidomain| ?X) ?X) |zero|).
% 0.02/0.29 ; Recognized possible right inverse assertion (= (|multiplication| ?X (|coantidomain| ?X)) |zero|).
% 0.02/0.29 ; Declaring addition to be commutative.
% 1.51/1.70 ; Declaring addition to be associative-commutative.
% 1.51/1.70
% 1.51/1.70 #||
% 1.51/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/1.70 % SZS output start Refutation
% See solution above
% 1.51/1.71 % SZS output end Refutation
% 1.51/1.71 ||#
% 1.51/1.71
% 1.51/1.71 ; Summary of computation:
% 1.51/1.71 ; 6523 formulas have been input or derived (from 120 formulas).
% 1.51/1.71 ; 935 (14%) were retained. Of these,
% 1.51/1.71 ; 34 ( 4%) were simplified or subsumed later,
% 1.51/1.71 ; 901 (96%) are still being kept.
% 1.51/1.71 ;
% 1.51/1.71 ; Run time in seconds excluding printing time:
% 1.51/1.71 ; 0.004 0% Read assertion file (1 call)
% 1.51/1.71 ; 0.001 0% Assert (21 calls)
% 1.51/1.71 ; 0.119 8% Process new row (6,187 calls)
% 1.51/1.71 ; 0.013 1% Resolution (238 calls)
% 1.51/1.71 ; 0.129 9% Paramodulation (119 calls)
% 1.51/1.71 ; 0.001 0% Embedding (138 calls)
% 1.51/1.71 ; 0.016 1% Condensing (468 calls)
% 1.51/1.71 ; 0.019 1% Forward subsumption (468 calls)
% 1.51/1.71 ; 0.009 1% Backward subsumption (143 calls)
% 1.51/1.71 ; 0.015 1% Clause clause subsumption (1,266 calls)
% 1.51/1.71 ; 1.023 71% Forward simplification (6,029 calls)
% 1.51/1.71 ; 0.025 2% Backward simplification (798 calls)
% 1.51/1.71 ; 0.013 1% Ordering (4,377 calls)
% 1.51/1.71 ; 0.009 1% Ordering ac (869 calls)
% 1.51/1.71 ; 0.001 0% Sortal reasoning (32 calls)
% 1.51/1.71 ; 0.000 0% Purity testing (1 call)
% 1.51/1.71 ; 0.034 2% Other
% 1.51/1.71 ; 1.431 Total
% 1.51/1.71 ; 1.431 Real time
% 1.51/1.71 ;
% 1.51/1.71 ; Term-hash-array has 2,091 terms in all.
% 1.51/1.71 ; Feature-vector-row-index has 143 entries (143 at peak, 143 added, 0 deleted).
% 1.51/1.71 ; Feature-vector-row-index has 1,059 nodes (1,059 at peak, 1,059 added, 0 deleted).
% 1.51/1.71 ; Retrieved 1,802 possibly forward subsuming rows in 468 calls.
% 1.51/1.71 ; Retrieved 66 possibly backward subsumed rows in 143 calls.
% 1.51/1.71 ; Path-index has 2,006 entries (2,006 at peak, 2,107 added, 101 deleted).
% 1.51/1.71 ; Path-index has 1,534 nodes (1,534 at peak, 1,594 added, 60 deleted).
% 1.51/1.71 ; Trie-index has 2,006 entries (2,006 at peak, 2,107 added, 101 deleted).
% 1.51/1.71 ; Trie-index has 1,900 nodes (1,900 at peak, 2,022 added, 122 deleted).
% 1.51/1.71 ; Retrieved 1,144,506 generalization terms in 41,745 calls.
% 1.51/1.71 ; Retrieved 1,533 instance terms in 672 calls.
% 1.51/1.71 ; Retrieved 17,264 unifiable terms in 812 calls.
% 1.51/1.71 ;
% 1.51/1.71 ; The agenda of rows to process has 9 entries:
% 1.51/1.71 ; 2 with value 16 1 with value 19 1 with value 28
% 1.51/1.71 ; 1 with value 17 1 with value 20 1 with value 29
% 1.51/1.71 ; 2 with value 18
% 1.51/1.71 ; The agenda of rows to give has 785 entries:
% 1.51/1.71 ; 1 with value (4 12) 44 with value (4 25) 5 with value (4 35)
% 1.51/1.71 ; 2 with value (4 16) 33 with value (4 26) 4 with value (4 36)
% 1.51/1.71 ; 36 with value (4 17) 36 with value (4 27) 4 with value (4 38)
% 1.51/1.71 ; 61 with value (4 18) 38 with value (4 28) 2 with value (4 39)
% 1.51/1.71 ; 75 with value (4 19) 11 with value (4 29) 4 with value (4 40)
% 1.51/1.71 ; 77 with value (4 20) 27 with value (4 30) 4 with value (4 42)
% 1.51/1.71 ; 73 with value (4 21) 23 with value (4 31) 2 with value (4 44)
% 1.51/1.71 ; 58 with value (4 22) 40 with value (4 32) 2 with value (4 45)
% 1.51/1.71 ; 41 with value (4 23) 14 with value (4 33) 2 with value (4 47)
% 1.51/1.71 ; 39 with value (4 24) 25 with value (4 34) 2 with value (4 48)
% 1.51/1.71 Evaluation took:
% 1.51/1.71 1.432 seconds of real time
% 1.51/1.71 1.37795 seconds of user run time
% 1.51/1.71 0.054995 seconds of system run time
% 1.51/1.71 [Run times include 0.041 seconds GC run time.]
% 1.51/1.71 0 calls to %EVAL
% 1.51/1.71 0 page faults and
% 1.51/1.71 83,311,040 bytes consed.
% 1.51/1.71:PROOF-FOUND
% 1.51/1.71 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2016-04-22T20:25:35
% 1.51/1.71:PROOF-FOUND
% 1.51/1.71 *
%------------------------------------------------------------------------------