TSTP Solution File: BOO004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:57 EDT 2022
% Result : Unsatisfiable 0.41s 0.98s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : BOO004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 18:43:52 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.41/0.98 ============================== Prover9 ===============================
% 0.41/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.98 Process 5423 was started by sandbox2 on n028.cluster.edu,
% 0.41/0.98 Wed Jun 1 18:43:53 2022
% 0.41/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5270_n028.cluster.edu".
% 0.41/0.98 ============================== end of head ===========================
% 0.41/0.98
% 0.41/0.98 ============================== INPUT =================================
% 0.41/0.98
% 0.41/0.98 % Reading from file /tmp/Prover9_5270_n028.cluster.edu
% 0.41/0.98
% 0.41/0.98 set(prolog_style_variables).
% 0.41/0.98 set(auto2).
% 0.41/0.98 % set(auto2) -> set(auto).
% 0.41/0.98 % set(auto) -> set(auto_inference).
% 0.41/0.98 % set(auto) -> set(auto_setup).
% 0.41/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.98 % set(auto) -> set(auto_limits).
% 0.41/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.98 % set(auto) -> set(auto_denials).
% 0.41/0.98 % set(auto) -> set(auto_process).
% 0.41/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.98 % set(auto2) -> assign(stats, some).
% 0.41/0.98 % set(auto2) -> clear(echo_input).
% 0.41/0.98 % set(auto2) -> set(quiet).
% 0.41/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.98 % set(auto2) -> clear(print_given).
% 0.41/0.98 assign(lrs_ticks,-1).
% 0.41/0.98 assign(sos_limit,10000).
% 0.41/0.98 assign(order,kbo).
% 0.41/0.98 set(lex_order_vars).
% 0.41/0.98 clear(print_given).
% 0.41/0.98
% 0.41/0.98 % formulas(sos). % not echoed (23 formulas)
% 0.41/0.98
% 0.41/0.98 ============================== end of input ==========================
% 0.41/0.98
% 0.41/0.98 % From the command line: assign(max_seconds, 300).
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.98
% 0.41/0.98 % Formulas that are not ordinary clauses:
% 0.41/0.98
% 0.41/0.98 ============================== end of process non-clausal formulas ===
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98
% 0.41/0.98 ============================== PREDICATE ELIMINATION =================
% 0.41/0.98
% 0.41/0.98 ============================== end predicate elimination =============
% 0.41/0.98
% 0.41/0.98 Auto_denials:
% 0.41/0.98 % copying label prove_both_equalities to answer in negative clause
% 0.41/0.98
% 0.41/0.98 Term ordering decisions:
% 0.41/0.98
% 0.41/0.98 % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 0.41/0.98 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. x=1. add=1. multiply=1. inverse=0.
% 0.41/0.98
% 0.41/0.98 ============================== end of process initial clauses ========
% 0.41/0.98
% 0.41/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.98
% 0.41/0.98 ============================== end of clauses for search =============
% 0.41/0.98
% 0.41/0.98 ============================== SEARCH ================================
% 0.41/0.98
% 0.41/0.98 % Starting search at 0.01 seconds.
% 0.41/0.98
% 0.41/0.98 ============================== PROOF =================================
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98 % SZS output start Refutation
% 0.41/0.98
% 0.41/0.98 % Proof 1 at 0.03 (+ 0.00) seconds: prove_both_equalities.
% 0.41/0.98 % Length of proof is 13.
% 0.41/0.98 % Level of proof is 3.
% 0.41/0.98 % Maximum clause weight is 20.000.
% 0.41/0.98 % Given clauses 20.
% 0.41/0.98
% 0.41/0.98 2 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.41/0.98 4 product(A,multiplicative_identity,A) # label(multiplicative_identity2) # label(axiom). [assumption].
% 0.41/0.98 6 sum(A,inverse(A),multiplicative_identity) # label(additive_inverse2) # label(axiom). [assumption].
% 0.41/0.98 8 product(A,inverse(A),additive_identity) # label(multiplicative_inverse2) # label(axiom). [assumption].
% 0.41/0.98 9 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 0.41/0.98 11 -sum(x,x,x) # label(prove_both_equalities) # label(negated_conjecture) # answer(prove_both_equalities). [assumption].
% 0.41/0.98 14 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.41/0.98 18 -product(A,B,C) | -product(D,B,E) | -sum(A,D,F) | -product(F,B,V6) | sum(C,E,V6) # label(distributivity3) # label(axiom). [assumption].
% 0.41/0.98 20 -sum(A,B,C) | -sum(A,D,E) | -product(B,D,F) | -sum(A,F,V6) | product(C,E,V6) # label(distributivity5) # label(axiom). [assumption].
% 0.41/0.98 28 add(A,additive_identity) = A. [hyper(14,a,9,a,b,2,a)].
% 0.41/0.98 140 -product(add(x,x),multiplicative_identity,x) # answer(prove_both_equalities). [ur(18,a,4,a,b,4,a,c,9,a,e,11,a)].
% 0.41/0.98 184 product(add(A,A),multiplicative_identity,A). [hyper(20,a,9,a,b,6,a,c,8,a,d,9,a),rewrite([28(4)])].
% 0.41/0.98 185 $F # answer(prove_both_equalities). [resolve(184,a,140,a)].
% 0.41/0.98
% 0.41/0.98 % SZS output end Refutation
% 0.41/0.98 ============================== end of proof ==========================
% 0.41/0.98
% 0.41/0.98 ============================== STATISTICS ============================
% 0.41/0.98
% 0.41/0.98 Given=20. Generated=920. Kept=184. proofs=1.
% 0.41/0.98 Usable=20. Sos=149. Demods=10. Limbo=11, Disabled=26. Hints=0.
% 0.41/0.98 Megabytes=0.15.
% 0.41/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.41/0.98
% 0.41/0.98 ============================== end of statistics =====================
% 0.41/0.98
% 0.41/0.98 ============================== end of search =========================
% 0.41/0.98
% 0.41/0.98 THEOREM PROVED
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98
% 0.41/0.98 Exiting with 1 proof.
% 0.41/0.98
% 0.41/0.98 Process 5423 exit (max_proofs) Wed Jun 1 18:43:53 2022
% 0.41/0.98 Prover9 interrupted
%------------------------------------------------------------------------------