TSTP Solution File: KLE137+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE137+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:22:24 EDT 2022
% Result : Theorem 0.82s 1.10s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE137+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 09:01:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 31423 was started by sandbox2 on n023.cluster.edu,
% 0.44/1.01 Thu Jun 16 09:01:50 2022
% 0.44/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31270_n023.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_31270_n023.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (19 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 4 (all A addition(A,A) = A) # label(idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(distributivity1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(distributivity2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 10 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 11 (all A addition(one,multiplication(A,star(A))) = star(A)) # label(star_unfold1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 12 (all A addition(one,multiplication(star(A),A)) = star(A)) # label(star_unfold2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 13 (all A all B all C (leq(addition(multiplication(A,C),B),C) -> leq(multiplication(star(A),B),C))) # label(star_induction1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 14 (all A all B all C (leq(addition(multiplication(C,A),B),C) -> leq(multiplication(B,star(A)),C))) # label(star_induction2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 15 (all A strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one)) # label(infty_unfold1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 16 (all A all B all C (leq(C,addition(multiplication(A,C),B)) -> leq(C,multiplication(strong_iteration(A),B)))) # label(infty_coinduction) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 17 (all A strong_iteration(A) = addition(star(A),multiplication(strong_iteration(A),zero))) # label(isolation) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 18 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 19 -(all X0 leq(X0,strong_iteration(one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.82/1.10
% 0.82/1.10 ============================== end of process non-clausal formulas ===
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.10
% 0.82/1.10 ============================== PREDICATE ELIMINATION =================
% 0.82/1.10
% 0.82/1.10 ============================== end predicate elimination =============
% 0.82/1.10
% 0.82/1.10 Auto_denials:
% 0.82/1.10 % copying label goals to answer in negative clause
% 0.82/1.10
% 0.82/1.10 Term ordering decisions:
% 0.82/1.10 Function symbol KB weights: one=1. zero=1. c1=1. multiplication=1. addition=1. star=1. strong_iteration=1.
% 0.82/1.10
% 0.82/1.10 ============================== end of process initial clauses ========
% 0.82/1.10
% 0.82/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.10
% 0.82/1.10 ============================== end of clauses for search =============
% 0.82/1.10
% 0.82/1.10 ============================== SEARCH ================================
% 0.82/1.10
% 0.82/1.10 % Starting search at 0.01 seconds.
% 0.82/1.10
% 0.82/1.10 ============================== PROOF =================================
% 0.82/1.10 % SZS status Theorem
% 0.82/1.10 % SZS output start Refutation
% 0.82/1.10
% 0.82/1.10 % Proof 1 at 0.11 (+ 0.00) seconds: goals.
% 0.82/1.10 % Length of proof is 62.
% 0.82/1.10 % Level of proof is 13.
% 0.82/1.10 % Maximum clause weight is 15.000.
% 0.82/1.10 % Given clauses 179.
% 0.82/1.10
% 0.82/1.10 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 4 (all A addition(A,A) = A) # label(idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(distributivity1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(distributivity2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 11 (all A addition(one,multiplication(A,star(A))) = star(A)) # label(star_unfold1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 12 (all A addition(one,multiplication(star(A),A)) = star(A)) # label(star_unfold2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 13 (all A all B all C (leq(addition(multiplication(A,C),B),C) -> leq(multiplication(star(A),B),C))) # label(star_induction1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 16 (all A all B all C (leq(C,addition(multiplication(A,C),B)) -> leq(C,multiplication(strong_iteration(A),B)))) # label(infty_coinduction) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 18 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 19 -(all X0 leq(X0,strong_iteration(one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.82/1.10 21 addition(A,A) = A # label(idempotence) # label(axiom). [clausify(4)].
% 0.82/1.10 22 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 0.82/1.10 23 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 0.82/1.10 25 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 0.82/1.10 26 star(A) = addition(one,multiplication(A,star(A))) # label(star_unfold1) # label(axiom). [clausify(11)].
% 0.82/1.10 27 addition(one,multiplication(A,star(A))) = star(A). [copy(26),flip(a)].
% 0.82/1.10 28 star(A) = addition(one,multiplication(star(A),A)) # label(star_unfold2) # label(axiom). [clausify(12)].
% 0.82/1.10 29 addition(one,multiplication(star(A),A)) = star(A). [copy(28),flip(a)].
% 0.82/1.10 34 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(2)].
% 0.82/1.10 35 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(34),rewrite([25(2)]),flip(a)].
% 0.82/1.10 36 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom). [clausify(5)].
% 0.82/1.10 37 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(distributivity1) # label(axiom). [clausify(8)].
% 0.82/1.10 38 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(37),flip(a)].
% 0.82/1.10 39 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(distributivity2) # label(axiom). [clausify(9)].
% 0.82/1.10 40 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(39),flip(a)].
% 0.82/1.10 41 -leq(c1,strong_iteration(one)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(19)].
% 0.82/1.10 42 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(18)].
% 0.82/1.10 43 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(18)].
% 0.82/1.10 44 -leq(addition(multiplication(A,B),C),B) | leq(multiplication(star(A),C),B) # label(star_induction1) # label(axiom). [clausify(13)].
% 0.82/1.10 45 -leq(addition(A,multiplication(B,C)),C) | leq(multiplication(star(B),A),C). [copy(44),rewrite([25(2)])].
% 0.82/1.10 48 -leq(A,addition(multiplication(B,A),C)) | leq(A,multiplication(strong_iteration(B),C)) # label(infty_coinduction) # label(axiom). [clausify(16)].
% 0.82/1.10 49 -leq(A,addition(B,multiplication(C,A))) | leq(A,multiplication(strong_iteration(C),B)). [copy(48),rewrite([25(2)])].
% 0.82/1.10 54 addition(A,addition(A,B)) = addition(A,B). [para(35(a,1),21(a,1)),rewrite([25(1),25(2),35(2,R),21(1),25(3)])].
% 0.82/1.10 55 addition(one,multiplication(A,multiplication(B,star(multiplication(A,B))))) = star(multiplication(A,B)). [para(36(a,1),27(a,1,2))].
% 0.82/1.10 57 multiplication(A,addition(B,one)) = addition(A,multiplication(A,B)). [para(22(a,1),38(a,1,1)),rewrite([25(4)]),flip(a)].
% 0.82/1.10 62 multiplication(addition(A,one),B) = addition(B,multiplication(A,B)). [para(23(a,1),40(a,1,1)),rewrite([25(4)]),flip(a)].
% 0.82/1.10 63 addition(A,multiplication(B,multiplication(star(B),A))) = multiplication(star(B),A). [para(27(a,1),40(a,2,1)),rewrite([23(2),36(3)])].
% 0.82/1.10 69 leq(A,A). [hyper(43,b,21,a)].
% 0.82/1.10 79 -leq(addition(A,B),one) | leq(multiplication(star(B),A),one). [para(22(a,1),45(a,1,2))].
% 0.82/1.10 80 -leq(addition(A,B),B) | leq(multiplication(star(one),A),B). [para(23(a,1),45(a,1,2))].
% 0.82/1.10 97 -leq(A,addition(A,B)) | leq(A,multiplication(strong_iteration(one),B)). [para(23(a,1),49(a,2,2)),rewrite([25(1)])].
% 0.82/1.10 110 leq(A,addition(A,B)). [hyper(43,b,54,a)].
% 0.82/1.10 111 addition(one,star(A)) = star(A). [para(27(a,1),54(a,1,2)),rewrite([27(7)])].
% 0.82/1.10 118 leq(multiplication(A,B),multiplication(A,addition(B,C))). [para(38(a,1),110(a,2))].
% 0.82/1.10 195 leq(multiplication(A,B),addition(A,multiplication(A,B))). [para(57(a,1),118(a,2))].
% 0.82/1.10 251 multiplication(star(A),A) = multiplication(A,star(A)). [para(63(a,1),57(a,2)),rewrite([25(4),29(4)]),flip(a)].
% 0.82/1.10 266 leq(multiplication(A,star(A)),star(A)). [para(55(a,1),195(a,2)),rewrite([23(3),23(4),23(4)])].
% 0.82/1.10 279 multiplication(addition(A,one),star(A)) = star(A). [hyper(42,a,266,a),rewrite([25(4),62(4,R)])].
% 0.82/1.10 387 addition(A,star(A)) = star(A). [para(279(a,1),57(a,2,2)),rewrite([25(5),111(5),279(4),25(5),35(5),25(4),35(5,R),25(4),111(4)]),flip(a)].
% 0.82/1.10 520 -leq(A,one) | leq(multiplication(A,star(A)),one). [para(21(a,1),79(a,1)),rewrite([251(4)])].
% 0.82/1.10 560 -leq(addition(A,B),A) | leq(multiplication(star(one),B),A). [para(25(a,1),80(a,1))].
% 0.82/1.10 597 leq(star(one),one). [hyper(520,a,69,a),rewrite([23(4)])].
% 0.82/1.10 601 star(one) = one. [hyper(42,a,597,a),rewrite([25(4),387(4)])].
% 0.82/1.10 619 -leq(addition(A,B),A) | leq(B,A). [back_rewrite(560),rewrite([601(4),23(4)])].
% 0.82/1.10 622 -leq(addition(c1,strong_iteration(one)),strong_iteration(one)) # answer(goals). [ur(619,b,41,a),rewrite([25(4)])].
% 0.82/1.10 923 leq(A,multiplication(strong_iteration(one),B)). [hyper(97,a,110,a)].
% 0.82/1.10 925 leq(A,strong_iteration(one)). [para(22(a,1),923(a,2))].
% 0.82/1.10 926 $F # answer(goals). [resolve(925,a,622,a)].
% 0.82/1.10
% 0.82/1.10 % SZS output end Refutation
% 0.82/1.10 ============================== end of proof ==========================
% 0.82/1.10
% 0.82/1.10 ============================== STATISTICS ============================
% 0.82/1.10
% 0.82/1.10 Given=179. Generated=3171. Kept=896. proofs=1.
% 0.82/1.10 Usable=162. Sos=633. Demods=162. Limbo=1, Disabled=119. Hints=0.
% 0.82/1.10 Megabytes=0.81.
% 0.82/1.10 User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.82/1.10
% 0.82/1.10 ============================== end of statistics =====================
% 0.82/1.10
% 0.82/1.10 ============================== end of search =========================
% 0.82/1.10
% 0.82/1.10 THEOREM PROVED
% 0.82/1.10 % SZS status Theorem
% 0.82/1.10
% 0.82/1.10 Exiting with 1 proof.
% 0.82/1.10
% 0.82/1.10 Process 31423 exit (max_proofs) Thu Jun 16 09:01:50 2022
% 0.82/1.10 Prover9 interrupted
%------------------------------------------------------------------------------