TSTP Solution File: KLE080+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE080+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:32 EDT 2022
% Result : Theorem 91.73s 91.99s
% Output : Refutation 91.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 42 ( 40 unt; 0 nHn; 5 RR)
% Number of literals : 44 ( 38 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 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,
antidomain(antidomain('SKOLEMAAAV1')) != domain('SKOLEMAAAV1'),
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(210,plain,
X = addition(X,multiplication(X,antidomain(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,26,theory(equality)]),5,theory(equality)]) ).
cnf(218,plain,
multiplication(domain(X),antidomain(domain(X))) = zero,
inference('PARAMODULATE',[status(thm)],[23,63,theory(equality)]) ).
cnf(456,plain,
leq(multiplication(X,antidomain(Y)),X),
inference('HYPERRESOLVE',[status(thm)],[12,210]) ).
cnf(625,plain,
leq(multiplication(X,antidomain(Y)),multiplication(X,domain(antidomain(Y)))),
inference('PARAMODULATE',[status(thm)],[456,194,theory(equality)]) ).
cnf(911,plain,
antidomain(X) = multiplication(antidomain(X),antidomain(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,23,theory(equality)]),1,theory(equality)]) ).
cnf(4485,plain,
leq(antidomain(X),multiplication(antidomain(X),domain(antidomain(X)))),
inference('PARAMODULATE',[status(thm)],[625,911,theory(equality)]) ).
cnf(5026,plain,
antidomain(X) = multiplication(antidomain(X),domain(antidomain(X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,4485]),127,theory(equality)]) ).
cnf(5054,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(5070,plain,
domain(X) = multiplication(domain(X),antidomain(antidomain(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[130,5054,theory(equality)]),1,theory(equality)]) ).
cnf(5073,plain,
domain(antidomain(X)) = antidomain(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,5054,theory(equality)]),1,5026,theory(equality)]) ).
cnf(5120,plain,
multiplication(antidomain(X),antidomain(antidomain(X))) = zero,
inference('PARAMODULATE',[status(thm)],[218,5073,theory(equality)]) ).
cnf(5226,plain,
antidomain(antidomain(X)) = domain(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,5070,theory(equality)]),1,5120,theory(equality)]) ).
cnf(7650,plain,
$false,
inference('REWRITE',[status(thm)],[24,5226,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE080+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 10:00:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T10:00:16
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-16T10:00:16
% 0.19/0.49
% 0.19/0.49 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.19/0.49 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.19/0.49 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.19/0.49 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.19/0.49 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.19/0.49 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.19/0.49 ; Declaring addition to be commutative.
% 91.73/91.99 ; Declaring addition to be associative-commutative.
% 91.73/91.99
% 91.73/91.99 #||
% 91.73/91.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 91.73/91.99 % SZS output start Refutation
% See solution above
% 91.73/92.00 ||#
% 91.73/92.00
% 91.73/92.00 ; Summary of computation:
% 91.73/92.00 ; 47585 formulas have been input or derived (from 293 formulas).
% 91.73/92.00 ; 7650 (16%) were retained. Of these,
% 91.73/92.00 ; 5426 (71%) were simplified or subsumed later,
% 91.73/92.00 ; 2224 (29%) are still being kept.
% 91.73/92.00 ;
% 91.73/92.00 ; Run time in seconds excluding printing time:
% 91.73/92.00 ; 0.004 0% Read assertion file (1 call)
% 91.73/92.00 ; 0.002 0% Assert (18 calls)
% 91.73/92.00 ; 1.383 2% Process new row (45,666 calls)
% 91.73/92.00 ; 0.051 0% Resolution (584 calls)
% 91.73/92.00 ; 0.627 1% Paramodulation (292 calls)
% 91.73/92.00 ; 0.011 0% Embedding (536 calls)
% 91.73/92.00 ; 0.067 0% Condensing (2,100 calls)
% 91.73/92.00 ; 0.143 0% Forward subsumption (2,100 calls)
% 91.73/92.00 ; 0.025 0% Backward subsumption (640 calls)
% 91.73/92.00 ; 0.041 0% Clause clause subsumption (6,816 calls)
% 91.73/92.00 ; 86.870 95% Forward simplification (45,090 calls)
% 91.73/92.00 ; 1.463 2% Backward simplification (7,125 calls)
% 91.73/92.00 ; 0.321 0% Ordering (54,256 calls)
% 91.73/92.00 ; 0.205 0% Ordering ac (10,395 calls)
% 91.73/92.00 ; 0.001 0% Sortal reasoning (32 calls)
% 91.73/92.00 ; 0.000 0% Purity testing (1 call)
% 91.73/92.00 ; 0.211 0% Other
% 91.73/92.00 ; 91.425 Total
% 91.73/92.00 ; 91.524 Real time
% 91.73/92.00 ;
% 91.73/92.00 ; Term-hash-array has 16,978 terms in all.
% 91.73/92.00 ; Feature-vector-row-index has 239 entries (397 at peak, 640 added, 401 deleted).
% 91.73/92.00 ; Feature-vector-row-index has 1,396 nodes (2,212 at peak, 3,773 added, 2,377 deleted).
% 91.73/92.00 ; Retrieved 9,698 possibly forward subsuming rows in 2,100 calls.
% 91.73/92.00 ; Retrieved 1,241 possibly backward subsumed rows in 640 calls.
% 91.73/92.00 ; Path-index has 5,803 entries (10,192 at peak, 17,891 added, 12,088 deleted).
% 91.73/92.00 ; Path-index has 6,043 nodes (6,043 at peak, 8,359 added, 2,316 deleted).
% 91.73/92.00 ; Trie-index has 5,803 entries (10,192 at peak, 17,891 added, 12,088 deleted).
% 91.73/92.00 ; Trie-index has 4,413 nodes (6,009 at peak, 11,437 added, 7,024 deleted).
% 91.73/92.00 ; Retrieved 35,912,290 generalization terms in 383,090 calls.
% 91.73/92.00 ; Retrieved 74,616 instance terms in 6,561 calls.
% 91.73/92.00 ; Retrieved 75,006 unifiable terms in 2,237 calls.
% 91.73/92.00 ;
% 91.73/92.00 ; The agenda of rows to process has 21 entries:
% 91.73/92.00 ; 7 with value 22 3 with value 25 1 with value 28
% 91.73/92.00 ; 1 with value 23 2 with value 26 1 with value 29
% 91.73/92.00 ; 3 with value 24 1 with value 27 2 with value 31
% 91.73/92.00 ; The agenda of input rows to give has 4 entries:
% 91.73/92.00 ; 1 with value 11 1 with value 12 2 with value 19
% 91.73/92.00 ; The agenda of rows to give has 2155 entries:
% 91.73/92.00 ; 1 with value (4 13) 95 with value (4 28) 38 with value (4 43)
% 91.73/92.00 ; 1 with value (4 14) 140 with value (4 29) 31 with value (4 44)
% 91.73/92.00 ; 2 with value (4 15) 115 with value (4 30) 31 with value (4 45)
% 91.73/92.00 ; 4 with value (4 16) 114 with value (4 31) 20 with value (4 46)
% 91.73/92.00 ; 1 with value (4 17) 155 with value (4 32) 32 with value (4 47)
% 91.73/92.00 ; 8 with value (4 18) 66 with value (4 33) 18 with value (4 48)
% 91.73/92.00 ; 26 with value (4 19) 98 with value (4 34) 13 with value (4 49)
% 91.73/92.00 ; 25 with value (4 20) 76 with value (4 35) 19 with value (4 50)
% 91.73/92.00 ; 35 with value (4 21) 54 with value (4 36) 7 with value (4 51)
% 91.73/92.00 ; 69 with value (4 22) 70 with value (4 37) 26 with value (4 52)
% 91.73/92.00 ; 53 with value (4 23) 62 with value (4 38) 1 with value (4 53)
% 91.73/92.00 ; 94 with value (4 24) 72 with value (4 39) 16 with value (4 54)
% 91.73/92.00 ; 99 with value (4 25) 45 with value (4 40) 4 with value (4 55)
% 91.73/92.00 ; 128 with value (4 26) 60 with value (4 41) 2 with value (4 59)
% 91.73/92.00 ; 99 with value (4 27) 30 with value (4 42)
% 91.73/92.00 Evaluation took:
% 91.73/92.00 91.525 seconds of real time
% 91.73/92.00 90.746994 seconds of user run time
% 91.73/92.00 0.682302 seconds of system run time
% 91.73/92.00 [Run times include 5.136 seconds GC run time.]
% 91.73/92.00 0 calls to %EVAL
% 91.73/92.00 0 page faults and
% 91.73/92.00 7,725,952,080 bytes consed.
% 91.73/92.00 :PROOF-FOUND
% 91.73/92.00 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T10:01:47
% 91.73/92.00 :PROOF-FOUND
% 91.73/92.00 *
%------------------------------------------------------------------------------