TSTP Solution File: RNG007-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG007-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : Mon Jul 18 20:39:09 EDT 2022
% Result : Unsatisfiable 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : RNG007-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.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 : Mon May 30 04:59:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 12015 was started by sandbox on n019.cluster.edu,
% 0.45/1.00 Mon May 30 04:59:56 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11861_n019.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_11861_n019.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (16 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials:
% 0.45/1.00 % copying label prove_inverse to answer in negative clause
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00
% 0.45/1.00 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (6).
% 0.45/1.00 Function symbol KB weights: additive_identity=1. a=1. multiply=1. add=1. additive_inverse=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_inverse.
% 0.45/1.00 % Length of proof is 14.
% 0.45/1.00 % Level of proof is 5.
% 0.45/1.00 % Maximum clause weight is 9.000.
% 0.45/1.00 % Given clauses 7.
% 0.45/1.00
% 0.45/1.00 3 additive_inverse(additive_inverse(A)) = A # label(additive_inverse_additive_inverse) # label(axiom). [assumption].
% 0.45/1.00 6 multiply(A,A) = A # label(boolean_ring) # label(hypothesis). [assumption].
% 0.45/1.00 7 add(additive_inverse(A),A) = additive_identity # label(left_additive_inverse) # label(axiom). [assumption].
% 0.45/1.00 8 add(A,B) = add(B,A) # label(commutative_addition) # label(axiom). [assumption].
% 0.45/1.00 9 multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)) # label(multiply_additive_inverse1) # label(axiom). [assumption].
% 0.45/1.00 10 additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)). [copy(9),flip(a)].
% 0.45/1.00 11 multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)) # label(multiply_additive_inverse2) # label(axiom). [assumption].
% 0.45/1.00 12 multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)). [copy(11),rewrite([10(4)])].
% 0.45/1.00 21 add(a,a) != additive_identity # label(prove_inverse) # label(negated_conjecture) # answer(prove_inverse). [assumption].
% 0.45/1.00 22 add(A,additive_inverse(A)) = additive_identity. [back_rewrite(7),rewrite([8(2)])].
% 0.45/1.00 24 multiply(A,additive_inverse(A)) = additive_inverse(A). [para(6(a,1),10(a,1,1)),flip(a)].
% 0.45/1.00 25 additive_inverse(A) = A. [para(6(a,1),10(a,2)),rewrite([12(2),24(2),3(2)]),flip(a)].
% 0.45/1.00 26 add(A,A) = additive_identity. [back_rewrite(22),rewrite([25(1)])].
% 0.45/1.00 27 $F # answer(prove_inverse). [resolve(26,a,21,a)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=7. Generated=45. Kept=21. proofs=1.
% 0.45/1.00 Usable=6. Sos=8. Demods=14. Limbo=1, Disabled=21. Hints=0.
% 0.45/1.00 Megabytes=0.04.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 12015 exit (max_proofs) Mon May 30 04:59:56 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------