TSTP Solution File: KLE078+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE078+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 52.19s 52.39s
% Output : Refutation 52.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 36 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 38 ( 32 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 : 53 ( 8 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,
domain(antidomain('SKOLEMAAAV1')) != antidomain('SKOLEMAAAV1'),
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(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(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(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(5073,plain,
domain(antidomain(X)) = antidomain(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,5054,theory(equality)]),1,5026,theory(equality)]) ).
cnf(5117,plain,
$false,
inference('REWRITE',[status(thm)],[24,5073,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE078+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 10:24:44 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.51 #<PACKAGE "SNARK-USER">
% 0.21/0.51 *
% 0.21/0.51 SNARK-TPTP-OPTIONS
% 0.21/0.51 *
% 0.21/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51 (USE-FACTORING :POS)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51 *
% 0.21/0.51 "."
% 0.21/0.51 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T10:24:45
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-16T10:24:45
% 0.21/0.52
% 0.21/0.52 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.21/0.52 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.21/0.52 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.21/0.52 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.21/0.52 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.21/0.52 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.21/0.52 ; Declaring addition to be commutative.
% 52.19/52.39 ; Declaring addition to be associative-commutative.
% 52.19/52.39
% 52.19/52.39 #||
% 52.19/52.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 52.19/52.39 % SZS output start Refutation
% See solution above
% 52.19/52.39 ||#
% 52.19/52.39
% 52.19/52.39 ; Summary of computation:
% 52.19/52.39 ; 43057 formulas have been input or derived (from 291 formulas).
% 52.19/52.39 ; 5117 (12%) were retained. Of these,
% 52.19/52.39 ; 633 (12%) were simplified or subsumed later,
% 52.19/52.39 ; 4484 (88%) are still being kept.
% 52.19/52.39 ;
% 52.19/52.39 ; Run time in seconds excluding printing time:
% 52.19/52.39 ; 0.004 0% Read assertion file (1 call)
% 52.19/52.39 ; 0.001 0% Assert (18 calls)
% 52.19/52.39 ; 0.774 1% Process new row (41,140 calls)
% 52.19/52.39 ; 0.065 0% Resolution (580 calls)
% 52.19/52.39 ; 0.575 1% Paramodulation (290 calls)
% 52.19/52.39 ; 0.003 0% Embedding (405 calls)
% 52.19/52.39 ; 0.047 0% Condensing (1,759 calls)
% 52.19/52.39 ; 0.076 0% Forward subsumption (1,759 calls)
% 52.19/52.39 ; 0.021 0% Backward subsumption (427 calls)
% 52.19/52.39 ; 0.035 0% Clause clause subsumption (4,653 calls)
% 52.19/52.39 ; 49.283 95% Forward simplification (40,724 calls)
% 52.19/52.39 ; 0.518 1% Backward simplification (4,721 calls)
% 52.19/52.39 ; 0.179 0% Ordering (43,661 calls)
% 52.19/52.39 ; 0.128 0% Ordering ac (8,039 calls)
% 52.19/52.39 ; 0.001 0% Sortal reasoning (32 calls)
% 52.19/52.39 ; 0.000 0% Purity testing (1 call)
% 52.19/52.39 ; 0.168 0% Other
% 52.19/52.39 ; 51.878 Total
% 52.19/52.39 ; 51.886 Real time
% 52.19/52.39 ;
% 52.19/52.39 ; Term-hash-array has 10,983 terms in all.
% 52.19/52.39 ; Feature-vector-row-index has 372 entries (397 at peak, 427 added, 55 deleted).
% 52.19/52.39 ; Feature-vector-row-index has 2,093 nodes (2,212 at peak, 2,509 added, 416 deleted).
% 52.19/52.39 ; Retrieved 7,830 possibly forward subsuming rows in 1,759 calls.
% 52.19/52.39 ; Retrieved 346 possibly backward subsumed rows in 427 calls.
% 52.19/52.39 ; Path-index has 9,684 entries (10,191 at peak, 11,092 added, 1,408 deleted).
% 52.19/52.39 ; Path-index has 4,439 nodes (4,655 at peak, 4,809 added, 370 deleted).
% 52.19/52.39 ; Trie-index has 9,684 entries (10,191 at peak, 11,092 added, 1,408 deleted).
% 52.19/52.39 ; Trie-index has 5,424 nodes (6,007 at peak, 6,272 added, 848 deleted).
% 52.19/52.39 ; Retrieved 33,435,617 generalization terms in 322,400 calls.
% 52.19/52.39 ; Retrieved 53,548 instance terms in 4,344 calls.
% 52.19/52.39 ; Retrieved 74,738 unifiable terms in 2,224 calls.
% 52.19/52.39 ;
% 52.19/52.39 ; The agenda of rows to process has 25 entries:
% 52.19/52.39 ; 2 with value 20 4 with value 23 2 with value 25
% 52.19/52.39 ; 6 with value 21 2 with value 24 1 with value 27
% 52.19/52.39 ; 8 with value 22
% 52.19/52.39 ; The agenda of rows to give has 4216 entries:
% 52.19/52.39 ; 1 with value (4 12) 284 with value (4 27) 100 with value (4 38)
% 52.19/52.39 ; 1 with value (4 16) 245 with value (4 28) 46 with value (4 39)
% 52.19/52.39 ; 1 with value (4 17) 230 with value (4 29) 33 with value (4 40)
% 52.19/52.39 ; 111 with value (4 19) 180 with value (4 30) 44 with value (4 41)
% 52.19/52.39 ; 169 with value (4 20) 166 with value (4 31) 50 with value (4 42)
% 52.19/52.39 ; 190 with value (4 21) 212 with value (4 32) 30 with value (4 43)
% 52.19/52.39 ; 272 with value (4 22) 147 with value (4 33) 34 with value (4 44)
% 52.19/52.39 ; 277 with value (4 23) 171 with value (4 34) 10 with value (4 45)
% 52.19/52.39 ; 330 with value (4 24) 134 with value (4 35) 32 with value (4 46)
% 52.19/52.39 ; 280 with value (4 25) 102 with value (4 36) 2 with value (4 47)
% 52.19/52.39 ; 242 with value (4 26) 58 with value (4 37) 32 with value (4 48)
% 52.19/52.39 Evaluation took:
% 52.19/52.39 51.887 seconds of real time
% 52.19/52.39 51.40674 seconds of user run time
% 52.19/52.39 0.474935 seconds of system run time
% 52.19/52.39 [Run times include 2.816 seconds GC run time.]
% 52.19/52.39 0 calls to %EVAL
% 52.19/52.39 0 page faults and
% 52.19/52.39 5,892,934,800 bytes consed.
% 52.19/52.39 :PROOF-FOUND
% 52.19/52.39 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T10:25:36
% 52.19/52.39 :PROOF-FOUND
% 52.19/52.39 *
%------------------------------------------------------------------------------