TSTP Solution File: BOO010-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO010-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:59 EDT 2022
% Result : Unsatisfiable 0.83s 1.13s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : BOO010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 : Wed Jun 1 19:29:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.13 ============================== Prover9 ===============================
% 0.83/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.13 Process 12082 was started by sandbox on n020.cluster.edu,
% 0.83/1.13 Wed Jun 1 19:29:09 2022
% 0.83/1.13 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11928_n020.cluster.edu".
% 0.83/1.13 ============================== end of head ===========================
% 0.83/1.13
% 0.83/1.13 ============================== INPUT =================================
% 0.83/1.13
% 0.83/1.13 % Reading from file /tmp/Prover9_11928_n020.cluster.edu
% 0.83/1.13
% 0.83/1.13 set(prolog_style_variables).
% 0.83/1.13 set(auto2).
% 0.83/1.13 % set(auto2) -> set(auto).
% 0.83/1.13 % set(auto) -> set(auto_inference).
% 0.83/1.13 % set(auto) -> set(auto_setup).
% 0.83/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.13 % set(auto) -> set(auto_limits).
% 0.83/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.13 % set(auto) -> set(auto_denials).
% 0.83/1.13 % set(auto) -> set(auto_process).
% 0.83/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.13 % set(auto2) -> assign(stats, some).
% 0.83/1.13 % set(auto2) -> clear(echo_input).
% 0.83/1.13 % set(auto2) -> set(quiet).
% 0.83/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.13 % set(auto2) -> clear(print_given).
% 0.83/1.13 assign(lrs_ticks,-1).
% 0.83/1.13 assign(sos_limit,10000).
% 0.83/1.13 assign(order,kbo).
% 0.83/1.13 set(lex_order_vars).
% 0.83/1.13 clear(print_given).
% 0.83/1.13
% 0.83/1.13 % formulas(sos). % not echoed (23 formulas)
% 0.83/1.13
% 0.83/1.13 ============================== end of input ==========================
% 0.83/1.13
% 0.83/1.13 % From the command line: assign(max_seconds, 300).
% 0.83/1.13
% 0.83/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.13
% 0.83/1.13 % Formulas that are not ordinary clauses:
% 0.83/1.13
% 0.83/1.13 ============================== end of process non-clausal formulas ===
% 0.83/1.13
% 0.83/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.13
% 0.83/1.13 ============================== PREDICATE ELIMINATION =================
% 0.83/1.13
% 0.83/1.13 ============================== end predicate elimination =============
% 0.83/1.13
% 0.83/1.13 Auto_denials:
% 0.83/1.13 % copying label prove_equations to answer in negative clause
% 0.83/1.13
% 0.83/1.13 Term ordering decisions:
% 0.83/1.13
% 0.83/1.13 % Assigning unary symbol inverse kb_weight 0 and highest precedence (10).
% 0.83/1.13 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. x=1. y=1. add=1. multiply=1. inverse=0.
% 0.83/1.13
% 0.83/1.13 ============================== end of process initial clauses ========
% 0.83/1.13
% 0.83/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.13
% 0.83/1.13 ============================== end of clauses for search =============
% 0.83/1.13
% 0.83/1.13 ============================== SEARCH ================================
% 0.83/1.13
% 0.83/1.13 % Starting search at 0.01 seconds.
% 0.83/1.13
% 0.83/1.13 ============================== PROOF =================================
% 0.83/1.13 % SZS status Unsatisfiable
% 0.83/1.13 % SZS output start Refutation
% 0.83/1.13
% 0.83/1.13 % Proof 1 at 0.15 (+ 0.01) seconds: prove_equations.
% 0.83/1.13 % Length of proof is 26.
% 0.83/1.13 % Level of proof is 5.
% 0.83/1.13 % Maximum clause weight is 20.000.
% 0.83/1.13 % Given clauses 47.
% 0.83/1.13
% 0.83/1.13 1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 0.83/1.13 2 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.83/1.13 3 product(multiplicative_identity,A,A) # label(multiplicative_identity1) # label(axiom). [assumption].
% 0.83/1.13 4 product(A,multiplicative_identity,A) # label(multiplicative_identity2) # label(axiom). [assumption].
% 0.83/1.13 8 product(A,inverse(A),additive_identity) # label(multiplicative_inverse2) # label(axiom). [assumption].
% 0.83/1.13 9 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 0.83/1.13 10 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 0.83/1.13 11 -sum(x,multiply(x,y),x) # label(prove_equations) # label(negated_conjecture) # answer(prove_equations). [assumption].
% 0.83/1.13 12 -sum(A,B,C) | sum(B,A,C) # label(commutativity_of_addition) # label(axiom). [assumption].
% 0.83/1.13 13 -product(A,B,C) | product(B,A,C) # label(commutativity_of_multiplication) # label(axiom). [assumption].
% 0.83/1.13 14 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.83/1.13 15 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.83/1.13 16 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -product(A,F,V6) | sum(C,E,V6) # label(distributivity1) # label(axiom). [assumption].
% 0.83/1.13 22 -sum(A,B,C) | -sum(D,B,E) | -product(A,D,F) | -sum(F,B,V6) | product(C,E,V6) # label(distributivity7) # label(axiom). [assumption].
% 0.83/1.13 24 sum(A,B,add(B,A)). [hyper(12,a,9,a)].
% 0.83/1.13 26 product(A,B,multiply(B,A)). [hyper(13,a,10,a)].
% 0.83/1.13 29 add(A,additive_identity) = A. [hyper(14,a,9,a,b,2,a)].
% 0.83/1.13 32 multiply(A,inverse(A)) = additive_identity. [hyper(15,a,10,a,b,8,a)].
% 0.83/1.13 42 sum(additive_identity,multiply(A,additive_identity),additive_identity). [hyper(16,a,10,a,b,10,a,c,2,a,d,8,a),rewrite([32(2)])].
% 0.83/1.13 74 -sum(multiplicative_identity,y,multiplicative_identity) # answer(prove_equations). [ur(16,a,4,a,b,10,a,d,4,a,e,11,a)].
% 0.83/1.13 439 add(A,B) = add(B,A). [hyper(14,a,9,a,b,24,a)].
% 0.83/1.13 453 -product(multiplicative_identity,add(multiplicative_identity,y),multiplicative_identity) # answer(prove_equations). [ur(16,a,4,a,b,3,a,c,9,a,e,74,a)].
% 0.83/1.13 541 product(A,add(A,B),add(A,multiply(B,additive_identity))). [hyper(22,a,1,a,b,9,a,c,26,a,d,9,a),rewrite([439(1),439(4)])].
% 0.83/1.13 768 multiply(A,additive_identity) = additive_identity. [hyper(14,a,1,a,b,42,a)].
% 0.83/1.13 774 product(A,add(A,B),A). [back_rewrite(541),rewrite([768(3),29(3)])].
% 0.83/1.13 775 $F # answer(prove_equations). [resolve(774,a,453,a)].
% 0.83/1.13
% 0.83/1.13 % SZS output end Refutation
% 0.83/1.13 ============================== end of proof ==========================
% 0.83/1.13
% 0.83/1.13 ============================== STATISTICS ============================
% 0.83/1.13
% 0.83/1.13 Given=47. Generated=6243. Kept=774. proofs=1.
% 0.83/1.13 Usable=38. Sos=291. Demods=10. Limbo=6, Disabled=461. Hints=0.
% 0.83/1.13 Megabytes=0.44.
% 0.83/1.13 User_CPU=0.15, System_CPU=0.01, Wall_clock=0.
% 0.83/1.13
% 0.83/1.13 ============================== end of statistics =====================
% 0.83/1.13
% 0.83/1.13 ============================== end of search =========================
% 0.83/1.13
% 0.83/1.13 THEOREM PROVED
% 0.83/1.13 % SZS status Unsatisfiable
% 0.83/1.13
% 0.83/1.13 Exiting with 1 proof.
% 0.83/1.13
% 0.83/1.13 Process 12082 exit (max_proofs) Wed Jun 1 19:29:09 2022
% 0.83/1.13 Prover9 interrupted
%------------------------------------------------------------------------------