TSTP Solution File: KLE041+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE041+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n017.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:21 EDT 2022
% Result : Theorem 2.20s 2.44s
% Output : Refutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 26 unt; 0 nHn; 11 RR)
% Number of literals : 32 ( 17 equ; 4 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
cnf(3,plain,
addition(X,addition(X,Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[2]) ).
cnf(5,axiom,
multiplication(X,one) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+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/KLE002+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/KLE002+0.ax',left_distributivity) ).
cnf(11,axiom,
( ~ leq(X,Y)
| addition(X,Y) = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
cnf(12,axiom,
( leq(X,Y)
| addition(X,Y) != Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
cnf(13,axiom,
leq(addition(one,multiplication(X,star(X))),star(X)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
cnf(15,axiom,
( ~ leq(addition(multiplication(X,Y),Z),Y)
| leq(multiplication(star(X),Z),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
cnf(17,negated_conjecture,
leq('SKOLEMAAAV1','SKOLEMAAAV2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(18,negated_conjecture,
~ leq(star('SKOLEMAAAV1'),star('SKOLEMAAAV2')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(19,plain,
addition('SKOLEMAAAV1','SKOLEMAAAV2') = 'SKOLEMAAAV2',
inference('HYPERRESOLVE',[status(thm)],[11,17]) ).
cnf(22,plain,
leq(X,X),
inference('HYPERRESOLVE',[status(thm)],[12,2]) ).
cnf(23,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(30,plain,
addition(one,addition(multiplication(X,star(X)),star(X))) = star(X),
inference('HYPERRESOLVE',[status(thm)],[11,13]) ).
cnf(74,plain,
multiplication('SKOLEMAAAV2',X) = addition(multiplication('SKOLEMAAAV1',X),multiplication('SKOLEMAAAV2',X)),
inference('PARAMODULATE',[status(thm)],[8,19,theory(equality)]) ).
cnf(75,plain,
addition(multiplication('SKOLEMAAAV1',X),addition(multiplication('SKOLEMAAAV2',X),Y)) = addition(multiplication('SKOLEMAAAV2',X),Y),
inference('EMBED',[status(thm)],[74]) ).
cnf(162,plain,
leq(multiplication('SKOLEMAAAV1',X),addition(multiplication('SKOLEMAAAV2',X),Y)),
inference('HYPERRESOLVE',[status(thm)],[12,75]) ).
cnf(233,plain,
leq(one,star(X)),
inference('PARAMODULATE',[status(thm)],[23,30,theory(equality)]) ).
cnf(237,plain,
leq(multiplication('SKOLEMAAAV1',star('SKOLEMAAAV2')),star('SKOLEMAAAV2')),
inference('PARAMODULATE',[status(thm)],[162,30,theory(equality)]) ).
cnf(253,plain,
star(X) = addition(one,star(X)),
inference('HYPERRESOLVE',[status(thm)],[11,233]) ).
cnf(263,plain,
multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,253,theory(equality)]),6,theory(equality)]) ).
cnf(268,plain,
multiplication(X,star(Y)) = addition(X,multiplication(X,star(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,253,theory(equality)]),5,theory(equality)]) ).
cnf(287,plain,
addition(multiplication('SKOLEMAAAV1',star('SKOLEMAAAV2')),star('SKOLEMAAAV2')) = star('SKOLEMAAAV2'),
inference('HYPERRESOLVE',[status(thm)],[11,237]) ).
cnf(1393,plain,
leq(X,multiplication(X,star(Y))),
inference('HYPERRESOLVE',[status(thm)],[12,268]) ).
cnf(1718,plain,
leq(multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV2')),star('SKOLEMAAAV2')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,287,theory(equality)]),22]) ).
cnf(1727,plain,
multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV2')) = star('SKOLEMAAAV2'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,1718]),263,theory(equality)]) ).
cnf(1729,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1393,1727,theory(equality)]),18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE041+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n017.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 13:37:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.47 "."
% 0.18/0.47 *
% 0.18/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T13:37:26
% 0.18/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-16T13:37:26
% 0.18/0.48
% 0.18/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.18/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.18/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.18/0.48 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.18/0.48 ; Declaring addition to be commutative.
% 2.20/2.44 ; Declaring addition to be associative-commutative.
% 2.20/2.44
% 2.20/2.44 #||
% 2.20/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/2.44 % SZS output start Refutation
% See solution above
% 2.20/2.44 ||#
% 2.20/2.44
% 2.20/2.44 ; Summary of computation:
% 2.20/2.44 ; 9621 formulas have been input or derived (from 209 formulas).
% 2.20/2.44 ; 1729 (18%) were retained. Of these,
% 2.20/2.44 ; 385 (22%) were simplified or subsumed later,
% 2.20/2.44 ; 1344 (78%) are still being kept.
% 2.20/2.44 ;
% 2.20/2.45 ; Run time in seconds excluding printing time:
% 2.20/2.45 ; 0.004 0% Read assertion file (1 call)
% 2.20/2.45 ; 0.001 0% Assert (17 calls)
% 2.20/2.45 ; 0.147 7% Process new row (9,133 calls)
% 2.20/2.45 ; 0.024 1% Resolution (416 calls)
% 2.20/2.45 ; 0.147 7% Paramodulation (208 calls)
% 2.20/2.45 ; 0.002 0% Embedding (114 calls)
% 2.20/2.45 ; 0.038 2% Condensing (1,249 calls)
% 2.20/2.45 ; 0.066 3% Forward subsumption (1,249 calls)
% 2.20/2.45 ; 0.026 1% Backward subsumption (547 calls)
% 2.20/2.45 ; 0.045 2% Clause clause subsumption (5,513 calls)
% 2.20/2.45 ; 1.327 67% Forward simplification (8,985 calls)
% 2.20/2.45 ; 0.050 3% Backward simplification (1,618 calls)
% 2.20/2.45 ; 0.017 1% Ordering (6,048 calls)
% 2.20/2.45 ; 0.024 1% Ordering ac (788 calls)
% 2.20/2.45 ; 0.000 0% Sortal reasoning (32 calls)
% 2.20/2.45 ; 0.000 0% Purity testing (1 call)
% 2.20/2.45 ; 0.059 3% Other
% 2.20/2.45 ; 1.977 Total
% 2.20/2.45 ; 1.980 Real time
% 2.20/2.45 ;
% 2.20/2.45 ; Term-hash-array has 3,733 terms in all.
% 2.20/2.45 ; Feature-vector-row-index has 448 entries (449 at peak, 547 added, 99 deleted).
% 2.20/2.45 ; Feature-vector-row-index has 2,337 nodes (2,410 at peak, 3,106 added, 769 deleted).
% 2.20/2.45 ; Retrieved 6,141 possibly forward subsuming rows in 1,249 calls.
% 2.20/2.45 ; Retrieved 1,102 possibly backward subsumed rows in 547 calls.
% 2.20/2.45 ; Path-index has 2,973 entries (2,975 at peak, 3,833 added, 860 deleted).
% 2.20/2.45 ; Path-index has 1,173 nodes (1,173 at peak, 1,298 added, 125 deleted).
% 2.20/2.45 ; Trie-index has 2,973 entries (2,975 at peak, 3,833 added, 860 deleted).
% 2.20/2.45 ; Trie-index has 1,743 nodes (1,748 at peak, 2,069 added, 326 deleted).
% 2.20/2.45 ; Retrieved 1,560,840 generalization terms in 57,092 calls.
% 2.20/2.45 ; Retrieved 5,568 instance terms in 1,088 calls.
% 2.20/2.45 ; Retrieved 25,672 unifiable terms in 1,552 calls.
% 2.20/2.45 ;
% 2.20/2.45 ; The agenda of rows to process has 23 entries:
% 2.20/2.45 ; 3 with value 17 2 with value 19 2 with value 28
% 2.20/2.45 ; 8 with value 18 6 with value 24 2 with value 30
% 2.20/2.45 ; The agenda of rows to give has 1166 entries:
% 2.20/2.45 ; 37 with value (4 19) 38 with value (4 29) 7 with value (4 39)
% 2.20/2.45 ; 73 with value (4 20) 54 with value (4 30) 14 with value (4 40)
% 2.20/2.45 ; 75 with value (4 21) 36 with value (4 31) 18 with value (4 42)
% 2.20/2.45 ; 64 with value (4 22) 33 with value (4 32) 4 with value (4 43)
% 2.20/2.45 ; 130 with value (4 23) 23 with value (4 33) 4 with value (4 45)
% 2.20/2.45 ; 116 with value (4 24) 15 with value (4 34) 4 with value (4 47)
% 2.20/2.45 ; 83 with value (4 25) 22 with value (4 35) 2 with value (4 48)
% 2.20/2.45 ; 86 with value (4 26) 16 with value (4 36) 4 with value (4 49)
% 2.20/2.45 ; 102 with value (4 27) 8 with value (4 37) 4 with value (4 53)
% 2.20/2.45 ; 73 with value (4 28) 17 with value (4 38) 4 with value (4 57)
% 2.20/2.45 Evaluation took:
% 2.20/2.45 1.981 seconds of real time
% 2.20/2.45 1.883024 seconds of user run time
% 2.20/2.45 0.097155 seconds of system run time
% 2.20/2.45 [Run times include 0.07 seconds GC run time.]
% 2.20/2.45 0 calls to %EVAL
% 2.20/2.45 0 page faults and
% 2.20/2.45 136,724,160 bytes consed.
% 2.20/2.45 :PROOF-FOUND
% 2.20/2.45 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T13:37:28
% 2.20/2.45 :PROOF-FOUND
% 2.20/2.45 *
%------------------------------------------------------------------------------