TSTP Solution File: RNG001-3 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : RNG001-3 : 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:07 EDT 2022

% Result   : Unsatisfiable 0.49s 0.80s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09  % Problem  : RNG001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/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 10:00:57 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.49/0.80  ============================== Prover9 ===============================
% 0.49/0.80  Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.80  Process 25533 was started by sandbox2 on n032.cluster.edu,
% 0.49/0.80  Mon May 30 10:00:58 2022
% 0.49/0.80  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25380_n032.cluster.edu".
% 0.49/0.80  ============================== end of head ===========================
% 0.49/0.80  
% 0.49/0.80  ============================== INPUT =================================
% 0.49/0.80  
% 0.49/0.80  % Reading from file /tmp/Prover9_25380_n032.cluster.edu
% 0.49/0.80  
% 0.49/0.80  set(prolog_style_variables).
% 0.49/0.80  set(auto2).
% 0.49/0.80      % set(auto2) -> set(auto).
% 0.49/0.80      % set(auto) -> set(auto_inference).
% 0.49/0.80      % set(auto) -> set(auto_setup).
% 0.49/0.80      % set(auto_setup) -> set(predicate_elim).
% 0.49/0.80      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.80      % set(auto) -> set(auto_limits).
% 0.49/0.80      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.80      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.80      % set(auto) -> set(auto_denials).
% 0.49/0.80      % set(auto) -> set(auto_process).
% 0.49/0.80      % set(auto2) -> assign(new_constants, 1).
% 0.49/0.80      % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.80      % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.80      % set(auto2) -> assign(max_hours, 1).
% 0.49/0.80      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.80      % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.80      % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.80      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.80      % set(auto2) -> set(sort_initial_sos).
% 0.49/0.80      % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.80      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.80      % set(auto2) -> assign(max_megs, 400).
% 0.49/0.80      % set(auto2) -> assign(stats, some).
% 0.49/0.80      % set(auto2) -> clear(echo_input).
% 0.49/0.80      % set(auto2) -> set(quiet).
% 0.49/0.80      % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.80      % set(auto2) -> clear(print_given).
% 0.49/0.80  assign(lrs_ticks,-1).
% 0.49/0.80  assign(sos_limit,10000).
% 0.49/0.80  assign(order,kbo).
% 0.49/0.80  set(lex_order_vars).
% 0.49/0.80  clear(print_given).
% 0.49/0.80  
% 0.49/0.80  % formulas(sos).  % not echoed (8 formulas)
% 0.49/0.80  
% 0.49/0.80  ============================== end of input ==========================
% 0.49/0.80  
% 0.49/0.80  % From the command line: assign(max_seconds, 300).
% 0.49/0.80  
% 0.49/0.80  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.80  
% 0.49/0.80  % Formulas that are not ordinary clauses:
% 0.49/0.80  
% 0.49/0.80  ============================== end of process non-clausal formulas ===
% 0.49/0.80  
% 0.49/0.80  ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.80  
% 0.49/0.80  ============================== PREDICATE ELIMINATION =================
% 0.49/0.80  
% 0.49/0.80  ============================== end predicate elimination =============
% 0.49/0.80  
% 0.49/0.80  Auto_denials:
% 0.49/0.80    % copying label prove_a_times_additive_id_is_additive_id to answer in negative clause
% 0.49/0.80  
% 0.49/0.80  Term ordering decisions:
% 0.49/0.80  
% 0.49/0.80  % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (6).
% 0.49/0.80  Function symbol KB weights:  additive_identity=1. a=1. multiply=1. additive_inverse=0.
% 0.49/0.80  
% 0.49/0.80  ============================== end of process initial clauses ========
% 0.49/0.80  
% 0.49/0.80  ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.80  
% 0.49/0.80  ============================== end of clauses for search =============
% 0.49/0.80  
% 0.49/0.80  ============================== SEARCH ================================
% 0.49/0.80  
% 0.49/0.80  % Starting search at 0.01 seconds.
% 0.49/0.80  
% 0.49/0.80  ============================== PROOF =================================
% 0.49/0.80  % SZS status Unsatisfiable
% 0.49/0.80  % SZS output start Refutation
% 0.49/0.80  
% 0.49/0.80  % Proof 1 at 0.01 (+ 0.00) seconds: prove_a_times_additive_id_is_additive_id.
% 0.49/0.80  % Length of proof is 16.
% 0.49/0.80  % Level of proof is 4.
% 0.49/0.80  % Maximum clause weight is 20.000.
% 0.49/0.80  % Given clauses 20.
% 0.49/0.80  
% 0.49/0.80  1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom).  [assumption].
% 0.49/0.80  2 sum(additive_inverse(A),A,additive_identity) # label(additive_inverse1) # label(axiom).  [assumption].
% 0.49/0.80  3 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom).  [assumption].
% 0.49/0.80  4 -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.49/0.80  5 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom).  [assumption].
% 0.49/0.80  6 -sum(A,B,C) | -sum(B,D,E) | -sum(A,E,F) | sum(C,D,F) # label(associativity_of_addition2) # label(axiom).  [assumption].
% 0.49/0.80  7 -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.49/0.80  8 -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.49/0.80  9 sum(additive_inverse(additive_inverse(A)),additive_identity,A).  [ur(5,a,2,a,b,2,a,c,1,a)].
% 0.49/0.80  11 sum(multiply(A,additive_inverse(B)),multiply(A,B),multiply(A,additive_identity)).  [ur(7,a,3,a,b,3,a,c,2,a,d,3,a)].
% 0.49/0.80  16 -sum(multiply(a,additive_inverse(A)),multiply(a,A),additive_identity) # answer(prove_a_times_additive_id_is_additive_id).  [ur(8,a,3,a,b,3,a,c,2,a,e,4,a)].
% 0.49/0.80  19 sum(A,additive_identity,A).  [ur(6,a,9,a,b,1,a,c,9,a)].
% 0.49/0.80  60 sum(multiply(A,B),multiply(A,additive_identity),multiply(A,B)).  [ur(7,a,3,a,b,3,a,c,19,a,d,3,a)].
% 0.49/0.80  114 -sum(additive_identity,multiply(a,additive_identity),additive_identity) # answer(prove_a_times_additive_id_is_additive_id).  [ur(6,a,1,a,b,11,a,d,16,a)].
% 0.49/0.80  141 -sum(A,multiply(a,additive_identity),A) # answer(prove_a_times_additive_id_is_additive_id).  [ur(6,a,2,a,c,2,a,d,114,a)].
% 0.49/0.80  142 $F # answer(prove_a_times_additive_id_is_additive_id).  [resolve(141,a,60,a)].
% 0.49/0.80  
% 0.49/0.80  % SZS output end Refutation
% 0.49/0.80  ============================== end of proof ==========================
% 0.49/0.80  
% 0.49/0.80  ============================== STATISTICS ============================
% 0.49/0.80  
% 0.49/0.80  Given=20. Generated=554. Kept=141. proofs=1.
% 0.49/0.80  Usable=20. Sos=102. Demods=0. Limbo=17, Disabled=9. Hints=0.
% 0.49/0.80  Megabytes=0.13.
% 0.49/0.80  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/0.80  
% 0.49/0.80  ============================== end of statistics =====================
% 0.49/0.80  
% 0.49/0.80  ============================== end of search =========================
% 0.49/0.80  
% 0.49/0.80  THEOREM PROVED
% 0.49/0.80  % SZS status Unsatisfiable
% 0.49/0.80  
% 0.49/0.80  Exiting with 1 proof.
% 0.49/0.80  
% 0.49/0.80  Process 25533 exit (max_proofs) Mon May 30 10:00:58 2022
% 0.49/0.80  Prover9 interrupted
%------------------------------------------------------------------------------