TSTP Solution File: CAT011-4 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : CAT011-4 : 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 : Fri Jul 15 00:06:16 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : CAT011-4 : TPTP v8.1.0. Released v1.0.0.
% 0.05/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 : Sun May 29 17:12:26 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.49/0.81  ============================== Prover9 ===============================
% 0.49/0.81  Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.81  Process 2093 was started by sandbox2 on n032.cluster.edu,
% 0.49/0.81  Sun May 29 17:12:27 2022
% 0.49/0.81  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1939_n032.cluster.edu".
% 0.49/0.81  ============================== end of head ===========================
% 0.49/0.81  
% 0.49/0.81  ============================== INPUT =================================
% 0.49/0.81  
% 0.49/0.81  % Reading from file /tmp/Prover9_1939_n032.cluster.edu
% 0.49/0.81  
% 0.49/0.81  set(prolog_style_variables).
% 0.49/0.81  set(auto2).
% 0.49/0.81      % set(auto2) -> set(auto).
% 0.49/0.81      % set(auto) -> set(auto_inference).
% 0.49/0.81      % set(auto) -> set(auto_setup).
% 0.49/0.81      % set(auto_setup) -> set(predicate_elim).
% 0.49/0.81      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.81      % set(auto) -> set(auto_limits).
% 0.49/0.81      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.81      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.81      % set(auto) -> set(auto_denials).
% 0.49/0.81      % set(auto) -> set(auto_process).
% 0.49/0.81      % set(auto2) -> assign(new_constants, 1).
% 0.49/0.81      % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.81      % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.81      % set(auto2) -> assign(max_hours, 1).
% 0.49/0.81      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.81      % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.81      % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.81      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.81      % set(auto2) -> set(sort_initial_sos).
% 0.49/0.81      % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.81      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.81      % set(auto2) -> assign(max_megs, 400).
% 0.49/0.81      % set(auto2) -> assign(stats, some).
% 0.49/0.81      % set(auto2) -> clear(echo_input).
% 0.49/0.81      % set(auto2) -> set(quiet).
% 0.49/0.81      % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.81      % set(auto2) -> clear(print_given).
% 0.49/0.81  assign(lrs_ticks,-1).
% 0.49/0.81  assign(sos_limit,10000).
% 0.49/0.81  assign(order,kbo).
% 0.49/0.81  set(lex_order_vars).
% 0.49/0.81  clear(print_given).
% 0.49/0.81  
% 0.49/0.81  % formulas(sos).  % not echoed (13 formulas)
% 0.49/0.81  
% 0.49/0.81  ============================== end of input ==========================
% 0.49/0.81  
% 0.49/0.81  % From the command line: assign(max_seconds, 300).
% 0.49/0.81  
% 0.49/0.81  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.81  
% 0.49/0.81  % Formulas that are not ordinary clauses:
% 0.49/0.81  
% 0.49/0.81  ============================== end of process non-clausal formulas ===
% 0.49/0.81  
% 0.49/0.81  ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.81  
% 0.49/0.81  ============================== PREDICATE ELIMINATION =================
% 0.49/0.81  1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom).  [assumption].
% 0.49/0.81  2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom).  [assumption].
% 0.49/0.81  3 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom).  [assumption].
% 0.49/0.81  
% 0.49/0.81  ============================== end predicate elimination =============
% 0.49/0.81  
% 0.49/0.81  Auto_denials:
% 0.49/0.81    % copying label prove_domain_is_idempotent to answer in negative clause
% 0.49/0.81  
% 0.49/0.81  Term ordering decisions:
% 0.49/0.81  Function symbol KB weights:  a=1. compose=1. domain=1. codomain=1.
% 0.49/0.81  
% 0.49/0.81  ============================== end of process initial clauses ========
% 0.49/0.81  
% 0.49/0.81  ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.81  
% 0.49/0.81  ============================== end of clauses for search =============
% 0.49/0.81  
% 0.49/0.81  ============================== SEARCH ================================
% 0.49/0.81  
% 0.49/0.81  % Starting search at 0.01 seconds.
% 0.49/0.81  
% 0.49/0.81  ============================== PROOF =================================
% 0.49/0.81  % SZS status Unsatisfiable
% 0.49/0.81  % SZS output start Refutation
% 0.49/0.81  
% 0.49/0.81  % Proof 1 at 0.01 (+ 0.00) seconds: prove_domain_is_idempotent.
% 0.49/0.81  % Length of proof is 15.
% 0.49/0.81  % Level of proof is 5.
% 0.49/0.81  % Maximum clause weight is 9.000.
% 0.49/0.81  % Given clauses 37.
% 0.49/0.81  
% 0.49/0.81  4 there_exists(domain(a)) # label(assume_domain_exists) # label(hypothesis).  [assumption].
% 0.49/0.81  5 compose(A,domain(A)) = A # label(compose_domain) # label(axiom).  [assumption].
% 0.49/0.81  6 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom).  [assumption].
% 0.49/0.81  9 domain(domain(a)) != domain(a) # label(prove_domain_is_idempotent) # label(negated_conjecture) # answer(prove_domain_is_idempotent).  [assumption].
% 0.49/0.81  10 -there_exists(domain(A)) | there_exists(A) # label(domain_has_elements) # label(axiom).  [assumption].
% 0.49/0.81  13 -there_exists(compose(A,B)) | domain(A) = codomain(B) # label(domain_codomain_composition1) # label(axiom).  [assumption].
% 0.49/0.81  14 -there_exists(compose(A,B)) | codomain(B) = domain(A).  [copy(13),flip(b)].
% 0.49/0.81  17 domain(domain(a)) = c_0.  [new_symbol(9)].
% 0.49/0.81  18 domain(a) != c_0 # answer(prove_domain_is_idempotent).  [back_rewrite(9),rewrite([17(3)]),flip(a)].
% 0.49/0.81  22 there_exists(a).  [hyper(10,a,4,a)].
% 0.49/0.81  26 -there_exists(A) | codomain(domain(A)) = domain(A).  [para(5(a,1),14(a,1))].
% 0.49/0.81  27 -there_exists(A) | domain(codomain(A)) = codomain(A).  [para(6(a,1),14(a,1)),flip(b)].
% 0.49/0.81  90 codomain(domain(a)) = domain(a).  [hyper(26,a,22,a)].
% 0.49/0.81  112 domain(a) = c_0.  [hyper(27,a,4,a),rewrite([90(3),17(3),90(4)]),flip(a)].
% 0.49/0.81  113 $F # answer(prove_domain_is_idempotent).  [resolve(112,a,18,a)].
% 0.49/0.81  
% 0.49/0.81  % SZS output end Refutation
% 0.49/0.81  ============================== end of proof ==========================
% 0.49/0.81  
% 0.49/0.81  ============================== STATISTICS ============================
% 0.49/0.81  
% 0.49/0.81  Given=37. Generated=224. Kept=106. proofs=1.
% 0.49/0.81  Usable=30. Sos=36. Demods=40. Limbo=10, Disabled=42. Hints=0.
% 0.49/0.81  Megabytes=0.10.
% 0.49/0.81  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/0.81  
% 0.49/0.81  ============================== end of statistics =====================
% 0.49/0.81  
% 0.49/0.81  ============================== end of search =========================
% 0.49/0.81  
% 0.49/0.81  THEOREM PROVED
% 0.49/0.81  % SZS status Unsatisfiable
% 0.49/0.81  
% 0.49/0.81  Exiting with 1 proof.
% 0.49/0.81  
% 0.49/0.81  Process 2093 exit (max_proofs) Sun May 29 17:12:27 2022
% 0.49/0.81  Prover9 interrupted
%------------------------------------------------------------------------------