TSTP Solution File: BOO003-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO003-4 : TPTP v8.1.0. Released v1.1.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 : Thu Jul 14 23:47:56 EDT 2022
% Result : Unsatisfiable 0.46s 1.07s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO003-4 : TPTP v8.1.0. Released v1.1.0.
% 0.11/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 : Wed Jun 1 18:57:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.07 ============================== Prover9 ===============================
% 0.46/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.07 Process 27804 was started by sandbox2 on n023.cluster.edu,
% 0.46/1.07 Wed Jun 1 18:57:12 2022
% 0.46/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27397_n023.cluster.edu".
% 0.46/1.07 ============================== end of head ===========================
% 0.46/1.07
% 0.46/1.07 ============================== INPUT =================================
% 0.46/1.07
% 0.46/1.07 % Reading from file /tmp/Prover9_27397_n023.cluster.edu
% 0.46/1.07
% 0.46/1.07 set(prolog_style_variables).
% 0.46/1.07 set(auto2).
% 0.46/1.07 % set(auto2) -> set(auto).
% 0.46/1.07 % set(auto) -> set(auto_inference).
% 0.46/1.07 % set(auto) -> set(auto_setup).
% 0.46/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.07 % set(auto) -> set(auto_limits).
% 0.46/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.07 % set(auto) -> set(auto_denials).
% 0.46/1.07 % set(auto) -> set(auto_process).
% 0.46/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.07 % set(auto2) -> assign(stats, some).
% 0.46/1.07 % set(auto2) -> clear(echo_input).
% 0.46/1.07 % set(auto2) -> set(quiet).
% 0.46/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.07 % set(auto2) -> clear(print_given).
% 0.46/1.07 assign(lrs_ticks,-1).
% 0.46/1.07 assign(sos_limit,10000).
% 0.46/1.07 assign(order,kbo).
% 0.46/1.07 set(lex_order_vars).
% 0.46/1.07 clear(print_given).
% 0.46/1.07
% 0.46/1.07 % formulas(sos). % not echoed (9 formulas)
% 0.46/1.07
% 0.46/1.07 ============================== end of input ==========================
% 0.46/1.07
% 0.46/1.07 % From the command line: assign(max_seconds, 300).
% 0.46/1.07
% 0.46/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.07
% 0.46/1.07 % Formulas that are not ordinary clauses:
% 0.46/1.07
% 0.46/1.07 ============================== end of process non-clausal formulas ===
% 0.46/1.07
% 0.46/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.07
% 0.46/1.07 ============================== PREDICATE ELIMINATION =================
% 0.46/1.07
% 0.46/1.07 ============================== end predicate elimination =============
% 0.46/1.07
% 0.46/1.07 Auto_denials:
% 0.46/1.07 % copying label prove_a_times_a_is_a to answer in negative clause
% 0.46/1.07
% 0.46/1.07 Term ordering decisions:
% 0.46/1.07
% 0.46/1.07 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.46/1.07 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. inverse=0.
% 0.46/1.07
% 0.46/1.07 ============================== end of process initial clauses ========
% 0.46/1.07
% 0.46/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.07
% 0.46/1.07 ============================== end of clauses for search =============
% 0.46/1.07
% 0.46/1.07 ============================== SEARCH ================================
% 0.46/1.07
% 0.46/1.07 % Starting search at 0.01 seconds.
% 0.46/1.07
% 0.46/1.07 ============================== PROOF =================================
% 0.46/1.07 % SZS status Unsatisfiable
% 0.46/1.07 % SZS output start Refutation
% 0.46/1.07
% 0.46/1.07 % Proof 1 at 0.01 (+ 0.00) seconds: prove_a_times_a_is_a.
% 0.46/1.07 % Length of proof is 17.
% 0.46/1.07 % Level of proof is 8.
% 0.46/1.07 % Maximum clause weight is 13.000.
% 0.46/1.07 % Given clauses 20.
% 0.46/1.07
% 0.46/1.07 1 add(A,additive_identity) = A # label(additive_id1) # label(axiom). [assumption].
% 0.46/1.07 2 multiply(A,multiplicative_identity) = A # label(multiplicative_id1) # label(axiom). [assumption].
% 0.46/1.07 5 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.46/1.07 6 multiply(A,B) = multiply(B,A) # label(commutativity_of_multiply) # label(axiom). [assumption].
% 0.46/1.07 7 add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)) # label(distributivity1) # label(axiom). [assumption].
% 0.46/1.07 8 multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)). [copy(7),flip(a)].
% 0.46/1.07 9 multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)) # label(distributivity2) # label(axiom). [assumption].
% 0.46/1.07 10 add(multiply(A,B),multiply(A,C)) = multiply(A,add(B,C)). [copy(9),flip(a)].
% 0.46/1.07 11 multiply(a,a) != a # label(prove_a_times_a_is_a) # label(negated_conjecture) # answer(prove_a_times_a_is_a). [assumption].
% 0.46/1.07 12 multiply(A,add(A,B)) = add(A,multiply(B,additive_identity)). [para(1(a,1),8(a,1,1)),rewrite([6(4)])].
% 0.46/1.07 24 multiply(A,A) = add(A,multiply(additive_identity,additive_identity)). [para(1(a,1),12(a,1,2))].
% 0.46/1.07 39 add(multiplicative_identity,multiply(additive_identity,additive_identity)) = multiplicative_identity. [para(24(a,1),2(a,1))].
% 0.46/1.07 47 multiply(A,A) = add(A,add(additive_identity,multiply(additive_identity,additive_identity))). [para(24(a,1),12(a,2,2)),rewrite([1(2)])].
% 0.46/1.07 50 add(additive_identity,multiplicative_identity) = multiplicative_identity. [para(39(a,1),8(a,2)),rewrite([5(3),5(6),8(7),2(4)])].
% 0.46/1.07 80 add(A,multiply(A,additive_identity)) = A. [para(50(a,1),10(a,2,2)),rewrite([2(4),5(3),2(5)])].
% 0.46/1.07 82 multiply(A,A) = A. [back_rewrite(47),rewrite([80(6),1(3)])].
% 0.46/1.07 83 $F # answer(prove_a_times_a_is_a). [resolve(82,a,11,a)].
% 0.46/1.07
% 0.46/1.07 % SZS output end Refutation
% 0.46/1.07 ============================== end of proof ==========================
% 0.46/1.07
% 0.46/1.07 ============================== STATISTICS ============================
% 0.46/1.07
% 0.46/1.07 Given=20. Generated=231. Kept=80. proofs=1.
% 0.46/1.07 Usable=14. Sos=39. Demods=40. Limbo=2, Disabled=33. Hints=0.
% 0.46/1.07 Megabytes=0.09.
% 0.46/1.07 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.07
% 0.46/1.07 ============================== end of statistics =====================
% 0.46/1.07
% 0.46/1.07 ============================== end of search =========================
% 0.46/1.07
% 0.46/1.07 THEOREM PROVED
% 0.46/1.07 % SZS status Unsatisfiable
% 0.46/1.07
% 0.46/1.07 Exiting with 1 proof.
% 0.46/1.07
% 0.46/1.07 Process 27804 exit (max_proofs) Wed Jun 1 18:57:12 2022
% 0.46/1.07 Prover9 interrupted
%------------------------------------------------------------------------------