TSTP Solution File: FLD031-5 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : FLD031-5 : TPTP v8.1.0. Bugfixed v2.1.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 : Sat Jul 16 02:24:16 EDT 2022

% Result   : Unsatisfiable 0.81s 1.14s
% Output   : Refutation 0.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : FLD031-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jun  6 13:21:13 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.81/1.14  ============================== Prover9 ===============================
% 0.81/1.14  Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.14  Process 17242 was started by sandbox on n028.cluster.edu,
% 0.81/1.14  Mon Jun  6 13:21:14 2022
% 0.81/1.14  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16792_n028.cluster.edu".
% 0.81/1.14  ============================== end of head ===========================
% 0.81/1.14  
% 0.81/1.14  ============================== INPUT =================================
% 0.81/1.14  
% 0.81/1.14  % Reading from file /tmp/Prover9_16792_n028.cluster.edu
% 0.81/1.14  
% 0.81/1.14  set(prolog_style_variables).
% 0.81/1.14  set(auto2).
% 0.81/1.14      % set(auto2) -> set(auto).
% 0.81/1.14      % set(auto) -> set(auto_inference).
% 0.81/1.14      % set(auto) -> set(auto_setup).
% 0.81/1.14      % set(auto_setup) -> set(predicate_elim).
% 0.81/1.14      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.14      % set(auto) -> set(auto_limits).
% 0.81/1.14      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.14      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.14      % set(auto) -> set(auto_denials).
% 0.81/1.14      % set(auto) -> set(auto_process).
% 0.81/1.14      % set(auto2) -> assign(new_constants, 1).
% 0.81/1.14      % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.14      % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.14      % set(auto2) -> assign(max_hours, 1).
% 0.81/1.14      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.14      % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.14      % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.14      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.14      % set(auto2) -> set(sort_initial_sos).
% 0.81/1.14      % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.14      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.14      % set(auto2) -> assign(max_megs, 400).
% 0.81/1.14      % set(auto2) -> assign(stats, some).
% 0.81/1.14      % set(auto2) -> clear(echo_input).
% 0.81/1.14      % set(auto2) -> set(quiet).
% 0.81/1.14      % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.14      % set(auto2) -> clear(print_given).
% 0.81/1.14  assign(lrs_ticks,-1).
% 0.81/1.14  assign(sos_limit,10000).
% 0.81/1.14  assign(order,kbo).
% 0.81/1.14  set(lex_order_vars).
% 0.81/1.14  clear(print_given).
% 0.81/1.14  
% 0.81/1.14  % formulas(sos).  % not echoed (30 formulas)
% 0.81/1.14  
% 0.81/1.14  ============================== end of input ==========================
% 0.81/1.14  
% 0.81/1.14  % From the command line: assign(max_seconds, 300).
% 0.81/1.14  
% 0.81/1.14  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.14  
% 0.81/1.14  % Formulas that are not ordinary clauses:
% 0.81/1.14  
% 0.81/1.14  ============================== end of process non-clausal formulas ===
% 0.81/1.14  
% 0.81/1.14  ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.14  
% 0.81/1.14  ============================== PREDICATE ELIMINATION =================
% 0.81/1.14  
% 0.81/1.14  ============================== end predicate elimination =============
% 0.81/1.14  
% 0.81/1.14  Auto_denials:  (non-Horn, no changes).
% 0.81/1.14  
% 0.81/1.14  Term ordering decisions:
% 0.81/1.14  Function symbol KB weights:  additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.81/1.14  
% 0.81/1.14  ============================== end of process initial clauses ========
% 0.81/1.14  
% 0.81/1.14  ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.14  
% 0.81/1.14  ============================== end of clauses for search =============
% 0.81/1.14  
% 0.81/1.14  ============================== SEARCH ================================
% 0.81/1.14  
% 0.81/1.14  % Starting search at 0.01 seconds.
% 0.81/1.14  
% 0.81/1.14  ============================== PROOF =================================
% 0.81/1.14  % SZS status Unsatisfiable
% 0.81/1.14  % SZS output start Refutation
% 0.81/1.14  
% 0.81/1.14  % Proof 1 at 0.17 (+ 0.01) seconds.
% 0.81/1.14  % Length of proof is 14.
% 0.81/1.14  % Level of proof is 3.
% 0.81/1.14  % Maximum clause weight is 16.000.
% 0.81/1.14  % Given clauses 243.
% 0.81/1.14  
% 0.81/1.14  3 defined(a) # label(a_is_defined) # label(hypothesis).  [assumption].
% 0.81/1.14  4 product(multiplicative_identity,a,multiplicative_identity) # label(product_2) # label(negated_conjecture).  [assumption].
% 0.81/1.14  6 -sum(additive_identity,a,additive_identity) # label(not_sum_3) # label(negated_conjecture).  [assumption].
% 0.81/1.14  7 -product(multiplicative_identity,multiplicative_identity,multiplicative_inverse(a)) # label(not_product_4) # label(negated_conjecture).  [assumption].
% 0.81/1.14  10 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom).  [assumption].
% 0.81/1.14  13 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom).  [assumption].
% 0.81/1.14  16 defined(multiplicative_inverse(A)) | -defined(A) | sum(additive_identity,A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom).  [assumption].
% 0.81/1.14  22 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom).  [assumption].
% 0.81/1.14  27 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom).  [assumption].
% 0.81/1.14  80 defined(multiplicative_inverse(a)).  [resolve(16,b,3,a),unit_del(b,6)].
% 0.81/1.14  100 product(multiplicative_inverse(a),a,multiplicative_identity).  [resolve(22,c,3,a),unit_del(b,6)].
% 0.81/1.14  215 product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(a)).  [resolve(80,a,10,b)].
% 0.81/1.14  1059 product(a,multiplicative_inverse(a),multiplicative_identity).  [resolve(100,a,13,b)].
% 0.81/1.14  3096 $F.  [ur(27,a,7,a,b,4,a,c,1059,a),unit_del(a,215)].
% 0.81/1.14  
% 0.81/1.14  % SZS output end Refutation
% 0.81/1.14  ============================== end of proof ==========================
% 0.81/1.14  
% 0.81/1.14  ============================== STATISTICS ============================
% 0.81/1.14  
% 0.81/1.14  Given=243. Generated=5034. Kept=3095. proofs=1.
% 0.81/1.14  Usable=241. Sos=2812. Demods=0. Limbo=25, Disabled=47. Hints=0.
% 0.81/1.14  Megabytes=1.81.
% 0.81/1.14  User_CPU=0.17, System_CPU=0.01, Wall_clock=0.
% 0.81/1.14  
% 0.81/1.14  ============================== end of statistics =====================
% 0.81/1.14  
% 0.81/1.14  ============================== end of search =========================
% 0.81/1.14  
% 0.81/1.14  THEOREM PROVED
% 0.81/1.14  % SZS status Unsatisfiable
% 0.81/1.14  
% 0.81/1.14  Exiting with 1 proof.
% 0.81/1.14  
% 0.81/1.14  Process 17242 exit (max_proofs) Mon Jun  6 13:21:14 2022
% 0.81/1.14  Prover9 interrupted
%------------------------------------------------------------------------------