TSTP Solution File: RNG002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:08 EDT 2022
% Result : Unsatisfiable 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 : Mon May 30 13:52:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 6588 was started by sandbox2 on n022.cluster.edu,
% 0.42/0.99 Mon May 30 13:52:23 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6434_n022.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_6434_n022.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (20 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials:
% 0.42/0.99 % copying label prove_b_equals_c to answer in negative clause
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99
% 0.42/0.99 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (11).
% 0.42/0.99 Function symbol KB weights: additive_identity=1. a=1. d=1. b=1. c=1. add=1. multiply=1. additive_inverse=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.03 (+ 0.00) seconds: prove_b_equals_c.
% 0.42/0.99 % Length of proof is 15.
% 0.42/0.99 % Level of proof is 4.
% 0.42/0.99 % Maximum clause weight is 16.000.
% 0.42/0.99 % Given clauses 24.
% 0.42/0.99
% 0.42/0.99 1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 0.42/0.99 3 sum(a,b,d) # label(a_plus_b_is_d) # label(hypothesis). [assumption].
% 0.42/0.99 4 sum(a,c,d) # label(a_plus_c_is_d) # label(hypothesis). [assumption].
% 0.42/0.99 5 sum(additive_inverse(A),A,additive_identity) # label(left_inverse) # label(axiom). [assumption].
% 0.42/0.99 8 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 0.42/0.99 9 b != c # label(prove_b_equals_c) # label(negated_conjecture) # answer(prove_b_equals_c). [assumption].
% 0.42/0.99 10 c != b # answer(prove_b_equals_c). [copy(9),flip(a)].
% 0.42/0.99 12 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.42/0.99 14 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom). [assumption].
% 0.42/0.99 15 -sum(A,B,C) | -sum(B,D,E) | -sum(A,E,F) | sum(C,D,F) # label(associativity_of_addition2) # label(axiom). [assumption].
% 0.42/0.99 30 add(additive_identity,A) = A. [hyper(12,a,8,a,b,1,a)].
% 0.42/0.99 34 -sum(additive_identity,b,c) # answer(prove_b_equals_c). [ur(12,b,1,a,c,10,a)].
% 0.42/0.99 46 sum(additive_inverse(a),d,c). [hyper(14,a,5,a,b,4,a,c,8,a),rewrite([30(6)])].
% 0.42/0.99 206 -sum(additive_inverse(a),d,c) # answer(prove_b_equals_c). [ur(15,a,5,a,b,3,a,d,34,a)].
% 0.42/0.99 207 $F # answer(prove_b_equals_c). [resolve(206,a,46,a)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=24. Generated=722. Kept=205. proofs=1.
% 0.42/0.99 Usable=23. Sos=92. Demods=6. Limbo=3, Disabled=106. Hints=0.
% 0.42/0.99 Megabytes=0.15.
% 0.42/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 6588 exit (max_proofs) Mon May 30 13:52:23 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------