TSTP Solution File: ITP001+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ITP001+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:11 EDT 2022
% Result : Theorem 0.76s 1.04s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ITP001+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 2 22:48:13 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.76/1.04 ============================== Prover9 ===============================
% 0.76/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.04 Process 15484 was started by sandbox2 on n017.cluster.edu,
% 0.76/1.04 Thu Jun 2 22:48:14 2022
% 0.76/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15331_n017.cluster.edu".
% 0.76/1.04 ============================== end of head ===========================
% 0.76/1.04
% 0.76/1.04 ============================== INPUT =================================
% 0.76/1.04
% 0.76/1.04 % Reading from file /tmp/Prover9_15331_n017.cluster.edu
% 0.76/1.04
% 0.76/1.04 set(prolog_style_variables).
% 0.76/1.04 set(auto2).
% 0.76/1.04 % set(auto2) -> set(auto).
% 0.76/1.04 % set(auto) -> set(auto_inference).
% 0.76/1.04 % set(auto) -> set(auto_setup).
% 0.76/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.04 % set(auto) -> set(auto_limits).
% 0.76/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.04 % set(auto) -> set(auto_denials).
% 0.76/1.04 % set(auto) -> set(auto_process).
% 0.76/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.04 % set(auto2) -> assign(stats, some).
% 0.76/1.04 % set(auto2) -> clear(echo_input).
% 0.76/1.04 % set(auto2) -> set(quiet).
% 0.76/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.04 % set(auto2) -> clear(print_given).
% 0.76/1.04 assign(lrs_ticks,-1).
% 0.76/1.04 assign(sos_limit,10000).
% 0.76/1.04 assign(order,kbo).
% 0.76/1.04 set(lex_order_vars).
% 0.76/1.04 clear(print_given).
% 0.76/1.04
% 0.76/1.04 % formulas(sos). % not echoed (14 formulas)
% 0.76/1.04
% 0.76/1.04 ============================== end of input ==========================
% 0.76/1.04
% 0.76/1.04 % From the command line: assign(max_seconds, 300).
% 0.76/1.04
% 0.76/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.04
% 0.76/1.04 % Formulas that are not ordinary clauses:
% 0.76/1.04 1 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 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.76/1.04 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.76/1.04 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.76/1.04 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.76/1.04 6 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 7 (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.76/1.04 8 (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].
% 0.76/1.04 9 $T <-> i(bool) = i(bool) # label(ax_thm_2Ebool_2ET__DEF) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 10 -$T # label(conj_thm_2Ebool_2ETRUTH) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.04
% 0.76/1.04 ============================== end of process non-clausal formulas ===
% 0.76/1.04
% 0.76/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.04
% 0.76/1.04 ============================== PREDICATE ELIMINATION =================
% 0.76/1.04
% 0.76/1.04 ============================== end predicate elimination =============
% 0.76/1.04
% 0.76/1.04 Auto_denials: (non-Horn, no changes).
% 0.76/1.04
% 0.76/1.04 Term ordering decisions:
% 0.76/1.04 Function symbol KB weights: bool=1. c_2Ebool_2ET=1. ind=1. ap=1. arr=1. k=1. c_2Emin_2E_3D=1. i=1. f1=1.
% 0.76/1.04
% 0.76/1.04 ============================== PROOF =================================
% 0.76/1.04 % SZS status Theorem
% 0.76/1.04 % SZS output start Refutation
% 0.76/1.04
% 0.76/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.04 % Length of proof is 2.
% 0.76/1.04 % Level of proof is 1.
% 0.76/1.04 % Maximum clause weight is 0.000.
% 0.76/1.04 % Given clauses 0.
% 0.76/1.04
% 0.76/1.04 10 -$T # label(conj_thm_2Ebool_2ETRUTH) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.04 11 $F # label(conj_thm_2Ebool_2ETRUTH) # label(negated_conjecture). [clausify(10)].
% 0.76/1.04
% 0.76/1.04 % SZS output end Refutation
% 0.76/1.04 ============================== end of proof ==========================
% 0.76/1.04
% 0.76/1.04 ============================== STATISTICS ============================
% 0.76/1.04
% 0.76/1.04 Given=0. Generated=1. Kept=0. proofs=1.
% 0.76/1.04 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=1. Hints=0.
% 0.76/1.04 Megabytes=0.03.
% 0.76/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.04
% 0.76/1.04 ============================== end of statistics =====================
% 0.76/1.04
% 0.76/1.04 ============================== end of search =========================
% 0.76/1.04
% 0.76/1.04 THEOREM PROVED
% 0.76/1.04 % SZS status Theorem
% 0.76/1.04
% 0.76/1.04 Exiting with 1 proof.
% 0.76/1.04
% 0.76/1.04 Process 15484 exit (max_proofs) Thu Jun 2 22:48:14 2022
% 0.76/1.04 Prover9 interrupted
%------------------------------------------------------------------------------