TSTP Solution File: KLE039+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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:20 EDT 2022
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 23 unt; 0 nHn; 7 RR)
% Number of literals : 33 ( 17 equ; 6 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
cnf(11,axiom,
( ~ leq(X,Y)
| addition(X,Y) = Y ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
cnf(12,axiom,
( leq(X,Y)
| addition(X,Y) != Y ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
cnf(13,axiom,
leq(addition(one,multiplication(X,star(X))),star(X)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
cnf(16,axiom,
( ~ leq(addition(multiplication(X,Y),Z),X)
| leq(multiplication(Z,star(Y)),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
cnf(17,negated_conjecture,
star(star('SKOLEMAAAV1')) != star('SKOLEMAAAV1'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(19,plain,
leq(X,X),
inference('HYPERRESOLVE',[status(thm)],[12,2]) ).
cnf(20,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(26,plain,
addition(one,addition(multiplication(X,star(X)),star(X))) = star(X),
inference('HYPERRESOLVE',[status(thm)],[11,13]) ).
cnf(59,plain,
( ~ leq(multiplication(X,Y),X)
| leq(multiplication(multiplication(X,Y),star(Y)),X) ),
inference('PARAMODULATE',[status(thm)],[16,2,theory(equality)]) ).
cnf(111,plain,
leq(one,star(X)),
inference('PARAMODULATE',[status(thm)],[20,26,theory(equality)]) ).
cnf(119,plain,
leq(addition(star(X),multiplication(star(X),star(X))),star(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,26,theory(equality)]),5,7,19,theory(equality)]) ).
cnf(130,plain,
star(X) = addition(one,star(X)),
inference('HYPERRESOLVE',[status(thm)],[11,111]) ).
cnf(136,plain,
star(X) = addition(multiplication(X,star(X)),star(X)),
inference('REWRITE',[status(thm)],[26,130,theory(equality)]) ).
cnf(140,plain,
multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,130,theory(equality)]),6,theory(equality)]) ).
cnf(144,plain,
leq(multiplication(star(X),star(X)),star(X)),
inference('REWRITE',[status(thm)],[119,140,theory(equality)]) ).
cnf(145,plain,
multiplication(X,star(Y)) = addition(X,multiplication(X,star(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,130,theory(equality)]),5,theory(equality)]) ).
cnf(159,plain,
multiplication(star(X),star(X)) = star(X),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,144]),145,theory(equality)]) ).
cnf(316,plain,
leq(multiplication(star(X),star(star(X))),star(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[59,159,theory(equality)]),19]) ).
cnf(322,plain,
multiplication(star(X),star(star(X))) = star(X),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,316]),145,theory(equality)]) ).
cnf(337,plain,
star(star(X)) = star(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[136,140,theory(equality)]),322,theory(equality)]) ).
cnf(350,plain,
$false,
inference('REWRITE',[status(thm)],[17,337,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n006.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 12:46:26 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-16T12:46:26
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-16T12:46:26
% 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.
% 0.55/0.74 ; Declaring addition to be associative-commutative.
% 0.55/0.74
% 0.55/0.74 #||
% 0.55/0.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74 % SZS output start Refutation
% See solution above
% 0.55/0.74 ||#
% 0.55/0.74
% 0.55/0.74 ; Summary of computation:
% 0.55/0.74 ; 1940 formulas have been input or derived (from 84 formulas).
% 0.55/0.74 ; 350 (18%) were retained. Of these,
% 0.55/0.74 ; 115 (33%) were simplified or subsumed later,
% 0.55/0.74 ; 235 (67%) are still being kept.
% 0.55/0.74 ;
% 0.55/0.74 ; Run time in seconds excluding printing time:
% 0.55/0.74 ; 0.004 1% Read assertion file (1 call)
% 0.55/0.74 ; 0.001 0% Assert (17 calls)
% 0.55/0.74 ; 0.041 15% Process new row (1,734 calls)
% 0.55/0.74 ; 0.009 3% Resolution (166 calls)
% 0.55/0.74 ; 0.025 9% Paramodulation (83 calls)
% 0.55/0.74 ; 0.000 0% Embedding (32 calls)
% 0.55/0.74 ; 0.020 7% Condensing (409 calls)
% 0.55/0.74 ; 0.015 5% Forward subsumption (409 calls)
% 0.55/0.74 ; 0.008 3% Backward subsumption (187 calls)
% 0.55/0.74 ; 0.022 8% Clause clause subsumption (1,394 calls)
% 0.55/0.74 ; 0.087 32% Forward simplification (1,675 calls)
% 0.55/0.74 ; 0.006 2% Backward simplification (321 calls)
% 0.55/0.74 ; 0.004 1% Ordering (1,055 calls)
% 0.55/0.74 ; 0.004 1% Ordering ac (133 calls)
% 0.55/0.74 ; 0.000 0% Sortal reasoning (32 calls)
% 0.55/0.74 ; 0.000 0% Purity testing (1 call)
% 0.55/0.74 ; 0.028 10% Other
% 0.55/0.74 ; 0.274 Total
% 0.55/0.74 ; 0.276 Real time
% 0.55/0.74 ;
% 0.55/0.74 ; Term-hash-array has 779 terms in all.
% 0.55/0.74 ; Feature-vector-row-index has 135 entries (141 at peak, 187 added, 52 deleted).
% 0.55/0.74 ; Feature-vector-row-index has 525 nodes (560 at peak, 824 added, 299 deleted).
% 0.55/0.74 ; Retrieved 1,278 possibly forward subsuming rows in 409 calls.
% 0.55/0.74 ; Retrieved 413 possibly backward subsumed rows in 187 calls.
% 0.55/0.74 ; Path-index has 570 entries (623 at peak, 799 added, 229 deleted).
% 0.55/0.74 ; Path-index has 606 nodes (635 at peak, 701 added, 95 deleted).
% 0.55/0.74 ; Trie-index has 570 entries (623 at peak, 799 added, 229 deleted).
% 0.55/0.74 ; Trie-index has 553 nodes (676 at peak, 782 added, 229 deleted).
% 0.55/0.74 ; Retrieved 54,276 generalization terms in 10,577 calls.
% 0.55/0.74 ; Retrieved 264 instance terms in 151 calls.
% 0.55/0.74 ; Retrieved 4,311 unifiable terms in 516 calls.
% 0.55/0.74 ;
% 0.55/0.74 ; The agenda of rows to process has 70 entries:
% 0.55/0.74 ; 1 with value 19 2 with value 26 1 with value 33
% 0.55/0.74 ; 3 with value 20 10 with value 27 7 with value 34
% 0.55/0.74 ; 3 with value 21 5 with value 28 6 with value 35
% 0.55/0.74 ; 2 with value 22 3 with value 29 2 with value 38
% 0.55/0.74 ; 5 with value 23 3 with value 30 2 with value 40
% 0.55/0.74 ; 3 with value 24 2 with value 31 2 with value 41
% 0.55/0.74 ; 4 with value 25 3 with value 32 1 with value 43
% 0.55/0.74 ; The agenda of rows to give has 179 entries:
% 0.55/0.74 ; 2 with value (4 14) 5 with value (4 25) 4 with value (4 34)
% 0.55/0.74 ; 1 with value (4 15) 20 with value (4 26) 6 with value (4 35)
% 0.55/0.74 ; 2 with value (4 18) 5 with value (4 27) 6 with value (4 36)
% 0.55/0.74 ; 6 with value (4 19) 23 with value (4 28) 2 with value (4 37)
% 0.55/0.74 ; 10 with value (4 20) 6 with value (4 29) 3 with value (4 38)
% 0.55/0.74 ; 6 with value (4 21) 15 with value (4 30) 5 with value (4 39)
% 0.55/0.74 ; 10 with value (4 22) 8 with value (4 31) 2 with value (4 40)
% 0.55/0.74 ; 17 with value (4 23) 2 with value (4 32) 4 with value (4 42)
% 0.55/0.74 ; 9 with value (4 24)
% 0.55/0.74 Evaluation took:
% 0.55/0.74 0.277 seconds of real time
% 0.55/0.74 0.252961 seconds of user run time
% 0.55/0.74 0.023958 seconds of system run time
% 0.55/0.74 [Run times include 0.006 seconds GC run time.]
% 0.55/0.74 0 calls to %EVAL
% 0.55/0.74 0 page faults and
% 0.55/0.74 22,579,616 bytes consed.
% 0.55/0.74 :PROOF-FOUND
% 0.55/0.74 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T12:46:26
% 0.55/0.74 :PROOF-FOUND
% 0.55/0.74 *
%------------------------------------------------------------------------------