TSTP Solution File: ITP001+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : ITP001+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n021.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 : Sun Jul 17 00:21:10 EDT 2022

% Result   : Theorem 0.49s 1.03s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : ITP001+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.07/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun  2 21:51:17 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.49/1.03  ============================== Prover9 ===============================
% 0.49/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.03  Process 8819 was started by sandbox2 on n021.cluster.edu,
% 0.49/1.03  Thu Jun  2 21:51:17 2022
% 0.49/1.03  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8662_n021.cluster.edu".
% 0.49/1.03  ============================== end of head ===========================
% 0.49/1.03  
% 0.49/1.03  ============================== INPUT =================================
% 0.49/1.03  
% 0.49/1.03  % Reading from file /tmp/Prover9_8662_n021.cluster.edu
% 0.49/1.03  
% 0.49/1.03  set(prolog_style_variables).
% 0.49/1.03  set(auto2).
% 0.49/1.03      % set(auto2) -> set(auto).
% 0.49/1.03      % set(auto) -> set(auto_inference).
% 0.49/1.03      % set(auto) -> set(auto_setup).
% 0.49/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.49/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.03      % set(auto) -> set(auto_limits).
% 0.49/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.03      % set(auto) -> set(auto_denials).
% 0.49/1.03      % set(auto) -> set(auto_process).
% 0.49/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.49/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.49/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.49/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.49/1.03      % set(auto2) -> assign(stats, some).
% 0.49/1.03      % set(auto2) -> clear(echo_input).
% 0.49/1.03      % set(auto2) -> set(quiet).
% 0.49/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.03      % set(auto2) -> clear(print_given).
% 0.49/1.03  assign(lrs_ticks,-1).
% 0.49/1.03  assign(sos_limit,10000).
% 0.49/1.03  assign(order,kbo).
% 0.49/1.03  set(lex_order_vars).
% 0.49/1.03  clear(print_given).
% 0.49/1.03  
% 0.49/1.03  % formulas(sos).  % not echoed (24 formulas)
% 0.49/1.03  
% 0.49/1.03  ============================== end of input ==========================
% 0.49/1.03  
% 0.49/1.03  % From the command line: assign(max_seconds, 300).
% 0.49/1.03  
% 0.49/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.03  
% 0.49/1.03  % Formulas that are not ordinary clauses:
% 0.49/1.03  1 (all A_27a all A_27b all V0f_2E0 all V1g_2E0 ((all V2x_2E0 s(A_27b,app_2E2(s(tyop_2Emin_2Efun(A_27a,A_27b),V0f_2E0),s(A_27a,V2x_2E0))) = s(A_27b,app_2E2(s(tyop_2Emin_2Efun(A_27a,A_27b),V1g_2E0),s(A_27a,V2x_2E0)))) -> s(tyop_2Emin_2Efun(A_27a,A_27b),V0f_2E0) = s(tyop_2Emin_2Efun(A_27a,A_27b),V1g_2E0))) # label(reserved_2Eho_2Eeq__ext) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  2 (all V0_2E0 all V1_2E0 ((p(s(tyop_2Emin_2Ebool,V0_2E0)) <-> p(s(tyop_2Emin_2Ebool,V1_2E0))) -> s(tyop_2Emin_2Ebool,V0_2E0) = s(tyop_2Emin_2Ebool,V1_2E0))) # label(reserved_2Eho_2Eboolext) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  3 (all V0t_2E0 (s(tyop_2Emin_2Ebool,V0t_2E0) = s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0) | s(tyop_2Emin_2Ebool,V0t_2E0) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0))) # label(reserved_2Eho_2Ebool__cases__ax) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  4 (all A_27a all V0x_2E0 s(A_27a,app_2E2(s(tyop_2Emin_2Efun(A_27a,A_27a),combin_i_2E0),s(A_27a,V0x_2E0))) = s(A_27a,V0x_2E0)) # label(reserved_2Eho_2Ei__thm) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  5 (all A_27a all A_27b all V0x_2E0 all V1y_2E0 s(A_27a,app_2E2(s(tyop_2Emin_2Efun(A_27b,A_27a),app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Efun(A_27b,A_27a)),combin_k_2E0),s(A_27a,V0x_2E0))),s(A_27b,V1y_2E0))) = s(A_27a,V0x_2E0)) # label(reserved_2Eho_2Ek__thm) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  6 (all A_27a all A_27b all A_27c all V0f_2E0 all V1g_2E0 all V2x_2E0 s(A_27c,app_2E2(s(tyop_2Emin_2Efun(A_27a,A_27c),app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Efun(A_27a,A_27b),tyop_2Emin_2Efun(A_27a,A_27c)),app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Efun(A_27b,A_27c)),tyop_2Emin_2Efun(tyop_2Emin_2Efun(A_27a,A_27b),tyop_2Emin_2Efun(A_27a,A_27c))),combin_s_2E0),s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Efun(A_27b,A_27c)),V0f_2E0))),s(tyop_2Emin_2Efun(A_27a,A_27b),V1g_2E0))),s(A_27a,V2x_2E0))) = s(A_27c,app_2E2(s(tyop_2Emin_2Efun(A_27b,A_27c),app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Efun(A_27b,A_27c)),V0f_2E0),s(A_27a,V2x_2E0))),s(A_27b,app_2E2(s(tyop_2Emin_2Efun(A_27a,A_27b),V1g_2E0),s(A_27a,V2x_2E0)))))) # label(reserved_2Eho_2Es__thm) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  7 (all V0_2E0 all V1_2E0 (p(s(tyop_2Emin_2Ebool,c_2Ebool_2E_2F_5C_2E2(s(tyop_2Emin_2Ebool,V0_2E0),s(tyop_2Emin_2Ebool,V1_2E0)))) <-> p(s(tyop_2Emin_2Ebool,V0_2E0)) & p(s(tyop_2Emin_2Ebool,V1_2E0)))) # label(reserved_2Elogic_2E_2F_5C) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  8 (all V0_2E0 all V1_2E0 (p(s(tyop_2Emin_2Ebool,c_2Ebool_2E_5C_2F_2E2(s(tyop_2Emin_2Ebool,V0_2E0),s(tyop_2Emin_2Ebool,V1_2E0)))) <-> p(s(tyop_2Emin_2Ebool,V0_2E0)) | p(s(tyop_2Emin_2Ebool,V1_2E0)))) # label(reserved_2Elogic_2E_5C_2F) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  9 (all V0_2E0 (p(s(tyop_2Emin_2Ebool,c_2Ebool_2E_7E_2E1(s(tyop_2Emin_2Ebool,V0_2E0)))) <-> -p(s(tyop_2Emin_2Ebool,V0_2E0)))) # label(reserved_2Elogic_2E_7E) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  10 (all V0_2E0 all V1_2E0 (p(s(tyop_2Emin_2Ebool,c_2Emin_2E_3D_3D_3E_2E2(s(tyop_2Emin_2Ebool,V0_2E0),s(tyop_2Emin_2Ebool,V1_2E0)))) <-> (p(s(tyop_2Emin_2Ebool,V0_2E0)) -> p(s(tyop_2Emin_2Ebool,V1_2E0))))) # label(reserved_2Elogic_2E_3D_3D_3E) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  11 (all A_27a all V0_2E0 all V1_2E0 (p(s(tyop_2Emin_2Ebool,c_2Emin_2E_3D_2E2(s(A_27a,V0_2E0),s(A_27a,V1_2E0)))) <-> s(A_27a,V0_2E0) = s(A_27a,V1_2E0))) # label(reserved_2Elogic_2E_3D) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  12 (all A_27a all V0f_2E0 (p(s(tyop_2Emin_2Ebool,c_2Ebool_2E_21_2E1(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0f_2E0)))) <-> (all V1x_2E0 p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0f_2E0),s(A_27a,V1x_2E0))))))) # label(reserved_2Equant_2E_21) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  13 (all A_27a all V0f_2E0 (p(s(tyop_2Emin_2Ebool,c_2Ebool_2E_3F_2E1(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0f_2E0)))) <-> (exists V1x_2E0 p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0f_2E0),s(A_27a,V1x_2E0))))))) # label(reserved_2Equant_2E_3F) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  14 (all X0_2E0 all X1_2E0 (p(s(tyop_2Emin_2Ebool,X0_2E0)) & p(s(tyop_2Emin_2Ebool,X1_2E0)) <-> p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool),app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool)),c_2Ebool_2E_2F_5C_2E0),s(tyop_2Emin_2Ebool,X0_2E0))),s(tyop_2Emin_2Ebool,X1_2E0)))))) # label(arityeq2_2Ec_2Ebool_2E_2F_5C_2E2) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  15 (all X0_2E0 all X1_2E0 (p(s(tyop_2Emin_2Ebool,X0_2E0)) | p(s(tyop_2Emin_2Ebool,X1_2E0)) <-> p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool),app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool)),c_2Ebool_2E_5C_2F_2E0),s(tyop_2Emin_2Ebool,X0_2E0))),s(tyop_2Emin_2Ebool,X1_2E0)))))) # label(arityeq2_2Ec_2Ebool_2E_5C_2F_2E2) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  16 (all X0_2E0 (-p(s(tyop_2Emin_2Ebool,X0_2E0)) <-> p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool),c_2Ebool_2E_7E_2E0),s(tyop_2Emin_2Ebool,X0_2E0)))))) # label(arityeq1_2Ec_2Ebool_2E_7E_2E1) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  17 (all X0_2E0 all X1_2E0 ((p(s(tyop_2Emin_2Ebool,X0_2E0)) -> p(s(tyop_2Emin_2Ebool,X1_2E0))) <-> p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool),app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Efun(tyop_2Emin_2Ebool,tyop_2Emin_2Ebool)),c_2Emin_2E_3D_3D_3E_2E0),s(tyop_2Emin_2Ebool,X0_2E0))),s(tyop_2Emin_2Ebool,X1_2E0)))))) # label(arityeq2_2Ec_2Emin_2E_3D_3D_3E_2E2) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  18 (all A_27a all X0_2E0 all X1_2E0 (s(A_27a,X0_2E0) = s(A_27a,X1_2E0) <-> p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),app_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool)),c_2Emin_2E_3D_2E0),s(A_27a,X0_2E0))),s(A_27a,X1_2E0)))))) # label(arityeq2_2Ec_2Emin_2E_3D_2E2_2Emono_2EA_27a) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  19 (all A_27a all X0_2E0 s(tyop_2Emin_2Ebool,c_2Ebool_2E_21_2E1(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),X0_2E0))) = s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),tyop_2Emin_2Ebool),c_2Ebool_2E_21_2E0),s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),X0_2E0)))) # label(arityeq1_2Ec_2Ebool_2E_21_2E1_2Emono_2EA_27a) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  20 (all A_27a all X0_2E0 s(tyop_2Emin_2Ebool,c_2Ebool_2E_3F_2E1(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),X0_2E0))) = s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),tyop_2Emin_2Ebool),c_2Ebool_2E_3F_2E0),s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),X0_2E0)))) # label(arityeq1_2Ec_2Ebool_2E_3F_2E1_2Emono_2EA_27a) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  21 p(s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)) <-> (all V0x_2E0 s(tyop_2Emin_2Ebool,V0x_2E0) = s(tyop_2Emin_2Ebool,V0x_2E0)) # label(thm_2Ebool_2ET__DEF) # label(axiom) # label(non_clause).  [assumption].
% 0.49/1.03  
% 0.49/1.03  ============================== end of process non-clausal formulas ===
% 0.49/1.03  
% 0.49/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.03  
% 0.49/1.03  ============================== PREDICATE ELIMINATION =================
% 0.49/1.03  
% 0.49/1.03  ============================== end predicate elimination =============
% 0.49/1.03  
% 0.49/1.03  Auto_denials:  (non-Horn, no changes).
% 0.49/1.03  
% 0.49/1.03  Term ordering decisions:
% 0.49/1.03  Function symbol KB weights:  tyop_2Emin_2Ebool=1. c_2Ebool_2ET_2E0=1. c_2Ebool_2E_2F_5C_2E0=1. c_2Ebool_2E_5C_2F_2E0=1. c_2Emin_2E_3D_3D_3E_2E0=1. c_2Emin_2E_3D_2E0=1. c_2Ebool_2EF_2E0=1. c_2Ebool_2E_21_2E0=1. c_2Ebool_2E_3F_2E0=1. c_2Ebool_2E_7E_2E0=1. combin_i_2E0=1. combin_k_2E0=1. combin_s_2E0=1. c1=1. s=1. tyop_2Emin_2Efun=1. app_2E2=1. c_2Ebool_2E_2F_5C_2E2=1. c_2Ebool_2E_5C_2F_2E2=1. c_2Emin_2E_3D_3D_3E_2E2=1. c_2Emin_2E_3D_2E2=1. f2=1. f3=1. c_2Ebool_2E_21_2E1=1. c_2Ebool_2E_3F_2E1=1. c_2Ebool_2E_7E_2E1=1. f1=1.
% 0.49/1.03  
% 0.49/1.03  ============================== PROOF =================================
% 0.49/1.03  % SZS status Theorem
% 0.49/1.03  % SZS output start Refutation
% 0.49/1.03  
% 0.49/1.03  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.49/1.03  % Length of proof is 3.
% 0.49/1.03  % Level of proof is 1.
% 0.49/1.03  % Maximum clause weight is 4.000.
% 0.49/1.03  % Given clauses 0.
% 0.49/1.03  
% 0.49/1.03  22 p(s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)) # label(reserved_2Eho_2Etruth) # label(axiom).  [assumption].
% 0.49/1.03  39 -p(s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)) # label(thm_2Ebool_2ETRUTH) # label(negated_conjecture).  [assumption].
% 0.49/1.03  40 $F.  [copy(39),unit_del(a,22)].
% 0.49/1.03  
% 0.49/1.03  % SZS output end Refutation
% 0.49/1.03  ============================== end of proof ==========================
% 0.49/1.03  
% 0.49/1.03  ============================== STATISTICS ============================
% 0.49/1.03  
% 0.49/1.03  Given=0. Generated=14. Kept=13. proofs=1.
% 0.49/1.03  Usable=0. Sos=0. Demods=4. Limbo=13, Disabled=14. Hints=0.
% 0.49/1.03  Megabytes=0.11.
% 0.49/1.03  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.49/1.03  
% 0.49/1.03  ============================== end of statistics =====================
% 0.49/1.03  
% 0.49/1.03  ============================== end of search =========================
% 0.49/1.03  
% 0.49/1.03  THEOREM PROVED
% 0.49/1.03  % SZS status Theorem
% 0.49/1.03  
% 0.49/1.03  Exiting with 1 proof.
% 0.49/1.03  
% 0.49/1.03  Process 8819 exit (max_proofs) Thu Jun  2 21:51:17 2022
% 0.49/1.03  Prover9 interrupted
%------------------------------------------------------------------------------