TSTP Solution File: KLE169-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE169-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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 : Unsatisfiable 2.32s 2.56s
% Output : Refutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 24 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 42 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq3(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(ifeq_axiom_001,axiom,
ifeq2(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(additive_idempotence,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
cnf(6,plain,
addition(X,addition(X,Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[additive_idempotence]) ).
cnf(multiplicative_associativity,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
cnf(multiplicative_left_identity,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
cnf(right_distributivity,axiom,
multiplication(X,addition(Y,Z)) = addition(multiplication(X,Y),multiplication(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
cnf(left_distributivity,axiom,
multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
cnf(order_1,axiom,
ifeq2(leq(X,Y),true,addition(X,Y),Y) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order_1) ).
cnf(order,axiom,
ifeq3(addition(X,Y),Y,leq(X,Y),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
cnf(star_unfold_right,axiom,
leq(addition(one,multiplication(X,star(X))),star(X)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_unfold_right) ).
cnf(an,axiom,
sigma = addition(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an) ).
cnf(a,negated_conjecture,
leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
cnf(23,plain,
leq(multiplication(a,multiplication(b,a)),multiplication(multiplication(star(sigma),a),multiplication(sigma,a))) != true,
inference('REWRITE',[status(thm)],[a,multiplicative_associativity,theory(equality)]) ).
cnf(57,plain,
leq(X,addition(X,Y)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[order,6,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(66,plain,
multiplication(sigma,X) = addition(multiplication(a,X),multiplication(b,X)),
inference('PARAMODULATE',[status(thm)],[left_distributivity,an,theory(equality)]) ).
cnf(67,plain,
leq(multiplication(a,multiplication(b,a)),addition(multiplication(multiplication(star(sigma),a),multiplication(a,a)),multiplication(multiplication(star(sigma),a),multiplication(b,a)))) != true,
inference('REWRITE',[status(thm)],[23,right_distributivity,66,theory(equality)]) ).
cnf(73,plain,
addition(one,addition(multiplication(X,star(X)),star(X))) = star(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[order_1,star_unfold_right,theory(equality)]),ifeq_axiom_001,theory(equality)]) ).
cnf(230,plain,
leq(one,star(X)) = true,
inference('PARAMODULATE',[status(thm)],[57,73,theory(equality)]) ).
cnf(255,plain,
addition(one,star(X)) = star(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[order_1,230,theory(equality)]),ifeq_axiom_001,theory(equality)]) ).
cnf(270,plain,
multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_distributivity,255,theory(equality)]),multiplicative_left_identity,theory(equality)]) ).
cnf(271,plain,
addition(X,addition(multiplication(star(Y),X),Z)) = addition(multiplication(star(Y),X),Z),
inference('EMBED',[status(thm)],[270]) ).
cnf(467,plain,
leq(X,addition(multiplication(star(Y),X),Z)) = true,
inference('PARAMODULATE',[status(thm)],[57,271,theory(equality)]) ).
cnf(1945,plain,
leq(multiplication(X,Y),addition(multiplication(multiplication(star(Z),X),Y),U)) = true,
inference('PARAMODULATE',[status(thm)],[467,multiplicative_associativity,theory(equality)]) ).
cnf(1946,plain,
$false,
inference('REWRITE',[status(thm)],[67,1945,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE169-10 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n019.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 08:37:39 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-16T08:37:39
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-16T08:37:39
% 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.
% 2.32/2.56 ; Declaring addition to be associative-commutative.
% 2.32/2.56
% 2.32/2.56 #||
% 2.32/2.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/2.56 % SZS output start Refutation
% See solution above
% 2.32/2.57 ||#
% 2.32/2.57
% 2.32/2.57 ; Summary of computation:
% 2.32/2.57 ; 9535 formulas have been input or derived (from 160 formulas).
% 2.32/2.57 ; 1946 (20%) were retained. Of these,
% 2.32/2.57 ; 405 (21%) were simplified or subsumed later,
% 2.32/2.57 ; 1541 (79%) are still being kept.
% 2.32/2.57 ;
% 2.32/2.57 ; Run time in seconds excluding printing time:
% 2.32/2.57 ; 0.004 0% Read assertion file (1 call)
% 2.32/2.57 ; 0.000 0% Assert (22 calls)
% 2.32/2.57 ; 0.199 10% Process new row (8,974 calls)
% 2.32/2.57 ; 0.004 0% Resolution (318 calls)
% 2.32/2.57 ; 0.147 7% Paramodulation (159 calls)
% 2.32/2.57 ; 0.002 0% Embedding (287 calls)
% 2.32/2.57 ; 1.473 70% Forward simplification (8,765 calls)
% 2.32/2.57 ; 0.075 4% Backward simplification (1,758 calls)
% 2.32/2.57 ; 0.099 5% Ordering (25,907 calls)
% 2.32/2.57 ; 0.033 2% Ordering ac (2,226 calls)
% 2.32/2.57 ; 0.000 0% Sortal reasoning (32 calls)
% 2.32/2.57 ; 0.000 0% Purity testing (1 call)
% 2.32/2.57 ; 0.057 3% Other
% 2.32/2.57 ; 2.093 Total
% 2.32/2.57 ; 2.110 Real time
% 2.32/2.57 ;
% 2.32/2.57 ; Term-hash-array has 5,419 terms in all.
% 2.32/2.57 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 2.32/2.57 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 2.32/2.57 ; Path-index has 4,311 entries (4,316 at peak, 5,575 added, 1,264 deleted).
% 2.32/2.57 ; Path-index has 4,269 nodes (4,275 at peak, 4,931 added, 662 deleted).
% 2.32/2.57 ; Trie-index has 4,311 entries (4,316 at peak, 5,575 added, 1,264 deleted).
% 2.32/2.57 ; Trie-index has 7,513 nodes (7,527 at peak, 9,236 added, 1,723 deleted).
% 2.32/2.57 ; Retrieved 1,845,172 generalization terms in 65,774 calls.
% 2.32/2.57 ; Retrieved 5,701 instance terms in 2,267 calls.
% 2.32/2.57 ; Retrieved 16,614 unifiable terms in 1,127 calls.
% 2.32/2.57 ;
% 2.32/2.57 ; The agenda of rows to process has 25 entries:
% 2.32/2.57 ; 7 with value 26 1 with value 29 2 with value 32
% 2.32/2.57 ; 2 with value 27 3 with value 30 1 with value 35
% 2.32/2.57 ; 5 with value 28 2 with value 31 2 with value 44
% 2.32/2.57 ; The agenda of rows to give has 1397 entries:
% 2.32/2.57 ; 30 with value (4 20) 111 with value (4 30) 14 with value (4 40)
% 2.32/2.57 ; 52 with value (4 21) 171 with value (4 31) 9 with value (4 41)
% 2.32/2.57 ; 53 with value (4 22) 56 with value (4 32) 6 with value (4 42)
% 2.32/2.57 ; 110 with value (4 23) 36 with value (4 33) 6 with value (4 43)
% 2.32/2.57 ; 73 with value (4 24) 33 with value (4 34) 4 with value (4 44)
% 2.32/2.57 ; 94 with value (4 25) 45 with value (4 35) 5 with value (4 45)
% 2.32/2.57 ; 121 with value (4 26) 32 with value (4 36) 4 with value (4 47)
% 2.32/2.57 ; 96 with value (4 27) 28 with value (4 37) 2 with value (4 49)
% 2.32/2.57 ; 75 with value (4 28) 59 with value (4 38) 1 with value (4 51)
% 2.32/2.57 ; 50 with value (4 29) 17 with value (4 39) 4 with value (4 56)
% 2.32/2.57 Evaluation took:
% 2.32/2.57 2.11 seconds of real time
% 2.32/2.57 1.989546 seconds of user run time
% 2.32/2.57 0.11134 seconds of system run time
% 2.32/2.57 [Run times include 0.082 seconds GC run time.]
% 2.32/2.57 0 calls to %EVAL
% 2.32/2.57 0 page faults and
% 2.32/2.57 127,020,648 bytes consed.
% 2.32/2.57 :PROOF-FOUND
% 2.32/2.57 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T08:37:41
% 2.32/2.57 :PROOF-FOUND
% 2.32/2.57 *
%------------------------------------------------------------------------------