TSTP Solution File: KLE081+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE081+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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 65.55s 65.72s
% Output : Refutation 65.55s
% 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 : 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 : 67 ( 10 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(4,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
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(10,axiom,
multiplication(zero,X) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
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,
addition(X,multiplication(domain(X),X)) = multiplication(domain(X),X),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
cnf(15,axiom,
domain(multiplication(X,Y)) = domain(multiplication(X,domain(Y))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
cnf(16,axiom,
addition(domain(X),one) = one,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
cnf(21,negated_conjecture,
addition(domain(X),antidomain(X)) = one,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(24,negated_conjecture,
multiplication(antidomain('SKOLEMAAAV1'),'SKOLEMAAAV1') != zero,
file('/export/starexec/sandbox/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(57,plain,
multiplication(domain(X),multiplication(antidomain(X),Y)) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,23,theory(equality)]),10,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(5521,plain,
antidomain(antidomain(antidomain(X))) = antidomain(X),
inference('REWRITE',[status(thm)],[5073,5226,theory(equality)]) ).
cnf(6747,plain,
multiplication(antidomain(antidomain(X)),multiplication(antidomain(X),Y)) = zero,
inference('REWRITE',[status(thm)],[57,5226,theory(equality)]) ).
cnf(6748,plain,
multiplication(antidomain(antidomain(X)),X) = X,
inference('REWRITE',[status(thm)],[177,5226,theory(equality)]) ).
cnf(7675,plain,
multiplication(antidomain(X),X) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6747,6748,theory(equality)]),5521,theory(equality)]) ).
cnf(7676,plain,
$false,
inference('REWRITE',[status(thm)],[24,7675,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE081+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n019.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 16:25:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:25:39
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-16T16:25:39
% 0.19/0.48
% 0.19/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.19/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.19/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.19/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.19/0.48 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.19/0.48 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.19/0.48 ; Declaring addition to be commutative.
% 65.55/65.72 ; Declaring addition to be associative-commutative.
% 65.55/65.72
% 65.55/65.72 #||
% 65.55/65.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 65.55/65.72 % SZS output start Refutation
% See solution above
% 65.55/65.75 ||#
% 65.55/65.75
% 65.55/65.75 ; Summary of computation:
% 65.55/65.75 ; 48163 formulas have been input or derived (from 301 formulas).
% 65.55/65.75 ; 7676 (16%) were retained. Of these,
% 65.55/65.75 ; 5531 (72%) were simplified or subsumed later,
% 65.55/65.75 ; 2145 (28%) are still being kept.
% 65.55/65.75 ;
% 65.55/65.75 ; Run time in seconds excluding printing time:
% 65.55/65.75 ; 0.005 0% Read assertion file (1 call)
% 65.55/65.75 ; 0.001 0% Assert (18 calls)
% 65.55/65.75 ; 1.075 2% Process new row (46,237 calls)
% 65.55/65.75 ; 0.052 0% Resolution (600 calls)
% 65.55/65.75 ; 0.573 1% Paramodulation (300 calls)
% 65.55/65.75 ; 0.008 0% Embedding (539 calls)
% 65.55/65.75 ; 0.053 0% Condensing (2,123 calls)
% 65.55/65.75 ; 0.108 0% Forward subsumption (2,123 calls)
% 65.55/65.75 ; 0.014 0% Backward subsumption (640 calls)
% 65.55/65.75 ; 0.029 0% Clause clause subsumption (6,858 calls)
% 65.55/65.75 ; 61.517 94% Forward simplification (45,583 calls)
% 65.55/65.75 ; 1.256 2% Backward simplification (7,148 calls)
% 65.55/65.75 ; 0.214 0% Ordering (54,653 calls)
% 65.55/65.75 ; 0.168 0% Ordering ac (10,448 calls)
% 65.55/65.75 ; 0.000 0% Sortal reasoning (32 calls)
% 65.55/65.75 ; 0.000 0% Purity testing (1 call)
% 65.55/65.75 ; 0.180 0% Other
% 65.55/65.75 ; 65.253 Total
% 65.55/65.75 ; 65.287 Real time
% 65.55/65.75 ;
% 65.55/65.75 ; Term-hash-array has 17,053 terms in all.
% 65.55/65.75 ; Feature-vector-row-index has 223 entries (397 at peak, 640 added, 417 deleted).
% 65.55/65.75 ; Feature-vector-row-index has 1,247 nodes (2,212 at peak, 3,773 added, 2,526 deleted).
% 65.55/65.75 ; Retrieved 9,796 possibly forward subsuming rows in 2,123 calls.
% 65.55/65.75 ; Retrieved 1,241 possibly backward subsumed rows in 640 calls.
% 65.55/65.75 ; Path-index has 5,561 entries (10,191 at peak, 17,967 added, 12,406 deleted).
% 65.55/65.75 ; Path-index has 5,978 nodes (6,086 at peak, 8,426 added, 2,448 deleted).
% 65.55/65.75 ; Trie-index has 5,561 entries (10,191 at peak, 17,967 added, 12,406 deleted).
% 65.55/65.75 ; Trie-index has 4,137 nodes (6,008 at peak, 11,530 added, 7,393 deleted).
% 65.55/65.75 ; Retrieved 36,047,392 generalization terms in 385,870 calls.
% 65.55/65.75 ; Retrieved 75,253 instance terms in 6,584 calls.
% 65.55/65.75 ; Retrieved 77,559 unifiable terms in 2,293 calls.
% 65.55/65.75 ;
% 65.55/65.75 ; The agenda of rows to process has 20 entries:
% 65.55/65.75 ; 3 with value 16 4 with value 19 1 with value 22
% 65.55/65.75 ; 5 with value 17 2 with value 21 2 with value 23
% 65.55/65.75 ; 3 with value 18
% 65.55/65.75 ; The agenda of rows to give has 2076 entries:
% 65.55/65.75 ; 1 with value (4 11) 135 with value (4 29) 38 with value (4 43)
% 65.55/65.75 ; 1 with value (4 15) 113 with value (4 30) 30 with value (4 44)
% 65.55/65.75 ; 4 with value (4 16) 112 with value (4 31) 31 with value (4 45)
% 65.55/65.75 ; 1 with value (4 17) 147 with value (4 32) 19 with value (4 46)
% 65.55/65.75 ; 8 with value (4 18) 64 with value (4 33) 32 with value (4 47)
% 65.55/65.75 ; 26 with value (4 19) 94 with value (4 34) 17 with value (4 48)
% 65.55/65.75 ; 27 with value (4 20) 74 with value (4 35) 13 with value (4 49)
% 65.55/65.75 ; 32 with value (4 21) 54 with value (4 36) 19 with value (4 50)
% 65.55/65.75 ; 69 with value (4 22) 64 with value (4 37) 7 with value (4 51)
% 65.55/65.75 ; 53 with value (4 23) 56 with value (4 38) 26 with value (4 52)
% 65.55/65.75 ; 91 with value (4 24) 70 with value (4 39) 1 with value (4 53)
% 65.55/65.75 ; 92 with value (4 25) 44 with value (4 40) 16 with value (4 54)
% 65.55/65.75 ; 122 with value (4 26) 58 with value (4 41) 4 with value (4 55)
% 65.55/65.75 ; 91 with value (4 27) 24 with value (4 42) 2 with value (4 59)
% 65.55/65.75 ; 94 with value (4 28)
% 65.55/65.75 Evaluation took:
% 65.55/65.75 65.288 seconds of real time
% 65.55/65.75 64.68887 seconds of user run time
% 65.55/65.75 0.591133 seconds of system run time
% 65.55/65.75 [Run times include 4.035 seconds GC run time.]
% 65.55/65.75 0 calls to %EVAL
% 65.55/65.75 0 page faults and
% 65.55/65.75 7,749,269,792 bytes consed.
% 65.55/65.75 :PROOF-FOUND
% 65.55/65.75 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:26:45
% 65.55/65.75 :PROOF-FOUND
% 65.55/65.75 *
%------------------------------------------------------------------------------