TSTP Solution File: ITP008+2 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n020.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:21 EDT 2022

% Result   : Timeout 300.07s 300.38s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP008+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.06/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun  2 22:19:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.71/1.01  ============================== Prover9 ===============================
% 0.71/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.01  Process 7502 was started by sandbox on n020.cluster.edu,
% 0.71/1.01  Thu Jun  2 22:19:23 2022
% 0.71/1.01  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7348_n020.cluster.edu".
% 0.71/1.01  ============================== end of head ===========================
% 0.71/1.01  
% 0.71/1.01  ============================== INPUT =================================
% 0.71/1.01  
% 0.71/1.01  % Reading from file /tmp/Prover9_7348_n020.cluster.edu
% 0.71/1.01  
% 0.71/1.01  set(prolog_style_variables).
% 0.71/1.01  set(auto2).
% 0.71/1.01      % set(auto2) -> set(auto).
% 0.71/1.01      % set(auto) -> set(auto_inference).
% 0.71/1.01      % set(auto) -> set(auto_setup).
% 0.71/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.71/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.01      % set(auto) -> set(auto_limits).
% 0.71/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.01      % set(auto) -> set(auto_denials).
% 0.71/1.01      % set(auto) -> set(auto_process).
% 0.71/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.71/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.71/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.71/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.71/1.01      % set(auto2) -> assign(stats, some).
% 0.71/1.01      % set(auto2) -> clear(echo_input).
% 0.71/1.01      % set(auto2) -> set(quiet).
% 0.71/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.01      % set(auto2) -> clear(print_given).
% 0.71/1.01  assign(lrs_ticks,-1).
% 0.71/1.01  assign(sos_limit,10000).
% 0.71/1.01  assign(order,kbo).
% 0.71/1.01  set(lex_order_vars).
% 0.71/1.01  clear(print_given).
% 0.71/1.01  
% 0.71/1.01  % formulas(sos).  % not echoed (26 formulas)
% 0.71/1.01  
% 0.71/1.01  ============================== end of input ==========================
% 0.71/1.01  
% 0.71/1.01  % From the command line: assign(max_seconds, 300).
% 0.71/1.01  
% 0.71/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.01  
% 0.71/1.01  % Formulas that are not ordinary clauses:
% 0.71/1.01  1 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  2 (all A all B all F (mem(F,arr(A,B)) -> (all X (mem(X,A) -> mem(ap(F,X),B))))) # label(ap_tp) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  3 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(Q) <-> p(R)) -> Q = R))))) # label(boolext) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  4 (all A all B all F (mem(F,arr(A,B)) -> (all G (mem(G,arr(A,B)) -> ((all X (mem(X,A) -> ap(F,X) = ap(G,X))) -> F = G))))) # label(funcext) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  5 (all A all Y all X (mem(X,A) -> ap(k(A,Y),X) = Y)) # label(kbeta) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  6 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  7 (all A0 (ne(A0) -> (all A1 (ne(A1) -> ne(ty_2Epair_2Eprod(A0,A1)))))) # label(ne_ty_2Epair_2Eprod) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  8 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Epair_2E_2C(A_27a,A_27b),arr(A_27a,arr(A_27b,ty_2Epair_2Eprod(A_27a,A_27b)))))))) # label(mem_c_2Epair_2E_2C) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  9 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all A_27c (ne(A_27c) -> mem(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),arr(arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c),arr(A_27a,arr(A_27b,A_27c)))))))))) # label(mem_c_2Epair_2ECURRY) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  10 (all A_27a (ne(A_27a) -> mem(c_2Erelation_2EWF(A_27a),arr(arr(A_27a,arr(A_27a,bool)),bool)))) # label(mem_c_2Erelation_2EWF) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  11 (all A_27a (ne(A_27a) -> mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))))) # label(mem_c_2Emin_2E_3D) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.01  12 (all A (ne(A) -> (all X (mem(X,A) -> (all Y (mem(Y,A) -> (p(ap(ap(c_2Emin_2E_3D(A),X),Y)) <-> X = Y))))))) # label(ax_eq_p) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  13 (all A0 (ne(A0) -> ne(ty_2Ewellorder_2Ewellorder(A0)))) # label(ne_ty_2Ewellorder_2Ewellorder) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  14 (all A_27a (ne(A_27a) -> mem(c_2Ewellorder_2Ewellorder__REP(A_27a),arr(ty_2Ewellorder_2Ewellorder(A_27a),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))))) # label(mem_c_2Ewellorder_2Ewellorder__REP) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  15 (all A_27a (ne(A_27a) -> mem(c_2Eset__relation_2Estrict(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))))) # label(mem_c_2Eset__relation_2Estrict) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  16 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2EIN(A_27a),arr(A_27a,arr(arr(A_27a,bool),bool))))) # label(mem_c_2Ebool_2EIN) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  17 (all A_27a (ne(A_27a) -> mem(c_2Ewellorder_2Ewellfounded(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),bool)))) # label(mem_c_2Ewellorder_2Ewellfounded) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  18 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)))) # label(mem_c_2Ebool_2E_21) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  19 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> (p(ap(c_2Ebool_2E_21(A),Q)) <-> (all X (mem(X,A) -> p(ap(Q,X))))))))) # label(ax_all_p) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  20 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0t (mem(V0t,arr(A_27a,A_27b)) -> f31(A_27b,A_27a,V0t) = V0t)))))) # label(ax_thm_2Ebool_2EETA__AX) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  21 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all A_27c (ne(A_27c) -> (all V0f (mem(V0f,arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c)) -> (all V1x (mem(V1x,A_27a) -> (all V2y (mem(V2y,A_27b) -> ap(ap(ap(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),V0f),V1x),V2y) = ap(V0f,ap(ap(c_2Epair_2E_2C(A_27a,A_27b),V1x),V2y)))))))))))))) # label(ax_thm_2Epair_2ECURRY__DEF) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  22 (all A_27a (ne(A_27a) -> (all V0R (mem(V0R,arr(ty_2Epair_2Eprod(A_27a,A_27a),bool)) -> (p(ap(c_2Ewellorder_2Ewellfounded(A_27a),V0R)) <-> p(ap(c_2Erelation_2EWF(A_27a),ap(c_2Epair_2ECURRY(A_27a,A_27a,bool),V0R)))))))) # label(conj_thm_2Ewellorder_2Ewellfounded__WF) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  23 (all A_27a (ne(A_27a) -> (all V0w (mem(V0w,ty_2Ewellorder_2Ewellorder(A_27a)) -> p(ap(c_2Ewellorder_2Ewellfounded(A_27a),f1018(A_27a,V0w))))))) # label(conj_thm_2Ewellorder_2EWIN__WF) # label(axiom) # label(non_clause).  [assumption].
% 18.45/18.76  24 -(all A_27a (ne(A_27a) -> (all V0w (mem(V0w,ty_2Ewellorder_2Ewellorder(A_27a)) -> p(ap(c_2Erelation_2EWF(A_27a),f1020(A_27a,V0w))))))) # label(conj_thm_2Ewellorder_2EWIN__WF2) # label(negated_conjecture) # label(non_clause).  [assumption].
% 18.45/18.76  
% 18.45/18.76  ============================== end of process non-clausal formulas ===
% 18.45/18.76  
% 18.45/18.76  ============================== PROCESS INITIAL CLAUSES ===============
% 18.45/18.76  
% 18.45/18.76  ============================== PREDICATE ELIMINATION =================
% 18.45/18.76  
% 18.45/18.76  ============================== end predicate elimination =============
% 18.45/18.76  
% 18.45/18.76  Auto_denials:  (non-Horn, no changes).
% 18.45/18.76  
% 18.45/18.76  Term ordering decisions:
% 18.45/18.76  Function symbol KB weights:  bool=1. ind=1. c1=1. c2=1. arr=1. ap=1. ty_2Epair_2Eprod=1. c_2Epair_2E_2C=1. f1018=1. k=1. f1020=1. f2=1. c_2Ebool_2E_21=1. c_2Ewellorder_2Ewellfounded=1. ty_2Ewellorder_2Ewellorder=1. c_2Emin_2E_3D=1. c_2Erelation_2EWF=1. c_2Ebool_2EIN=1. c_2Eset__relation_2Estrict=1. c_2Ewellorder_2Ewellorder__REP=1. i=1. c_2Epair_2ECURRY=1. f31=1. f1=1.
% 18.45/18.76  
% 18.45/18.76  ============================== end of process initial clauses ========
% 18.45/18.76  
% 18.45/18.76  ============================== CLAUSES FOR SEARCH ====================
% 18.45/18.76  
% 18.45/18.76  ============================== end of clauses for search =============
% 18.45/18.76  
% 18.45/18.76  ============================== SEARCH ================================
% 18.45/18.76  
% 18.45/18.76  % Starting search at 0.02 seconds.
% 18.45/18.76  
% 18.45/18.76  Low Water (keep): wt=96.000, iters=3402
% 18.45/18.76  
% 18.45/18.76  Low Water (keep): wt=84.000, iters=3385
% 18.45/18.76  
% 18.45/18.76  Low Water (keep): wt=78.000, iters=3375
% 18.45/18.76  
% 18.45/18.76  Low Water (keep): wt=64.000, iters=3348
% 18.45/18.76  
% 18.45/18.76  Low Water (keep): wt=52.000, iters=3335
% 18.45/18.76  
% 18.45/18.76  Low WatCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------