TSTP Solution File: RNG039-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG039-2 : 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 : Mon Jul 18 20:39:15 EDT 2022
% Result : Unsatisfiable 1.72s 2.03s
% Output : Refutation 1.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG039-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 : Mon May 30 17:04:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.72/2.03 ============================== Prover9 ===============================
% 1.72/2.03 Prover9 (32) version 2009-11A, November 2009.
% 1.72/2.03 Process 30746 was started by sandbox2 on n028.cluster.edu,
% 1.72/2.03 Mon May 30 17:04:35 2022
% 1.72/2.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30593_n028.cluster.edu".
% 1.72/2.03 ============================== end of head ===========================
% 1.72/2.03
% 1.72/2.03 ============================== INPUT =================================
% 1.72/2.03
% 1.72/2.03 % Reading from file /tmp/Prover9_30593_n028.cluster.edu
% 1.72/2.03
% 1.72/2.03 set(prolog_style_variables).
% 1.72/2.03 set(auto2).
% 1.72/2.03 % set(auto2) -> set(auto).
% 1.72/2.03 % set(auto) -> set(auto_inference).
% 1.72/2.03 % set(auto) -> set(auto_setup).
% 1.72/2.03 % set(auto_setup) -> set(predicate_elim).
% 1.72/2.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.72/2.03 % set(auto) -> set(auto_limits).
% 1.72/2.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.72/2.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.72/2.03 % set(auto) -> set(auto_denials).
% 1.72/2.03 % set(auto) -> set(auto_process).
% 1.72/2.03 % set(auto2) -> assign(new_constants, 1).
% 1.72/2.03 % set(auto2) -> assign(fold_denial_max, 3).
% 1.72/2.03 % set(auto2) -> assign(max_weight, "200.000").
% 1.72/2.03 % set(auto2) -> assign(max_hours, 1).
% 1.72/2.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.72/2.03 % set(auto2) -> assign(max_seconds, 0).
% 1.72/2.03 % set(auto2) -> assign(max_minutes, 5).
% 1.72/2.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.72/2.03 % set(auto2) -> set(sort_initial_sos).
% 1.72/2.03 % set(auto2) -> assign(sos_limit, -1).
% 1.72/2.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.72/2.03 % set(auto2) -> assign(max_megs, 400).
% 1.72/2.03 % set(auto2) -> assign(stats, some).
% 1.72/2.03 % set(auto2) -> clear(echo_input).
% 1.72/2.03 % set(auto2) -> set(quiet).
% 1.72/2.03 % set(auto2) -> clear(print_initial_clauses).
% 1.72/2.03 % set(auto2) -> clear(print_given).
% 1.72/2.03 assign(lrs_ticks,-1).
% 1.72/2.03 assign(sos_limit,10000).
% 1.72/2.03 assign(order,kbo).
% 1.72/2.03 set(lex_order_vars).
% 1.72/2.03 clear(print_given).
% 1.72/2.03
% 1.72/2.03 % formulas(sos). % not echoed (74 formulas)
% 1.72/2.03
% 1.72/2.03 ============================== end of input ==========================
% 1.72/2.03
% 1.72/2.03 % From the command line: assign(max_seconds, 300).
% 1.72/2.03
% 1.72/2.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.72/2.03
% 1.72/2.03 % Formulas that are not ordinary clauses:
% 1.72/2.03
% 1.72/2.03 ============================== end of process non-clausal formulas ===
% 1.72/2.03
% 1.72/2.03 ============================== PROCESS INITIAL CLAUSES ===============
% 1.72/2.03
% 1.72/2.03 ============================== PREDICATE ELIMINATION =================
% 1.72/2.03
% 1.72/2.03 ============================== end predicate elimination =============
% 1.72/2.03
% 1.72/2.03 Auto_denials:
% 1.72/2.03 % copying label prove_c_equals_d to answer in negative clause
% 1.72/2.03
% 1.72/2.03 Term ordering decisions:
% 1.72/2.03 Function symbol KB weights: a=1. b=1. d=1. c=1. additive_identity=1. multiply=1. add=1.
% 1.72/2.03
% 1.72/2.03 ============================== end of process initial clauses ========
% 1.72/2.03
% 1.72/2.03 ============================== CLAUSES FOR SEARCH ====================
% 1.72/2.03
% 1.72/2.03 ============================== end of clauses for search =============
% 1.72/2.03
% 1.72/2.03 ============================== SEARCH ================================
% 1.72/2.03
% 1.72/2.03 % Starting search at 0.02 seconds.
% 1.72/2.03
% 1.72/2.03 Low Water (keep): wt=14.000, iters=3335
% 1.72/2.03
% 1.72/2.03 Low Water (keep): wt=12.000, iters=3725
% 1.72/2.03
% 1.72/2.03 Low Water (keep): wt=10.000, iters=3367
% 1.72/2.03
% 1.72/2.03 Low Water (displace): id=2807, wt=20.000
% 1.72/2.03
% 1.72/2.03 Low Water (displace): id=2647, wt=18.000
% 1.72/2.03
% 1.72/2.03 Low Water (displace): id=3210, wt=16.000
% 1.72/2.03
% 1.72/2.03 Low Water (displace): id=9032, wt=13.000
% 1.72/2.03
% 1.72/2.03 Low Water (displace): id=7420, wt=12.000
% 1.72/2.03
% 1.72/2.03 Low Water (keep): wt=8.000, iters=3373
% 1.72/2.03
% 1.72/2.03 ============================== PROOF =================================
% 1.72/2.03 % SZS status Unsatisfiable
% 1.72/2.03 % SZS output start Refutation
% 1.72/2.03
% 1.72/2.03 % Proof 1 at 1.03 (+ 0.03) seconds: prove_c_equals_d.
% 1.72/2.03 % Length of proof is 32.
% 1.72/2.03 % Level of proof is 6.
% 1.72/2.03 % Maximum clause weight is 20.000.
% 1.72/2.03 % Given clauses 185.
% 1.72/2.03
% 1.72/2.03 2 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 1.72/2.03 3 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 1.72/2.03 4 product(additive_identity,A,additive_identity) # label(multiplicative_identity1) # label(axiom). [assumption].
% 1.72/2.03 7 product(a,c,c) # label(clause39) # label(axiom). [assumption].
% 1.72/2.03 16 equalish(multiply(A,A),A) # label(clause35) # label(axiom). [assumption].
% 1.72/2.03 18 equalish(multiply(b,a),d) # label(clause37) # label(axiom). [assumption].
% 1.72/2.03 36 product(A,multiply(A,B),multiply(A,B)) # label(clause43) # label(axiom). [assumption].
% 1.72/2.03 37 product(a,multiply(b,A),multiply(B,A)) # label(clause44) # label(axiom). [assumption].
% 1.72/2.03 50 -equalish(c,d) # label(prove_c_equals_d) # label(negated_conjecture) # answer(prove_c_equals_d). [assumption].
% 1.72/2.03 52 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivity) # label(axiom). [assumption].
% 1.72/2.03 59 -equalish(A,B) | -sum(C,D,A) | sum(C,D,B) # label(sum_substitution3) # label(axiom). [assumption].
% 1.72/2.03 60 -equalish(A,B) | -product(A,C,D) | product(B,C,D) # label(product_substitution1) # label(axiom). [assumption].
% 1.72/2.03 61 -equalish(A,B) | -product(C,A,D) | product(C,B,D) # label(product_substitution2) # label(axiom). [assumption].
% 1.72/2.03 62 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom). [assumption].
% 1.72/2.03 63 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 1.72/2.03 64 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 1.72/2.03 74 -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].
% 1.72/2.03 159 sum(additive_identity,multiply(b,a),d). [ur(59,a,18,a,b,2,a)].
% 1.72/2.03 167 sum(additive_identity,multiply(A,A),A). [ur(59,a,16,a,b,2,a)].
% 1.72/2.03 189 product(a,d,multiply(A,a)). [ur(61,a,18,a,b,37,a)].
% 1.72/2.03 236 -sum(d,additive_identity,c) # answer(prove_c_equals_d). [ur(63,b,3,a,c,50,a)].
% 1.72/2.03 259 equalish(multiply(additive_identity,A),additive_identity). [ur(64,a,36,a,b,4,a)].
% 1.72/2.03 5466 -equalish(d,c) # answer(prove_c_equals_d). [ur(59,b,3,a,c,236,a)].
% 1.72/2.03 9665 product(a,d,a). [ur(74,a,4,a,b,189,a,c,2,a,d,167,a)].
% 1.72/2.03 9666 product(a,d,d). [ur(74,a,4,a,b,189,a,c,2,a,d,159,a)].
% 1.72/2.03 9722 product(a,d,additive_identity). [ur(62,a,259,a,b,189,a)].
% 1.72/2.03 11489 equalish(d,additive_identity). [ur(64,a,9666,a,b,9722,a)].
% 1.72/2.03 11490 equalish(a,additive_identity). [ur(64,a,9665,a,b,9722,a)].
% 1.72/2.03 11618 -equalish(additive_identity,c) # answer(prove_c_equals_d). [ur(52,a,11489,a,c,5466,a)].
% 1.72/2.03 11624 product(additive_identity,c,c). [ur(60,a,11490,a,b,7,a)].
% 1.72/2.03 11828 -product(additive_identity,A,c) # answer(prove_c_equals_d). [ur(64,a,4,a,c,11618,a)].
% 1.72/2.03 11829 $F # answer(prove_c_equals_d). [resolve(11828,a,11624,a)].
% 1.72/2.03
% 1.72/2.03 % SZS output end Refutation
% 1.72/2.03 ============================== end of proof ==========================
% 1.72/2.03
% 1.72/2.03 ============================== STATISTICS ============================
% 1.72/2.03
% 1.72/2.03 Given=185. Generated=52444. Kept=11828. proofs=1.
% 1.72/2.03 Usable=167. Sos=9999. Demods=0. Limbo=40, Disabled=1695. Hints=0.
% 1.72/2.03 Megabytes=6.80.
% 1.72/2.03 User_CPU=1.03, System_CPU=0.03, Wall_clock=1.
% 1.72/2.03
% 1.72/2.03 ============================== end of statistics =====================
% 1.72/2.03
% 1.72/2.03 ============================== end of search =========================
% 1.72/2.03
% 1.72/2.03 THEOREM PROVED
% 1.72/2.03 % SZS status Unsatisfiable
% 1.72/2.03
% 1.72/2.03 Exiting with 1 proof.
% 1.72/2.03
% 1.72/2.03 Process 30746 exit (max_proofs) Mon May 30 17:04:36 2022
% 1.72/2.03 Prover9 interrupted
%------------------------------------------------------------------------------