TSTP Solution File: KLE002+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:21:37 EDT 2022
% Result : Theorem 0.78s 1.04s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 13:09:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.03 ============================== Prover9 ===============================
% 0.49/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.03 Process 16260 was started by sandbox on n012.cluster.edu,
% 0.49/1.03 Thu Jun 16 13:09:55 2022
% 0.49/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16107_n012.cluster.edu".
% 0.49/1.03 ============================== end of head ===========================
% 0.49/1.03
% 0.49/1.03 ============================== INPUT =================================
% 0.49/1.03
% 0.49/1.03 % Reading from file /tmp/Prover9_16107_n012.cluster.edu
% 0.49/1.03
% 0.49/1.03 set(prolog_style_variables).
% 0.49/1.03 set(auto2).
% 0.49/1.03 % set(auto2) -> set(auto).
% 0.49/1.03 % set(auto) -> set(auto_inference).
% 0.49/1.03 % set(auto) -> set(auto_setup).
% 0.49/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.03 % set(auto) -> set(auto_limits).
% 0.49/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.03 % set(auto) -> set(auto_denials).
% 0.49/1.03 % set(auto) -> set(auto_process).
% 0.49/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.03 % set(auto2) -> assign(stats, some).
% 0.49/1.03 % set(auto2) -> clear(echo_input).
% 0.49/1.03 % set(auto2) -> set(quiet).
% 0.49/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.03 % set(auto2) -> clear(print_given).
% 0.49/1.03 assign(lrs_ticks,-1).
% 0.49/1.03 assign(sos_limit,10000).
% 0.49/1.03 assign(order,kbo).
% 0.49/1.03 set(lex_order_vars).
% 0.49/1.03 clear(print_given).
% 0.49/1.03
% 0.49/1.03 % formulas(sos). % not echoed (13 formulas)
% 0.49/1.03
% 0.49/1.03 ============================== end of input ==========================
% 0.49/1.03
% 0.49/1.03 % From the command line: assign(max_seconds, 300).
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.03
% 0.49/1.03 % Formulas that are not ordinary clauses:
% 0.49/1.03 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 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.49/1.03 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 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.49/1.03 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 13 -(all X0 all X1 all X2 (leq(X0,X1) -> leq(multiplication(X0,X2),multiplication(X1,X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/1.03
% 0.49/1.03 ============================== end of process non-clausal formulas ===
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.04
% 0.78/1.04 ============================== PREDICATE ELIMINATION =================
% 0.78/1.04
% 0.78/1.04 ============================== end predicate elimination =============
% 0.78/1.04
% 0.78/1.04 Auto_denials:
% 0.78/1.04 % copying label goals to answer in negative clause
% 0.78/1.04
% 0.78/1.04 Term ordering decisions:
% 0.78/1.04 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. addition=1. multiplication=1.
% 0.78/1.04
% 0.78/1.04 ============================== end of process initial clauses ========
% 0.78/1.04
% 0.78/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.04
% 0.78/1.04 ============================== end of clauses for search =============
% 0.78/1.04
% 0.78/1.04 ============================== SEARCH ================================
% 0.78/1.04
% 0.78/1.04 % Starting search at 0.01 seconds.
% 0.78/1.04
% 0.78/1.04 ============================== PROOF =================================
% 0.78/1.04 % SZS status Theorem
% 0.78/1.04 % SZS output start Refutation
% 0.78/1.04
% 0.78/1.04 % Proof 1 at 0.02 (+ 0.00) seconds: goals.
% 0.78/1.04 % Length of proof is 11.
% 0.78/1.04 % Level of proof is 3.
% 0.78/1.04 % Maximum clause weight is 13.000.
% 0.78/1.04 % Given clauses 15.
% 0.78/1.04
% 0.78/1.04 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 13 -(all X0 all X1 all X2 (leq(X0,X1) -> leq(multiplication(X0,X2),multiplication(X1,X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.04 14 leq(c1,c2) # label(goals) # label(negated_conjecture). [clausify(13)].
% 0.78/1.04 27 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 0.78/1.04 28 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(27),flip(a)].
% 0.78/1.04 29 -leq(multiplication(c1,c3),multiplication(c2,c3)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(13)].
% 0.78/1.04 30 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 0.78/1.04 31 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 0.78/1.04 38 addition(c1,c2) = c2. [hyper(30,a,14,a)].
% 0.78/1.04 40 $F # answer(goals). [ur(31,a,29,a),rewrite([28(7),38(3)]),xx(a)].
% 0.78/1.04
% 0.78/1.04 % SZS output end Refutation
% 0.78/1.04 ============================== end of proof ==========================
% 0.78/1.04
% 0.78/1.04 ============================== STATISTICS ============================
% 0.78/1.04
% 0.78/1.04 Given=15. Generated=134. Kept=23. proofs=1.
% 0.78/1.04 Usable=15. Sos=7. Demods=18. Limbo=1, Disabled=15. Hints=0.
% 0.78/1.04 Megabytes=0.06.
% 0.78/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.78/1.04
% 0.78/1.04 ============================== end of statistics =====================
% 0.78/1.04
% 0.78/1.04 ============================== end of search =========================
% 0.78/1.04
% 0.78/1.04 THEOREM PROVED
% 0.78/1.04 % SZS status Theorem
% 0.78/1.04
% 0.78/1.04 Exiting with 1 proof.
% 0.78/1.04
% 0.78/1.04 Process 16260 exit (max_proofs) Thu Jun 16 13:09:55 2022
% 0.78/1.04 Prover9 interrupted
%------------------------------------------------------------------------------