TSTP Solution File: RNG004-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG004-3 : 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 7.10s 7.39s
% Output : Refutation 7.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG004-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/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 16:09:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 7.10/7.39 ============================== Prover9 ===============================
% 7.10/7.39 Prover9 (32) version 2009-11A, November 2009.
% 7.10/7.39 Process 10040 was started by sandbox on n022.cluster.edu,
% 7.10/7.39 Mon May 30 16:09:53 2022
% 7.10/7.39 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9887_n022.cluster.edu".
% 7.10/7.39 ============================== end of head ===========================
% 7.10/7.39
% 7.10/7.39 ============================== INPUT =================================
% 7.10/7.39
% 7.10/7.39 % Reading from file /tmp/Prover9_9887_n022.cluster.edu
% 7.10/7.39
% 7.10/7.39 set(prolog_style_variables).
% 7.10/7.39 set(auto2).
% 7.10/7.39 % set(auto2) -> set(auto).
% 7.10/7.39 % set(auto) -> set(auto_inference).
% 7.10/7.39 % set(auto) -> set(auto_setup).
% 7.10/7.39 % set(auto_setup) -> set(predicate_elim).
% 7.10/7.39 % set(auto_setup) -> assign(eq_defs, unfold).
% 7.10/7.39 % set(auto) -> set(auto_limits).
% 7.10/7.39 % set(auto_limits) -> assign(max_weight, "100.000").
% 7.10/7.39 % set(auto_limits) -> assign(sos_limit, 20000).
% 7.10/7.39 % set(auto) -> set(auto_denials).
% 7.10/7.39 % set(auto) -> set(auto_process).
% 7.10/7.39 % set(auto2) -> assign(new_constants, 1).
% 7.10/7.39 % set(auto2) -> assign(fold_denial_max, 3).
% 7.10/7.39 % set(auto2) -> assign(max_weight, "200.000").
% 7.10/7.39 % set(auto2) -> assign(max_hours, 1).
% 7.10/7.39 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 7.10/7.39 % set(auto2) -> assign(max_seconds, 0).
% 7.10/7.39 % set(auto2) -> assign(max_minutes, 5).
% 7.10/7.39 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 7.10/7.39 % set(auto2) -> set(sort_initial_sos).
% 7.10/7.39 % set(auto2) -> assign(sos_limit, -1).
% 7.10/7.39 % set(auto2) -> assign(lrs_ticks, 3000).
% 7.10/7.39 % set(auto2) -> assign(max_megs, 400).
% 7.10/7.39 % set(auto2) -> assign(stats, some).
% 7.10/7.39 % set(auto2) -> clear(echo_input).
% 7.10/7.39 % set(auto2) -> set(quiet).
% 7.10/7.39 % set(auto2) -> clear(print_initial_clauses).
% 7.10/7.39 % set(auto2) -> clear(print_given).
% 7.10/7.39 assign(lrs_ticks,-1).
% 7.10/7.39 assign(sos_limit,10000).
% 7.10/7.39 assign(order,kbo).
% 7.10/7.39 set(lex_order_vars).
% 7.10/7.39 clear(print_given).
% 7.10/7.39
% 7.10/7.39 % formulas(sos). % not echoed (34 formulas)
% 7.10/7.39
% 7.10/7.39 ============================== end of input ==========================
% 7.10/7.39
% 7.10/7.39 % From the command line: assign(max_seconds, 300).
% 7.10/7.39
% 7.10/7.39 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 7.10/7.39
% 7.10/7.39 % Formulas that are not ordinary clauses:
% 7.10/7.39
% 7.10/7.39 ============================== end of process non-clausal formulas ===
% 7.10/7.39
% 7.10/7.39 ============================== PROCESS INITIAL CLAUSES ===============
% 7.10/7.39
% 7.10/7.39 ============================== PREDICATE ELIMINATION =================
% 7.10/7.39
% 7.10/7.39 ============================== end predicate elimination =============
% 7.10/7.39
% 7.10/7.39 Auto_denials:
% 7.10/7.39 % copying label prove_c_equals_d to answer in negative clause
% 7.10/7.39
% 7.10/7.39 Term ordering decisions:
% 7.10/7.39
% 7.10/7.39 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (11).
% 7.10/7.39 Function symbol KB weights: additive_identity=1. a=1. b=1. c=1. d=1. add=1. multiply=1. additive_inverse=0.
% 7.10/7.39
% 7.10/7.39 ============================== end of process initial clauses ========
% 7.10/7.39
% 7.10/7.39 ============================== CLAUSES FOR SEARCH ====================
% 7.10/7.39
% 7.10/7.39 ============================== end of clauses for search =============
% 7.10/7.39
% 7.10/7.39 ============================== SEARCH ================================
% 7.10/7.39
% 7.10/7.39 % Starting search at 0.01 seconds.
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=14.000, iters=3498
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=13.000, iters=3462
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=12.000, iters=3474
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=11.000, iters=3422
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=10.000, iters=3411
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=7791, wt=20.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=5250, wt=18.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=5024, wt=17.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=5025, wt=16.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=4848, wt=15.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=5313, wt=14.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=5662, wt=13.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=12154, wt=9.000
% 7.10/7.39
% 7.10/7.39 Low Water (displace): id=12324, wt=8.000
% 7.10/7.39
% 7.10/7.39 Low Water (keep): wt=9.000, iters=3341
% 7.10/7.39
% 7.10/7.39 ============================== PROOF =================================
% 7.10/7.39 % SZS status Unsatisfiable
% 7.10/7.39 % SZS output start Refutation
% 7.10/7.39
% 7.10/7.39 % Proof 1 at 5.92 (+ 0.49) seconds: prove_c_equals_d.
% 7.10/7.39 % Length of proof is 29.
% 7.10/7.39 % Level of proof is 5.
% 7.10/7.39 % Maximum clause weight is 20.000.
% 7.10/7.39 % Given clauses 284.
% 7.10/7.39
% 7.10/7.39 2 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 7.10/7.39 3 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 7.10/7.39 4 product(additive_identity,A,additive_identity) # label(multiplicative_identity1) # label(axiom). [assumption].
% 7.10/7.39 5 product(A,additive_identity,additive_identity) # label(multiplicative_identity2) # label(axiom). [assumption].
% 7.10/7.39 6 product(a,b,c) # label(a_times_b) # label(hypothesis). [assumption].
% 7.10/7.39 7 sum(additive_inverse(A),A,additive_identity) # label(left_inverse) # label(axiom). [assumption].
% 7.10/7.39 8 sum(A,additive_inverse(A),additive_identity) # label(right_inverse) # label(axiom). [assumption].
% 7.10/7.39 9 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 7.10/7.39 11 product(additive_inverse(a),additive_inverse(b),d) # label(a_inverse_times_b_inverse) # label(hypothesis). [assumption].
% 7.10/7.39 12 -equalish(c,d) # label(prove_c_equals_d) # label(negated_conjecture) # answer(prove_c_equals_d). [assumption].
% 7.10/7.39 21 -equalish(A,B) | -sum(C,D,A) | sum(C,D,B) # label(sum_substitution3) # label(axiom). [assumption].
% 7.10/7.39 25 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 7.10/7.39 27 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom). [assumption].
% 7.10/7.39 28 -sum(A,B,C) | -sum(B,D,E) | -sum(A,E,F) | sum(C,D,F) # label(associativity_of_addition2) # label(axiom). [assumption].
% 7.10/7.39 31 -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].
% 7.10/7.39 33 -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].
% 7.10/7.39 34 -product(A,B,C) | -product(D,B,E) | -sum(A,D,F) | -sum(C,E,V6) | product(F,B,V6) # label(distributivity4) # label(axiom). [assumption].
% 7.10/7.39 44 equalish(additive_identity,additive_inverse(additive_identity)). [ur(25,a,8,a,b,2,a)].
% 7.10/7.39 49 -sum(d,additive_identity,c) # answer(prove_c_equals_d). [ur(25,b,3,a,c,12,a)].
% 7.10/7.39 91 sum(additive_inverse(additive_identity),A,A). [ur(27,a,7,a,b,2,a,c,2,a)].
% 7.10/7.39 97 sum(additive_identity,additive_identity,additive_inverse(additive_identity)). [ur(27,a,3,a,b,8,a,c,2,a)].
% 7.10/7.39 174 sum(d,multiply(additive_inverse(a),b),additive_identity). [ur(31,a,11,a,b,9,a,c,7,a,d,5,a)].
% 7.10/7.39 416 -sum(additive_inverse(d),c,additive_identity) # answer(prove_c_equals_d). [ur(27,a,8,a,c,2,a,d,49,a)].
% 7.10/7.39 481 sum(additive_inverse(A),A,additive_inverse(additive_identity)). [ur(21,a,44,a,b,7,a)].
% 7.10/7.39 802 -product(additive_inverse(a),b,additive_inverse(d)) # answer(prove_c_equals_d). [ur(33,b,6,a,c,7,a,d,4,a,e,416,a)].
% 7.10/7.39 1119 product(additive_inverse(additive_identity),A,additive_inverse(additive_identity)). [ur(34,a,4,a,b,4,a,c,97,a,d,97,a)].
% 7.10/7.39 12174 -sum(additive_inverse(additive_identity),multiply(additive_inverse(a),b),additive_inverse(d)) # answer(prove_c_equals_d). [ur(34,a,1119,a,b,9,a,c,91,a,e,802,a)].
% 7.10/7.39 13135 sum(additive_inverse(additive_identity),multiply(additive_inverse(a),b),additive_inverse(d)). [ur(28,a,481,a,b,174,a,c,3,a)].
% 7.10/7.39 13136 $F # answer(prove_c_equals_d). [resolve(13135,a,12174,a)].
% 7.10/7.39
% 7.10/7.39 % SZS output end Refutation
% 7.10/7.39 ============================== end of proof ==========================
% 7.10/7.39
% 7.10/7.39 ============================== STATISTICS ============================
% 7.10/7.39
% 7.10/7.39 Given=284. Generated=1016408. Kept=13135. proofs=1.
% 7.10/7.39 Usable=278. Sos=9999. Demods=0. Limbo=9, Disabled=2882. Hints=0.
% 7.10/7.39 Megabytes=7.33.
% 7.10/7.39 User_CPU=5.92, System_CPU=0.49, Wall_clock=6.
% 7.10/7.39
% 7.10/7.39 ============================== end of statistics =====================
% 7.10/7.39
% 7.10/7.39 ============================== end of search =========================
% 7.10/7.39
% 7.10/7.39 THEOREM PROVED
% 7.10/7.39 % SZS status Unsatisfiable
% 7.10/7.39
% 7.10/7.39 Exiting with 1 proof.
% 7.10/7.39
% 7.10/7.39 Process 10040 exit (max_proofs) Mon May 30 16:09:59 2022
% 7.10/7.39 Prover9 interrupted
%------------------------------------------------------------------------------