TSTP Solution File: KLE040+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE040+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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.41s 0.61s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 14 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 2 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,
multiplication(star('SKOLEMAAAV1'),star('SKOLEMAAAV1')) != star('SKOLEMAAAV1'),
file('/export/starexec/sandbox/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(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(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(160,plain,
$false,
inference('REWRITE',[status(thm)],[17,159,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE040+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n026.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:43:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 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.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:43:08
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-16T16:43:08
% 0.18/0.47
% 0.18/0.47 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.18/0.47 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.18/0.47 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.18/0.47 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.18/0.47 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.18/0.47 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.18/0.47 ; Declaring addition to be commutative.
% 0.41/0.61 ; Declaring addition to be associative-commutative.
% 0.41/0.61
% 0.41/0.61 #||
% 0.41/0.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.61 % SZS output start Refutation
% See solution above
% 0.41/0.61 ||#
% 0.41/0.61
% 0.41/0.61 ; Summary of computation:
% 0.41/0.61 ; 888 formulas have been input or derived (from 47 formulas).
% 0.41/0.61 ; 160 (18%) were retained. Of these,
% 0.41/0.61 ; 67 (42%) were simplified or subsumed later,
% 0.41/0.61 ; 93 (58%) are still being kept.
% 0.41/0.61 ;
% 0.41/0.61 ; Run time in seconds excluding printing time:
% 0.41/0.61 ; 0.004 3% Read assertion file (1 call)
% 0.41/0.61 ; 0.001 1% Assert (17 calls)
% 0.41/0.61 ; 0.015 10% Process new row (823 calls)
% 0.41/0.61 ; 0.006 4% Resolution (92 calls)
% 0.41/0.61 ; 0.017 11% Paramodulation (46 calls)
% 0.41/0.61 ; 0.000 0% Embedding (26 calls)
% 0.41/0.61 ; 0.006 4% Condensing (153 calls)
% 0.41/0.61 ; 0.007 5% Forward subsumption (153 calls)
% 0.41/0.61 ; 0.000 0% Backward subsumption (61 calls)
% 0.41/0.61 ; 0.007 5% Clause clause subsumption (261 calls)
% 0.41/0.61 ; 0.053 36% Forward simplification (773 calls)
% 0.41/0.61 ; 0.002 1% Backward simplification (137 calls)
% 0.41/0.61 ; 0.001 1% Ordering (500 calls)
% 0.41/0.61 ; 0.000 0% Ordering ac (74 calls)
% 0.41/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.41/0.61 ; 0.000 0% Purity testing (1 call)
% 0.41/0.61 ; 0.029 20% Other
% 0.41/0.61 ; 0.148 Total
% 0.41/0.61 ; 0.150 Real time
% 0.41/0.61 ;
% 0.41/0.61 ; Term-hash-array has 391 terms in all.
% 0.41/0.61 ; Feature-vector-row-index has 40 entries (44 at peak, 61 added, 21 deleted).
% 0.41/0.61 ; Feature-vector-row-index has 171 nodes (237 at peak, 360 added, 189 deleted).
% 0.41/0.61 ; Retrieved 299 possibly forward subsuming rows in 153 calls.
% 0.41/0.61 ; Retrieved 28 possibly backward subsumed rows in 61 calls.
% 0.41/0.61 ; Path-index has 270 entries (286 at peak, 406 added, 136 deleted).
% 0.41/0.61 ; Path-index has 315 nodes (337 at peak, 378 added, 63 deleted).
% 0.41/0.61 ; Trie-index has 270 entries (286 at peak, 406 added, 136 deleted).
% 0.41/0.61 ; Trie-index has 270 nodes (285 at peak, 347 added, 77 deleted).
% 0.41/0.61 ; Retrieved 20,715 generalization terms in 4,804 calls.
% 0.41/0.61 ; Retrieved 180 instance terms in 93 calls.
% 0.41/0.61 ; Retrieved 1,738 unifiable terms in 280 calls.
% 0.41/0.61 ;
% 0.41/0.61 ; The agenda of rows to give has 64 entries:
% 0.41/0.61 ; 1 with value (4 13) 5 with value (4 20) 4 with value (4 27)
% 0.41/0.61 ; 2 with value (4 14) 1 with value (4 21) 14 with value (4 28)
% 0.41/0.61 ; 5 with value (4 15) 3 with value (4 22) 1 with value (4 29)
% 0.41/0.61 ; 1 with value (4 16) 5 with value (4 23) 3 with value (4 30)
% 0.41/0.61 ; 5 with value (4 17) 6 with value (4 26) 2 with value (4 35)
% 0.41/0.61 ; 6 with value (4 19)
% 0.41/0.61 Evaluation took:
% 0.41/0.61 0.15 seconds of real time
% 0.41/0.61 0.128841 seconds of user run time
% 0.41/0.61 0.021149 seconds of system run time
% 0.41/0.61 0 calls to %EVAL
% 0.41/0.61 0 page faults and
% 0.41/0.61 9,471,544 bytes consed.
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:43:08
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 *
%------------------------------------------------------------------------------