TSTP Solution File: RNG020-7 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : RNG020-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n027.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:12 EDT 2022

% Result   : Unsatisfiable 0.68s 1.00s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : RNG020-7 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n027.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 07:51:16 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.68/1.00  ============================== Prover9 ===============================
% 0.68/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.68/1.00  Process 7544 was started by sandbox on n027.cluster.edu,
% 0.68/1.00  Mon May 30 07:51:16 2022
% 0.68/1.00  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7391_n027.cluster.edu".
% 0.68/1.00  ============================== end of head ===========================
% 0.68/1.00  
% 0.68/1.00  ============================== INPUT =================================
% 0.68/1.00  
% 0.68/1.00  % Reading from file /tmp/Prover9_7391_n027.cluster.edu
% 0.68/1.00  
% 0.68/1.00  set(prolog_style_variables).
% 0.68/1.00  set(auto2).
% 0.68/1.00      % set(auto2) -> set(auto).
% 0.68/1.00      % set(auto) -> set(auto_inference).
% 0.68/1.00      % set(auto) -> set(auto_setup).
% 0.68/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.68/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/1.00      % set(auto) -> set(auto_limits).
% 0.68/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/1.00      % set(auto) -> set(auto_denials).
% 0.68/1.00      % set(auto) -> set(auto_process).
% 0.68/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.68/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.68/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.68/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.68/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.68/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.68/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.68/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.68/1.00      % set(auto2) -> assign(stats, some).
% 0.68/1.00      % set(auto2) -> clear(echo_input).
% 0.68/1.00      % set(auto2) -> set(quiet).
% 0.68/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.68/1.00      % set(auto2) -> clear(print_given).
% 0.68/1.00  assign(lrs_ticks,-1).
% 0.68/1.00  assign(sos_limit,10000).
% 0.68/1.00  assign(order,kbo).
% 0.68/1.00  set(lex_order_vars).
% 0.68/1.00  clear(print_given).
% 0.68/1.00  
% 0.68/1.00  % formulas(sos).  % not echoed (23 formulas)
% 0.68/1.00  
% 0.68/1.00  ============================== end of input ==========================
% 0.68/1.00  
% 0.68/1.00  % From the command line: assign(max_seconds, 300).
% 0.68/1.00  
% 0.68/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/1.00  
% 0.68/1.00  % Formulas that are not ordinary clauses:
% 0.68/1.00  
% 0.68/1.00  ============================== end of process non-clausal formulas ===
% 0.68/1.00  
% 0.68/1.00  ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/1.00  
% 0.68/1.00  ============================== PREDICATE ELIMINATION =================
% 0.68/1.00  
% 0.68/1.00  ============================== end predicate elimination =============
% 0.68/1.00  
% 0.68/1.00  Auto_denials:
% 0.68/1.00    % copying label prove_linearised_form2 to answer in negative clause
% 0.68/1.00  
% 0.68/1.00  Term ordering decisions:
% 0.68/1.00  
% 0.68/1.00  % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (11).
% 0.68/1.00  Function symbol KB weights:  additive_identity=1. u=1. v=1. x=1. y=1. multiply=1. add=1. commutator=1. associator=1. additive_inverse=0.
% 0.68/1.00  
% 0.68/1.00  ============================== end of process initial clauses ========
% 0.68/1.00  
% 0.68/1.00  ============================== CLAUSES FOR SEARCH ====================
% 0.68/1.00  
% 0.68/1.00  ============================== end of clauses for search =============
% 0.68/1.00  
% 0.68/1.00  ============================== SEARCH ================================
% 0.68/1.00  
% 0.68/1.00  % Starting search at 0.01 seconds.
% 0.68/1.00  
% 0.68/1.00  ============================== PROOF =================================
% 0.68/1.00  % SZS status Unsatisfiable
% 0.68/1.00  % SZS output start Refutation
% 0.68/1.00  
% 0.68/1.00  % Proof 1 at 0.02 (+ 0.00) seconds: prove_linearised_form2.
% 0.68/1.00  % Length of proof is 16.
% 0.68/1.00  % Level of proof is 5.
% 0.68/1.00  % Maximum clause weight is 38.000.
% 0.68/1.00  % Given clauses 17.
% 0.68/1.00  
% 0.68/1.00  8 add(A,B) = add(B,A) # label(commutativity_for_addition) # label(axiom).  [assumption].
% 0.68/1.00  10 multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)) # label(inverse_product1) # label(axiom).  [assumption].
% 0.68/1.00  11 additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).  [copy(10),flip(a)].
% 0.68/1.00  12 multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)) # label(inverse_product2) # label(axiom).  [assumption].
% 0.68/1.00  13 multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).  [copy(12),rewrite([11(4)]),flip(a)].
% 0.68/1.00  14 add(A,add(B,C)) = add(add(A,B),C) # label(associativity_for_addition) # label(axiom).  [assumption].
% 0.68/1.00  15 add(A,add(B,C)) = add(C,add(A,B)).  [copy(14),rewrite([8(4)])].
% 0.68/1.00  20 multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)) # label(distribute1) # label(axiom).  [assumption].
% 0.68/1.00  21 add(multiply(A,B),multiply(A,C)) = multiply(A,add(B,C)).  [copy(20),flip(a)].
% 0.68/1.00  22 multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)) # label(distribute2) # label(axiom).  [assumption].
% 0.68/1.00  23 add(multiply(A,B),multiply(C,B)) = multiply(add(A,C),B).  [copy(22),flip(a)].
% 0.68/1.00  30 associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) # label(associator) # label(axiom).  [assumption].
% 0.68/1.00  31 associator(A,B,C) = add(multiply(A,multiply(B,additive_inverse(C))),multiply(multiply(A,B),C)).  [copy(30),rewrite([11(6),13(6),11(5),13(5),8(7)])].
% 0.68/1.00  32 associator(x,add(u,v),y) != add(associator(x,u,y),associator(x,v,y)) # label(prove_linearised_form2) # label(negated_conjecture) # answer(prove_linearised_form2).  [assumption].
% 0.68/1.00  33 add(multiply(x,multiply(u,additive_inverse(y))),add(multiply(x,multiply(v,additive_inverse(y))),multiply(multiply(x,add(u,v)),y))) != add(multiply(x,multiply(add(u,v),additive_inverse(y))),multiply(multiply(x,add(u,v)),y)) # answer(prove_linearised_form2).  [copy(32),rewrite([31(6),31(20),31(32),15(41),8(40),15(40,R),8(39),15(41,R),8(40),15(40),8(39),15(40,R),8(39),23(39),21(35)]),flip(a)].
% 0.68/1.00  65 $F # answer(prove_linearised_form2).  [para(15(a,1),33(a,1)),rewrite([21(20),23(17),8(16)]),xx(a)].
% 0.68/1.00  
% 0.68/1.00  % SZS output end Refutation
% 0.68/1.00  ============================== end of proof ==========================
% 0.68/1.00  
% 0.68/1.00  ============================== STATISTICS ============================
% 0.68/1.00  
% 0.68/1.00  Given=17. Generated=265. Kept=52. proofs=1.
% 0.68/1.00  Usable=17. Sos=29. Demods=43. Limbo=0, Disabled=29. Hints=0.
% 0.68/1.00  Megabytes=0.09.
% 0.68/1.00  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/1.00  
% 0.68/1.00  ============================== end of statistics =====================
% 0.68/1.00  
% 0.68/1.00  ============================== end of search =========================
% 0.68/1.00  
% 0.68/1.00  THEOREM PROVED
% 0.68/1.00  % SZS status Unsatisfiable
% 0.68/1.00  
% 0.68/1.00  Exiting with 1 proof.
% 0.68/1.00  
% 0.68/1.00  Process 7544 exit (max_proofs) Mon May 30 07:51:16 2022
% 0.68/1.00  Prover9 interrupted
%------------------------------------------------------------------------------