TSTP Solution File: KLE169+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE169+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:59 EDT 2022
% Result : Theorem 0.61s 0.85s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 20 unt; 0 nHn; 8 RR)
% Number of literals : 24 ( 15 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 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(4,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_associativity) ).
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(17,axiom,
sigma = addition(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an) ).
cnf(19,negated_conjecture,
~ leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
cnf(20,plain,
~ leq(multiplication(a,multiplication(b,a)),multiplication(multiplication(star(sigma),a),multiplication(sigma,a))),
inference('REWRITE',[status(thm)],[19,4,theory(equality)]) ).
cnf(27,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(41,plain,
addition(one,addition(multiplication(X,star(X)),star(X))) = star(X),
inference('HYPERRESOLVE',[status(thm)],[11,13]) ).
cnf(56,plain,
multiplication(sigma,X) = addition(multiplication(a,X),multiplication(b,X)),
inference('PARAMODULATE',[status(thm)],[8,17,theory(equality)]) ).
cnf(57,plain,
~ leq(multiplication(a,multiplication(b,a)),addition(multiplication(multiplication(star(sigma),a),multiplication(a,a)),multiplication(multiplication(star(sigma),a),multiplication(b,a)))),
inference('REWRITE',[status(thm)],[20,7,56,theory(equality)]) ).
cnf(90,plain,
addition(multiplication(a,multiplication(b,a)),addition(multiplication(multiplication(star(sigma),a),multiplication(a,a)),multiplication(multiplication(star(sigma),a),multiplication(b,a)))) != addition(multiplication(multiplication(star(sigma),a),multiplication(a,a)),multiplication(multiplication(star(sigma),a),multiplication(b,a))),
inference('UR-RESOLVE',[status(thm)],[12,57]) ).
cnf(189,plain,
leq(one,star(X)),
inference('PARAMODULATE',[status(thm)],[27,41,theory(equality)]) ).
cnf(210,plain,
star(X) = addition(one,star(X)),
inference('HYPERRESOLVE',[status(thm)],[11,189]) ).
cnf(223,plain,
multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,210,theory(equality)]),6,theory(equality)]) ).
cnf(581,plain,
multiplication(multiplication(star(X),Y),Z) = addition(multiplication(Y,Z),multiplication(multiplication(star(X),Y),Z)),
inference('PARAMODULATE',[status(thm)],[8,223,theory(equality)]) ).
cnf(583,plain,
$false,
inference('REWRITE',[status(thm)],[90,581,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KLE169+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Thu Jun 16 11:14:45 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.39 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 *
% 0.15/0.40 *
% 0.15/0.40 #<PACKAGE "SNARK-USER">
% 0.15/0.40 *
% 0.15/0.40 SNARK-TPTP-OPTIONS
% 0.15/0.40 *
% 0.15/0.40 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40 (USE-FACTORING :POS)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40 *
% 0.15/0.40 "."
% 0.15/0.40 *
% 0.15/0.40 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T11:14:45
% 0.15/0.41 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-16T11:14:45
% 0.15/0.41
% 0.15/0.41 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.15/0.41 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.15/0.41 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.15/0.41 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.15/0.41 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.15/0.41 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.15/0.41 ; Declaring addition to be commutative.
% 0.61/0.85 ; Declaring addition to be associative-commutative.
% 0.61/0.85
% 0.61/0.85 #||
% 0.61/0.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.85 % SZS output start Refutation
% See solution above
% 0.61/0.86 ||#
% 0.61/0.86
% 0.61/0.86 ; Summary of computation:
% 0.61/0.86 ; 3949 formulas have been input or derived (from 147 formulas).
% 0.61/0.86 ; 583 (15%) were retained. Of these,
% 0.61/0.86 ; 150 (26%) were simplified or subsumed later,
% 0.61/0.86 ; 433 (74%) are still being kept.
% 0.61/0.86 ;
% 0.61/0.86 ; Run time in seconds excluding printing time:
% 0.61/0.86 ; 0.002 0% Read assertion file (1 call)
% 0.61/0.86 ; 0.001 0% Assert (18 calls)
% 0.61/0.86 ; 0.049 11% Process new row (3,622 calls)
% 0.61/0.86 ; 0.019 4% Resolution (292 calls)
% 0.61/0.86 ; 0.053 12% Paramodulation (146 calls)
% 0.61/0.86 ; 0.000 0% Embedding (44 calls)
% 0.61/0.86 ; 0.023 5% Condensing (969 calls)
% 0.61/0.86 ; 0.030 7% Forward subsumption (969 calls)
% 0.61/0.86 ; 0.010 2% Backward subsumption (298 calls)
% 0.61/0.86 ; 0.019 4% Clause clause subsumption (2,383 calls)
% 0.61/0.86 ; 0.192 43% Forward simplification (3,544 calls)
% 0.61/0.86 ; 0.011 2% Backward simplification (543 calls)
% 0.61/0.86 ; 0.007 2% Ordering (2,606 calls)
% 0.61/0.86 ; 0.003 1% Ordering ac (330 calls)
% 0.61/0.86 ; 0.000 0% Sortal reasoning (32 calls)
% 0.61/0.86 ; 0.000 0% Purity testing (1 call)
% 0.61/0.86 ; 0.029 6% Other
% 0.61/0.86 ; 0.448 Total
% 0.61/0.86 ; 0.451 Real time
% 0.61/0.86 ;
% 0.61/0.86 ; Term-hash-array has 1,257 terms in all.
% 0.61/0.86 ; Feature-vector-row-index has 246 entries (246 at peak, 298 added, 52 deleted).
% 0.61/0.86 ; Feature-vector-row-index has 1,303 nodes (1,303 at peak, 1,594 added, 291 deleted).
% 0.61/0.86 ; Retrieved 2,779 possibly forward subsuming rows in 969 calls.
% 0.61/0.86 ; Retrieved 607 possibly backward subsumed rows in 298 calls.
% 0.61/0.86 ; Path-index has 999 entries (1,011 at peak, 1,283 added, 284 deleted).
% 0.61/0.86 ; Path-index has 803 nodes (830 at peak, 918 added, 115 deleted).
% 0.61/0.86 ; Trie-index has 999 entries (1,011 at peak, 1,283 added, 284 deleted).
% 0.61/0.86 ; Trie-index has 794 nodes (900 at peak, 1,053 added, 259 deleted).
% 0.61/0.86 ; Retrieved 185,903 generalization terms in 20,406 calls.
% 0.61/0.86 ; Retrieved 534 instance terms in 262 calls.
% 0.61/0.86 ; Retrieved 10,301 unifiable terms in 974 calls.
% 0.61/0.86 ;
% 0.61/0.86 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.61/0.86 ; 1 with value 0
% 0.61/0.86 ; The agenda of rows to process has 94 entries:
% 0.61/0.86 ; 9 with value 27 19 with value 32 2 with value 38
% 0.61/0.86 ; 7 with value 28 1 with value 33 2 with value 40
% 0.61/0.86 ; 11 with value 29 7 with value 34 2 with value 41
% 0.61/0.86 ; 9 with value 30 6 with value 35 8 with value 42
% 0.61/0.86 ; 2 with value 31 8 with value 37 1 with value 43
% 0.61/0.86 ; The agenda of rows to give has 317 entries:
% 0.61/0.86 ; 2 with value (4 14) 14 with value (4 25) 4 with value (4 34)
% 0.61/0.86 ; 1 with value (4 15) 24 with value (4 26) 9 with value (4 35)
% 0.61/0.86 ; 2 with value (4 18) 12 with value (4 27) 6 with value (4 36)
% 0.61/0.86 ; 9 with value (4 19) 25 with value (4 28) 2 with value (4 37)
% 0.61/0.86 ; 18 with value (4 20) 15 with value (4 29) 7 with value (4 38)
% 0.61/0.86 ; 28 with value (4 21) 17 with value (4 30) 5 with value (4 39)
% 0.61/0.86 ; 25 with value (4 22) 22 with value (4 31) 2 with value (4 40)
% 0.61/0.86 ; 25 with value (4 23) 4 with value (4 32) 4 with value (4 42)
% 0.61/0.86 ; 27 with value (4 24) 8 with value (4 33)
% 0.61/0.86 Evaluation took:
% 0.61/0.86 0.451 seconds of real time
% 0.61/0.86 0.420845 seconds of user run time
% 0.61/0.86 0.030327 seconds of system run time
% 0.61/0.86 [Run times include 0.015 seconds GC run time.]
% 0.61/0.86 0 calls to %EVAL
% 0.61/0.86 0 page faults and
% 0.61/0.86 39,699,664 bytes consed.
% 0.61/0.86 :PROOF-FOUND
% 0.61/0.86 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T11:14:45
% 0.61/0.86 :PROOF-FOUND
% 0.61/0.86 *
%------------------------------------------------------------------------------