TSTP Solution File: BOO003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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.48s 1.07s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : BOO003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Thu Jun 2 00:17:27 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.48/1.07 ============================== Prover9 ===============================
% 0.48/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.07 Process 13081 was started by sandbox on n026.cluster.edu,
% 0.48/1.07 Thu Jun 2 00:17:27 2022
% 0.48/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12927_n026.cluster.edu".
% 0.48/1.07 ============================== end of head ===========================
% 0.48/1.07
% 0.48/1.07 ============================== INPUT =================================
% 0.48/1.07
% 0.48/1.07 % Reading from file /tmp/Prover9_12927_n026.cluster.edu
% 0.48/1.07
% 0.48/1.07 set(prolog_style_variables).
% 0.48/1.07 set(auto2).
% 0.48/1.07 % set(auto2) -> set(auto).
% 0.48/1.07 % set(auto) -> set(auto_inference).
% 0.48/1.07 % set(auto) -> set(auto_setup).
% 0.48/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.07 % set(auto) -> set(auto_limits).
% 0.48/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.07 % set(auto) -> set(auto_denials).
% 0.48/1.07 % set(auto) -> set(auto_process).
% 0.48/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.07 % set(auto2) -> assign(stats, some).
% 0.48/1.07 % set(auto2) -> clear(echo_input).
% 0.48/1.07 % set(auto2) -> set(quiet).
% 0.48/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.07 % set(auto2) -> clear(print_given).
% 0.48/1.07 assign(lrs_ticks,-1).
% 0.48/1.07 assign(sos_limit,10000).
% 0.48/1.07 assign(order,kbo).
% 0.48/1.07 set(lex_order_vars).
% 0.48/1.07 clear(print_given).
% 0.48/1.07
% 0.48/1.07 % formulas(sos). % not echoed (23 formulas)
% 0.48/1.07
% 0.48/1.07 ============================== end of input ==========================
% 0.48/1.07
% 0.48/1.07 % From the command line: assign(max_seconds, 300).
% 0.48/1.07
% 0.48/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.07
% 0.48/1.07 % Formulas that are not ordinary clauses:
% 0.48/1.07
% 0.48/1.07 ============================== end of process non-clausal formulas ===
% 0.48/1.07
% 0.48/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.07
% 0.48/1.07 ============================== PREDICATE ELIMINATION =================
% 0.48/1.07
% 0.48/1.07 ============================== end predicate elimination =============
% 0.48/1.07
% 0.48/1.07 Auto_denials:
% 0.48/1.07 % copying label prove_both_equalities to answer in negative clause
% 0.48/1.07
% 0.48/1.07 Term ordering decisions:
% 0.48/1.07
% 0.48/1.07 % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 0.48/1.07 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. x=1. add=1. multiply=1. inverse=0.
% 0.48/1.07
% 0.48/1.07 ============================== end of process initial clauses ========
% 0.48/1.07
% 0.48/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.48/1.07
% 0.48/1.07 ============================== end of clauses for search =============
% 0.48/1.07
% 0.48/1.07 ============================== SEARCH ================================
% 0.48/1.07
% 0.48/1.07 % Starting search at 0.01 seconds.
% 0.48/1.07
% 0.48/1.07 ============================== PROOF =================================
% 0.48/1.07 % SZS status Unsatisfiable
% 0.48/1.07 % SZS output start Refutation
% 0.48/1.07
% 0.48/1.07 % Proof 1 at 0.04 (+ 0.00) seconds: prove_both_equalities.
% 0.48/1.07 % Length of proof is 13.
% 0.48/1.07 % Level of proof is 3.
% 0.48/1.07 % Maximum clause weight is 20.000.
% 0.48/1.07 % Given clauses 20.
% 0.48/1.07
% 0.48/1.07 1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 0.48/1.07 4 product(A,multiplicative_identity,A) # label(multiplicative_identity2) # label(axiom). [assumption].
% 0.48/1.07 5 sum(inverse(A),A,multiplicative_identity) # label(additive_inverse1) # label(axiom). [assumption].
% 0.48/1.07 8 product(A,inverse(A),additive_identity) # label(multiplicative_inverse2) # label(axiom). [assumption].
% 0.48/1.07 10 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 0.48/1.07 11 -product(x,x,x) # label(prove_both_equalities) # label(negated_conjecture) # answer(prove_both_equalities). [assumption].
% 0.48/1.07 15 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.48/1.07 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.48/1.07 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.48/1.07 33 multiply(A,multiplicative_identity) = A. [hyper(15,a,10,a,b,4,a)].
% 0.48/1.07 55 sum(additive_identity,multiply(A,A),A). [hyper(16,a,8,a,b,10,a,c,5,a,d,10,a),rewrite([33(4)])].
% 0.48/1.07 208 -sum(additive_identity,multiply(x,x),x) # answer(prove_both_equalities). [ur(20,a,1,a,b,1,a,c,10,a,e,11,a)].
% 0.48/1.07 209 $F # answer(prove_both_equalities). [resolve(208,a,55,a)].
% 0.48/1.07
% 0.48/1.07 % SZS output end Refutation
% 0.48/1.07 ============================== end of proof ==========================
% 0.48/1.07
% 0.48/1.07 ============================== STATISTICS ============================
% 0.48/1.07
% 0.48/1.07 Given=20. Generated=1111. Kept=208. proofs=1.
% 0.48/1.07 Usable=20. Sos=146. Demods=10. Limbo=38, Disabled=26. Hints=0.
% 0.48/1.07 Megabytes=0.16.
% 0.48/1.07 User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
% 0.48/1.07
% 0.48/1.07 ============================== end of statistics =====================
% 0.48/1.07
% 0.48/1.07 ============================== end of search =========================
% 0.48/1.07
% 0.48/1.07 THEOREM PROVED
% 0.48/1.07 % SZS status Unsatisfiable
% 0.48/1.07
% 0.48/1.07 Exiting with 1 proof.
% 0.48/1.07
% 0.48/1.07 Process 13081 exit (max_proofs) Thu Jun 2 00:17:28 2022
% 0.48/1.07 Prover9 interrupted
%------------------------------------------------------------------------------