TSTP Solution File: RNG039-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG039-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 0.53s 0.98s
% Output : Refutation 0.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG039-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon May 30 11:11:57 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.53/0.98 ============================== Prover9 ===============================
% 0.53/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.53/0.98 Process 2298 was started by sandbox2 on n032.cluster.edu,
% 0.53/0.98 Mon May 30 11:11:58 2022
% 0.53/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2138_n032.cluster.edu".
% 0.53/0.98 ============================== end of head ===========================
% 0.53/0.98
% 0.53/0.98 ============================== INPUT =================================
% 0.53/0.98
% 0.53/0.98 % Reading from file /tmp/Prover9_2138_n032.cluster.edu
% 0.53/0.98
% 0.53/0.98 set(prolog_style_variables).
% 0.53/0.98 set(auto2).
% 0.53/0.98 % set(auto2) -> set(auto).
% 0.53/0.98 % set(auto) -> set(auto_inference).
% 0.53/0.98 % set(auto) -> set(auto_setup).
% 0.53/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.53/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.53/0.98 % set(auto) -> set(auto_limits).
% 0.53/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.53/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.53/0.98 % set(auto) -> set(auto_denials).
% 0.53/0.98 % set(auto) -> set(auto_process).
% 0.53/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.53/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.53/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.53/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.53/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.53/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.53/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.53/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.53/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.53/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.53/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.53/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.53/0.98 % set(auto2) -> assign(stats, some).
% 0.53/0.98 % set(auto2) -> clear(echo_input).
% 0.53/0.98 % set(auto2) -> set(quiet).
% 0.53/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.53/0.98 % set(auto2) -> clear(print_given).
% 0.53/0.98 assign(lrs_ticks,-1).
% 0.53/0.98 assign(sos_limit,10000).
% 0.53/0.98 assign(order,kbo).
% 0.53/0.98 set(lex_order_vars).
% 0.53/0.98 clear(print_given).
% 0.53/0.98
% 0.53/0.98 % formulas(sos). % not echoed (60 formulas)
% 0.53/0.98
% 0.53/0.98 ============================== end of input ==========================
% 0.53/0.98
% 0.53/0.98 % From the command line: assign(max_seconds, 300).
% 0.53/0.98
% 0.53/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.53/0.98
% 0.53/0.98 % Formulas that are not ordinary clauses:
% 0.53/0.98
% 0.53/0.98 ============================== end of process non-clausal formulas ===
% 0.53/0.98
% 0.53/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.53/0.98
% 0.53/0.98 ============================== PREDICATE ELIMINATION =================
% 0.53/0.98
% 0.53/0.98 ============================== end predicate elimination =============
% 0.53/0.98
% 0.53/0.98 Auto_denials:
% 0.53/0.98 % copying label prove_c_equals_d to answer in negative clause
% 0.53/0.98
% 0.53/0.98 Term ordering decisions:
% 0.53/0.98
% 0.53/0.98 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (11).
% 0.53/0.98 Function symbol KB weights: a=1. b=1. d=1. c=1. additive_identity=1. multiply=1. add=1. additive_inverse=0.
% 0.53/0.98
% 0.53/0.98 ============================== end of process initial clauses ========
% 0.53/0.98
% 0.53/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.53/0.98
% 0.53/0.98 ============================== end of clauses for search =============
% 0.53/0.98
% 0.53/0.98 ============================== SEARCH ================================
% 0.53/0.98
% 0.53/0.98 % Starting search at 0.01 seconds.
% 0.53/0.98
% 0.53/0.98 ============================== PROOF =================================
% 0.53/0.98 % SZS status Unsatisfiable
% 0.53/0.98 % SZS output start Refutation
% 0.53/0.98
% 0.53/0.98 % Proof 1 at 0.19 (+ 0.01) seconds: prove_c_equals_d.
% 0.53/0.98 % Length of proof is 31.
% 0.53/0.98 % Level of proof is 8.
% 0.53/0.98 % Maximum clause weight is 20.000.
% 0.53/0.98 % Given clauses 58.
% 0.53/0.98
% 0.53/0.98 14 add(A,A) = additive_identity # label(clause34) # label(axiom). [assumption].
% 0.53/0.98 15 multiply(A,A) = A # label(clause35) # label(axiom). [assumption].
% 0.53/0.98 16 multiply(a,b) = c # label(clause36) # label(axiom). [assumption].
% 0.53/0.98 17 c = multiply(a,b). [copy(16),flip(a)].
% 0.53/0.98 18 multiply(b,a) = d # label(clause37) # label(axiom). [assumption].
% 0.53/0.98 19 d = multiply(b,a). [copy(18),flip(a)].
% 0.53/0.98 20 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 0.53/0.98 21 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 0.53/0.98 22 sum(A,add(A,B),B) # label(absorbtion1) # label(axiom). [assumption].
% 0.53/0.98 23 sum(add(A,B),B,A) # label(absorbtion2) # label(axiom). [assumption].
% 0.53/0.98 24 sum(A,B,add(B,A)) # label(clause38) # label(axiom). [assumption].
% 0.53/0.98 50 product(a,multiply(b,A),multiply(B,A)) # label(clause44) # label(axiom). [assumption].
% 0.53/0.98 74 c != d # label(prove_c_equals_d) # label(negated_conjecture) # answer(prove_c_equals_d). [assumption].
% 0.53/0.98 75 multiply(b,a) != multiply(a,b) # answer(prove_c_equals_d). [copy(74),rewrite([17(1),19(4)]),flip(a)].
% 0.53/0.98 77 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.53/0.98 78 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.53/0.98 84 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -sum(C,E,V6) | product(A,F,V6) # label(distributivity2) # label(axiom). [assumption].
% 0.53/0.98 86 -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].
% 0.53/0.98 87 multiply(b,a) = c_0. [new_symbol(75)].
% 0.53/0.98 88 multiply(a,b) != c_0 # answer(prove_c_equals_d). [back_rewrite(75),rewrite([87(3)]),flip(a)].
% 0.53/0.98 101 product(a,multiply(b,A),A). [para(15(a,1),50(a,3))].
% 0.53/0.98 106 add(A,B) = add(B,A). [hyper(77,a,24,a,b,21,a)].
% 0.53/0.98 116 multiply(a,multiply(b,A)) = multiply(B,A). [hyper(78,a,50,a,b,20,a),flip(a)].
% 0.53/0.98 541 -product(a,b,c_0) # answer(prove_c_equals_d). [ur(78,a,20,a,c,88,a)].
% 0.53/0.98 1831 product(A,multiply(b,B),add(B,multiply(add(A,a),multiply(b,B)))). [hyper(86,a,20,a,b,101,a,c,23,a,d,21,a),rewrite([106(8)])].
% 0.53/0.98 1971 multiply(a,multiply(b,A)) = A. [hyper(78,a,20,a,b,101,a)].
% 0.53/0.98 1973 -product(a,add(b,multiply(b,add(A,c_0))),A) # answer(prove_c_equals_d). [ur(84,b,101,a,c,23,a,d,22,a,e,541,a)].
% 0.53/0.98 1992 multiply(A,B) = B. [back_rewrite(116),rewrite([1971(4)]),flip(a)].
% 0.53/0.98 1997 -product(a,add(b,add(A,c_0)),A) # answer(prove_c_equals_d). [back_rewrite(1973),rewrite([1992(6)])].
% 0.53/0.98 2012 product(A,B,additive_identity). [back_rewrite(1831),rewrite([1992(2),1992(4),1992(3),14(1)])].
% 0.53/0.98 2013 $F # answer(prove_c_equals_d). [resolve(2012,a,1997,a)].
% 0.53/0.98
% 0.53/0.98 % SZS output end Refutation
% 0.53/0.98 ============================== end of proof ==========================
% 0.53/0.98
% 0.53/0.98 ============================== STATISTICS ============================
% 0.53/0.98
% 0.53/0.98 Given=58. Generated=7542. Kept=1986. proofs=1.
% 0.53/0.98 Usable=42. Sos=1101. Demods=17. Limbo=20, Disabled=882. Hints=0.
% 0.53/0.98 Megabytes=1.32.
% 0.53/0.98 User_CPU=0.19, System_CPU=0.01, Wall_clock=0.
% 0.53/0.98
% 0.53/0.98 ============================== end of statistics =====================
% 0.53/0.98
% 0.53/0.98 ============================== end of search =========================
% 0.53/0.98
% 0.53/0.98 THEOREM PROVED
% 0.53/0.98 % SZS status Unsatisfiable
% 0.53/0.98
% 0.53/0.98 Exiting with 1 proof.
% 0.53/0.98
% 0.53/0.98 Process 2298 exit (max_proofs) Mon May 30 11:11:58 2022
% 0.53/0.98 Prover9 interrupted
%------------------------------------------------------------------------------