TSTP Solution File: RNG001-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG001-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:07 EDT 2022
% Result : Unsatisfiable 0.98s 1.30s
% Output : Refutation 0.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG001-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 19:20:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.98/1.30 ============================== Prover9 ===============================
% 0.98/1.30 Prover9 (32) version 2009-11A, November 2009.
% 0.98/1.30 Process 11773 was started by sandbox2 on n025.cluster.edu,
% 0.98/1.30 Mon May 30 19:20:28 2022
% 0.98/1.30 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11475_n025.cluster.edu".
% 0.98/1.30 ============================== end of head ===========================
% 0.98/1.30
% 0.98/1.30 ============================== INPUT =================================
% 0.98/1.30
% 0.98/1.30 % Reading from file /tmp/Prover9_11475_n025.cluster.edu
% 0.98/1.30
% 0.98/1.30 set(prolog_style_variables).
% 0.98/1.30 set(auto2).
% 0.98/1.30 % set(auto2) -> set(auto).
% 0.98/1.30 % set(auto) -> set(auto_inference).
% 0.98/1.30 % set(auto) -> set(auto_setup).
% 0.98/1.30 % set(auto_setup) -> set(predicate_elim).
% 0.98/1.30 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.98/1.30 % set(auto) -> set(auto_limits).
% 0.98/1.30 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.98/1.30 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.98/1.30 % set(auto) -> set(auto_denials).
% 0.98/1.30 % set(auto) -> set(auto_process).
% 0.98/1.30 % set(auto2) -> assign(new_constants, 1).
% 0.98/1.30 % set(auto2) -> assign(fold_denial_max, 3).
% 0.98/1.30 % set(auto2) -> assign(max_weight, "200.000").
% 0.98/1.30 % set(auto2) -> assign(max_hours, 1).
% 0.98/1.30 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.98/1.30 % set(auto2) -> assign(max_seconds, 0).
% 0.98/1.30 % set(auto2) -> assign(max_minutes, 5).
% 0.98/1.30 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.98/1.30 % set(auto2) -> set(sort_initial_sos).
% 0.98/1.30 % set(auto2) -> assign(sos_limit, -1).
% 0.98/1.30 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.98/1.30 % set(auto2) -> assign(max_megs, 400).
% 0.98/1.30 % set(auto2) -> assign(stats, some).
% 0.98/1.30 % set(auto2) -> clear(echo_input).
% 0.98/1.30 % set(auto2) -> set(quiet).
% 0.98/1.30 % set(auto2) -> clear(print_initial_clauses).
% 0.98/1.30 % set(auto2) -> clear(print_given).
% 0.98/1.30 assign(lrs_ticks,-1).
% 0.98/1.30 assign(sos_limit,10000).
% 0.98/1.30 assign(order,kbo).
% 0.98/1.30 set(lex_order_vars).
% 0.98/1.30 clear(print_given).
% 0.98/1.30
% 0.98/1.30 % formulas(sos). % not echoed (20 formulas)
% 0.98/1.30
% 0.98/1.30 ============================== end of input ==========================
% 0.98/1.30
% 0.98/1.30 % From the command line: assign(max_seconds, 300).
% 0.98/1.30
% 0.98/1.30 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.98/1.30
% 0.98/1.30 % Formulas that are not ordinary clauses:
% 0.98/1.30
% 0.98/1.30 ============================== end of process non-clausal formulas ===
% 0.98/1.30
% 0.98/1.30 ============================== PROCESS INITIAL CLAUSES ===============
% 0.98/1.30
% 0.98/1.30 ============================== PREDICATE ELIMINATION =================
% 0.98/1.30
% 0.98/1.30 ============================== end predicate elimination =============
% 0.98/1.30
% 0.98/1.30 Auto_denials:
% 0.98/1.30 % copying label prove_a_times_additive_id_is_additive_id to answer in negative clause
% 0.98/1.30
% 0.98/1.30 Term ordering decisions:
% 0.98/1.30
% 0.98/1.30 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (8).
% 0.98/1.30 Function symbol KB weights: additive_identity=1. a=1. add=1. multiply=1. additive_inverse=0.
% 0.98/1.30
% 0.98/1.30 ============================== end of process initial clauses ========
% 0.98/1.30
% 0.98/1.30 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.30
% 0.98/1.30 ============================== end of clauses for search =============
% 0.98/1.30
% 0.98/1.30 ============================== SEARCH ================================
% 0.98/1.30
% 0.98/1.30 % Starting search at 0.01 seconds.
% 0.98/1.30
% 0.98/1.30 ============================== PROOF =================================
% 0.98/1.30 % SZS status Unsatisfiable
% 0.98/1.30 % SZS output start Refutation
% 0.98/1.30
% 0.98/1.30 % Proof 1 at 0.23 (+ 0.01) seconds: prove_a_times_additive_id_is_additive_id.
% 0.98/1.30 % Length of proof is 19.
% 0.98/1.30 % Level of proof is 4.
% 0.98/1.30 % Maximum clause weight is 20.000.
% 0.98/1.30 % Given clauses 62.
% 0.98/1.30
% 0.98/1.30 1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 0.98/1.30 2 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.98/1.30 3 sum(additive_inverse(A),A,additive_identity) # label(left_inverse) # label(axiom). [assumption].
% 0.98/1.30 5 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 0.98/1.30 6 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 0.98/1.30 7 -product(a,additive_identity,additive_identity) # label(prove_a_times_additive_id_is_additive_id) # label(negated_conjecture) # answer(prove_a_times_additive_id_is_additive_id). [assumption].
% 0.98/1.30 9 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.98/1.30 13 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom). [assumption].
% 0.98/1.30 14 -sum(A,B,C) | -sum(B,D,E) | -sum(A,E,F) | sum(C,D,F) # label(associativity_of_addition2) # label(axiom). [assumption].
% 0.98/1.30 17 -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].
% 0.98/1.30 18 -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.98/1.30 24 add(A,additive_identity) = A. [hyper(9,a,6,a,b,2,a)].
% 0.98/1.30 25 add(additive_identity,A) = A. [hyper(9,a,6,a,b,1,a)].
% 0.98/1.30 33 sum(additive_inverse(A),add(A,B),B). [hyper(13,a,3,a,b,6,a,c,6,a),rewrite([25(4)])].
% 0.98/1.30 45 sum(multiply(A,B),multiply(A,additive_identity),multiply(A,B)). [hyper(17,a,5,a,b,5,a,c,2,a,d,5,a)].
% 0.98/1.30 57 -sum(multiply(a,additive_identity),multiply(a,additive_identity),additive_identity) # answer(prove_a_times_additive_id_is_additive_id). [ur(18,a,5,a,b,5,a,c,2,a,e,7,a)].
% 0.98/1.30 244 -sum(add(A,multiply(a,additive_identity)),multiply(a,additive_identity),A) # answer(prove_a_times_additive_id_is_additive_id). [ur(14,a,33,a,c,33,a,d,57,a),rewrite([24(9)])].
% 0.98/1.30 1310 sum(add(multiply(A,B),multiply(A,additive_identity)),multiply(A,additive_identity),multiply(A,B)). [hyper(14,a,6,a,b,45,a,c,45,a)].
% 0.98/1.30 1311 $F # answer(prove_a_times_additive_id_is_additive_id). [resolve(1310,a,244,a)].
% 0.98/1.30
% 0.98/1.30 % SZS output end Refutation
% 0.98/1.30 ============================== end of proof ==========================
% 0.98/1.30
% 0.98/1.30 ============================== STATISTICS ============================
% 0.98/1.30
% 0.98/1.30 Given=62. Generated=7840. Kept=1310. proofs=1.
% 0.98/1.30 Usable=58. Sos=710. Demods=14. Limbo=13, Disabled=548. Hints=0.
% 0.98/1.30 Megabytes=0.95.
% 0.98/1.30 User_CPU=0.23, System_CPU=0.01, Wall_clock=0.
% 0.98/1.30
% 0.98/1.30 ============================== end of statistics =====================
% 0.98/1.30
% 0.98/1.30 ============================== end of search =========================
% 0.98/1.30
% 0.98/1.30 THEOREM PROVED
% 0.98/1.30 % SZS status Unsatisfiable
% 0.98/1.30
% 0.98/1.30 Exiting with 1 proof.
% 0.98/1.30
% 0.98/1.30 Process 11773 exit (max_proofs) Mon May 30 19:20:28 2022
% 0.98/1.30 Prover9 interrupted
%------------------------------------------------------------------------------