TSTP Solution File: KLE082+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE082+1 : 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:33 EDT 2022
% Result : Theorem 70.79s 71.00s
% Output : Refutation 70.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 47 ( 45 unt; 0 nHn; 5 RR)
% Number of literals : 49 ( 43 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
addition(X,zero) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
cnf(2,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
cnf(4,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
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(10,axiom,
multiplication(zero,X) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
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,
addition(X,multiplication(domain(X),X)) = multiplication(domain(X),X),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
cnf(15,axiom,
domain(multiplication(X,Y)) = domain(multiplication(X,domain(Y))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
cnf(16,axiom,
addition(domain(X),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
cnf(17,plain,
addition(domain(X),addition(one,Y)) = addition(one,Y),
inference('EMBED',[status(thm)],[16]) ).
cnf(18,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain4) ).
cnf(21,negated_conjecture,
addition(domain(X),antidomain(X)) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(22,plain,
addition(domain(X),addition(antidomain(X),Y)) = addition(one,Y),
inference('EMBED',[status(thm)],[21]) ).
cnf(23,negated_conjecture,
multiplication(domain(X),antidomain(X)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(24,negated_conjecture,
addition(antidomain(multiplication('SKOLEMAAAV1','SKOLEMAAAV2')),antidomain(multiplication('SKOLEMAAAV1',domain('SKOLEMAAAV2')))) != antidomain(multiplication('SKOLEMAAAV1',domain('SKOLEMAAAV2'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(26,plain,
one = addition(one,antidomain(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,22,theory(equality)]),2,theory(equality)]) ).
cnf(63,plain,
domain(X) = domain(domain(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,6,theory(equality)]),6,theory(equality)]) ).
cnf(74,plain,
addition(multiplication(X,domain(Y)),multiplication(domain(multiplication(X,Y)),multiplication(X,domain(Y)))) = multiplication(domain(multiplication(X,Y)),multiplication(X,domain(Y))),
inference('PARAMODULATE',[status(thm)],[13,15,theory(equality)]) ).
cnf(127,plain,
X = addition(X,multiplication(X,domain(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]),5,theory(equality)]) ).
cnf(130,plain,
X = addition(multiplication(X,domain(Y)),multiplication(X,antidomain(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,21,theory(equality)]),5,theory(equality)]) ).
cnf(143,plain,
X = addition(X,multiplication(domain(Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,16,theory(equality)]),6,theory(equality)]) ).
cnf(176,plain,
multiplication(X,domain(Y)) = multiplication(domain(multiplication(X,Y)),multiplication(X,domain(Y))),
inference('REWRITE',[status(thm)],[74,143,theory(equality)]) ).
cnf(177,plain,
multiplication(domain(X),X) = X,
inference('REWRITE',[status(thm)],[13,143,theory(equality)]) ).
cnf(184,plain,
X = addition(multiplication(domain(Y),X),multiplication(antidomain(Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,21,theory(equality)]),6,theory(equality)]) ).
cnf(194,plain,
multiplication(X,Y) = multiplication(multiplication(X,domain(Y)),Y),
inference('PARAMODULATE',[status(thm)],[4,177,theory(equality)]) ).
cnf(211,plain,
X = addition(X,multiplication(X,antidomain(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,26,theory(equality)]),5,theory(equality)]) ).
cnf(219,plain,
multiplication(domain(X),antidomain(domain(X))) = zero,
inference('PARAMODULATE',[status(thm)],[23,63,theory(equality)]) ).
cnf(457,plain,
leq(multiplication(X,antidomain(Y)),X),
inference('HYPERRESOLVE',[status(thm)],[12,211]) ).
cnf(626,plain,
leq(multiplication(X,antidomain(Y)),multiplication(X,domain(antidomain(Y)))),
inference('PARAMODULATE',[status(thm)],[457,194,theory(equality)]) ).
cnf(912,plain,
antidomain(X) = multiplication(antidomain(X),antidomain(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,23,theory(equality)]),1,theory(equality)]) ).
cnf(913,plain,
antidomain(domain(X)) = multiplication(antidomain(X),antidomain(domain(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,219,theory(equality)]),1,theory(equality)]) ).
cnf(1692,plain,
antidomain(X) = addition(antidomain(X),antidomain(domain(X))),
inference('PARAMODULATE',[status(thm)],[211,913,theory(equality)]) ).
cnf(1838,plain,
antidomain(multiplication(X,domain(Y))) = addition(antidomain(multiplication(X,domain(Y))),antidomain(domain(multiplication(X,Y)))),
inference('PARAMODULATE',[status(thm)],[1692,15,theory(equality)]) ).
cnf(4486,plain,
leq(antidomain(X),multiplication(antidomain(X),domain(antidomain(X)))),
inference('PARAMODULATE',[status(thm)],[626,912,theory(equality)]) ).
cnf(5027,plain,
antidomain(X) = multiplication(antidomain(X),domain(antidomain(X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,4486]),127,theory(equality)]) ).
cnf(5055,plain,
multiplication(domain(X),domain(antidomain(X))) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[176,23,theory(equality)]),10,18,theory(equality)]) ).
cnf(5071,plain,
domain(X) = multiplication(domain(X),antidomain(antidomain(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[130,5055,theory(equality)]),1,theory(equality)]) ).
cnf(5074,plain,
domain(antidomain(X)) = antidomain(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,5055,theory(equality)]),1,5027,theory(equality)]) ).
cnf(5121,plain,
multiplication(antidomain(X),antidomain(antidomain(X))) = zero,
inference('PARAMODULATE',[status(thm)],[219,5074,theory(equality)]) ).
cnf(5227,plain,
antidomain(antidomain(X)) = domain(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,5071,theory(equality)]),1,5121,theory(equality)]) ).
cnf(5522,plain,
antidomain(antidomain(antidomain(X))) = antidomain(X),
inference('REWRITE',[status(thm)],[5074,5227,theory(equality)]) ).
cnf(6264,plain,
antidomain(multiplication(X,antidomain(antidomain(Y)))) = addition(antidomain(multiplication(X,antidomain(antidomain(Y)))),antidomain(multiplication(X,Y))),
inference('REWRITE',[status(thm)],[1838,5522,5227,theory(equality)]) ).
cnf(7651,plain,
$false,
inference('REWRITE',[status(thm)],[24,6264,5227,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE082+1 : 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 15:25:41 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-16T15:25:42
% 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-16T15:25:42
% 0.20/0.48
% 0.20/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.48 ; 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.
% 70.79/71.00 ; Declaring addition to be associative-commutative.
% 70.79/71.00
% 70.79/71.00 #||
% 70.79/71.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 70.79/71.00 % SZS output start Refutation
% See solution above
% 70.79/71.00 ||#
% 70.79/71.00
% 70.79/71.00 ; Summary of computation:
% 70.79/71.00 ; 47588 formulas have been input or derived (from 294 formulas).
% 70.79/71.00 ; 7651 (16%) were retained. Of these,
% 70.79/71.00 ; 5427 (71%) were simplified or subsumed later,
% 70.79/71.00 ; 2224 (29%) are still being kept.
% 70.79/71.00 ;
% 70.79/71.00 ; Run time in seconds excluding printing time:
% 70.79/71.00 ; 0.005 0% Read assertion file (1 call)
% 70.79/71.00 ; 0.001 0% Assert (18 calls)
% 70.79/71.00 ; 1.130 2% Process new row (45,668 calls)
% 70.79/71.00 ; 0.064 0% Resolution (586 calls)
% 70.79/71.00 ; 0.604 1% Paramodulation (293 calls)
% 70.79/71.00 ; 0.004 0% Embedding (536 calls)
% 70.79/71.00 ; 0.052 0% Condensing (2,100 calls)
% 70.79/71.00 ; 0.107 0% Forward subsumption (2,100 calls)
% 70.79/71.00 ; 0.037 0% Backward subsumption (640 calls)
% 70.79/71.00 ; 0.031 0% Clause clause subsumption (6,816 calls)
% 70.79/71.00 ; 66.578 94% Forward simplification (45,092 calls)
% 70.79/71.00 ; 1.335 2% Backward simplification (7,126 calls)
% 70.79/71.00 ; 0.248 0% Ordering (54,265 calls)
% 70.79/71.00 ; 0.160 0% Ordering ac (10,395 calls)
% 70.79/71.00 ; 0.000 0% Sortal reasoning (32 calls)
% 70.79/71.00 ; 0.000 0% Purity testing (1 call)
% 70.79/71.00 ; 0.185 0% Other
% 70.79/71.00 ; 70.541 Total
% 70.79/71.00 ; 70.539 Real time
% 70.79/71.00 ;
% 70.79/71.00 ; Term-hash-array has 16,982 terms in all.
% 70.79/71.00 ; Feature-vector-row-index has 239 entries (397 at peak, 640 added, 401 deleted).
% 70.79/71.00 ; Feature-vector-row-index has 1,396 nodes (2,212 at peak, 3,773 added, 2,377 deleted).
% 70.79/71.00 ; Retrieved 9,698 possibly forward subsuming rows in 2,100 calls.
% 70.79/71.00 ; Retrieved 1,241 possibly backward subsumed rows in 640 calls.
% 70.79/71.00 ; Path-index has 5,804 entries (10,197 at peak, 17,897 added, 12,093 deleted).
% 70.79/71.00 ; Path-index has 6,044 nodes (6,044 at peak, 8,375 added, 2,331 deleted).
% 70.79/71.00 ; Trie-index has 5,804 entries (10,197 at peak, 17,897 added, 12,093 deleted).
% 70.79/71.00 ; Trie-index has 4,414 nodes (6,022 at peak, 11,452 added, 7,038 deleted).
% 70.79/71.00 ; Retrieved 35,912,429 generalization terms in 383,119 calls.
% 70.79/71.00 ; Retrieved 74,617 instance terms in 6,562 calls.
% 70.79/71.00 ; Retrieved 75,140 unifiable terms in 2,253 calls.
% 70.79/71.00 ;
% 70.79/71.00 ; The agenda of backward simplifiable rows to process has 1 entry:
% 70.79/71.00 ; 1 with value 0
% 70.79/71.00 ; The agenda of rows to process has 21 entries:
% 70.79/71.00 ; 7 with value 22 3 with value 25 1 with value 28
% 70.79/71.00 ; 1 with value 23 2 with value 26 1 with value 29
% 70.79/71.00 ; 3 with value 24 1 with value 27 2 with value 31
% 70.79/71.00 ; The agenda of input rows to give has 4 entries:
% 70.79/71.00 ; 1 with value 11 1 with value 12 2 with value 19
% 70.79/71.00 ; The agenda of rows to give has 2155 entries:
% 70.79/71.00 ; 1 with value (4 13) 95 with value (4 28) 38 with value (4 43)
% 70.79/71.00 ; 1 with value (4 14) 140 with value (4 29) 31 with value (4 44)
% 70.79/71.00 ; 2 with value (4 15) 115 with value (4 30) 31 with value (4 45)
% 70.79/71.00 ; 4 with value (4 16) 114 with value (4 31) 20 with value (4 46)
% 70.79/71.00 ; 1 with value (4 17) 155 with value (4 32) 32 with value (4 47)
% 70.79/71.00 ; 8 with value (4 18) 66 with value (4 33) 18 with value (4 48)
% 70.79/71.00 ; 26 with value (4 19) 98 with value (4 34) 13 with value (4 49)
% 70.79/71.00 ; 25 with value (4 20) 76 with value (4 35) 19 with value (4 50)
% 70.79/71.00 ; 35 with value (4 21) 54 with value (4 36) 7 with value (4 51)
% 70.79/71.00 ; 69 with value (4 22) 70 with value (4 37) 26 with value (4 52)
% 70.79/71.00 ; 53 with value (4 23) 62 with value (4 38) 1 with value (4 53)
% 70.79/71.00 ; 94 with value (4 24) 72 with value (4 39) 16 with value (4 54)
% 70.79/71.00 ; 99 with value (4 25) 45 with value (4 40) 4 with value (4 55)
% 70.79/71.00 ; 128 with value (4 26) 60 with value (4 41) 2 with value (4 59)
% 70.79/71.00 ; 99 with value (4 27) 30 with value (4 42)
% 70.79/71.00 Evaluation took:
% 70.79/71.00 70.54 seconds of real time
% 70.79/71.00 69.93526 seconds of user run time
% 70.79/71.00 0.611258 seconds of system run time
% 70.79/71.00 [Run times include 4.283 seconds GC run time.]
% 70.79/71.00 0 calls to %EVAL
% 70.79/71.00 0 page faults and
% 70.79/71.00 7,726,537,080 bytes consed.
% 70.79/71.00 :PROOF-FOUND
% 70.79/71.00 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T15:26:52
% 70.79/71.00 :PROOF-FOUND
% 70.79/71.00 *
%------------------------------------------------------------------------------