TSTP Solution File: SEU122+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : Tue Jul 19 13:29:07 EDT 2022
% Result : Theorem 0.48s 0.81s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.30 % Computer : n018.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Mon Jun 20 04:55:50 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.48/0.81 ============================== Prover9 ===============================
% 0.48/0.81 Prover9 (32) version 2009-11A, November 2009.
% 0.48/0.81 Process 3509 was started by sandbox on n018.cluster.edu,
% 0.48/0.81 Mon Jun 20 04:55:50 2022
% 0.48/0.81 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3248_n018.cluster.edu".
% 0.48/0.81 ============================== end of head ===========================
% 0.48/0.81
% 0.48/0.81 ============================== INPUT =================================
% 0.48/0.81
% 0.48/0.81 % Reading from file /tmp/Prover9_3248_n018.cluster.edu
% 0.48/0.81
% 0.48/0.81 set(prolog_style_variables).
% 0.48/0.81 set(auto2).
% 0.48/0.81 % set(auto2) -> set(auto).
% 0.48/0.81 % set(auto) -> set(auto_inference).
% 0.48/0.81 % set(auto) -> set(auto_setup).
% 0.48/0.81 % set(auto_setup) -> set(predicate_elim).
% 0.48/0.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/0.81 % set(auto) -> set(auto_limits).
% 0.48/0.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/0.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/0.81 % set(auto) -> set(auto_denials).
% 0.48/0.81 % set(auto) -> set(auto_process).
% 0.48/0.81 % set(auto2) -> assign(new_constants, 1).
% 0.48/0.81 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/0.81 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/0.81 % set(auto2) -> assign(max_hours, 1).
% 0.48/0.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/0.81 % set(auto2) -> assign(max_seconds, 0).
% 0.48/0.81 % set(auto2) -> assign(max_minutes, 5).
% 0.48/0.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/0.81 % set(auto2) -> set(sort_initial_sos).
% 0.48/0.81 % set(auto2) -> assign(sos_limit, -1).
% 0.48/0.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/0.81 % set(auto2) -> assign(max_megs, 400).
% 0.48/0.81 % set(auto2) -> assign(stats, some).
% 0.48/0.81 % set(auto2) -> clear(echo_input).
% 0.48/0.81 % set(auto2) -> set(quiet).
% 0.48/0.81 % set(auto2) -> clear(print_initial_clauses).
% 0.48/0.81 % set(auto2) -> clear(print_given).
% 0.48/0.81 assign(lrs_ticks,-1).
% 0.48/0.81 assign(sos_limit,10000).
% 0.48/0.81 assign(order,kbo).
% 0.48/0.81 set(lex_order_vars).
% 0.48/0.81 clear(print_given).
% 0.48/0.81
% 0.48/0.81 % formulas(sos). % not echoed (11 formulas)
% 0.48/0.81
% 0.48/0.81 ============================== end of input ==========================
% 0.48/0.81
% 0.48/0.81 % From the command line: assign(max_seconds, 300).
% 0.48/0.81
% 0.48/0.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/0.81
% 0.48/0.81 % Formulas that are not ordinary clauses:
% 0.48/0.81 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 2 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 3 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 4 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 5 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 6 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 7 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 8 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 9 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 10 -(all A subset(empty_set,A)) # label(t2_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/0.81
% 0.48/0.81 ============================== end of process non-clausal formulas ===
% 0.48/0.81
% 0.48/0.81 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/0.81
% 0.48/0.81 ============================== PREDICATE ELIMINATION =================
% 0.48/0.81
% 0.48/0.81 ============================== end predicate elimination =============
% 0.48/0.81
% 0.48/0.81 Auto_denials: (non-Horn, no changes).
% 0.48/0.81
% 0.48/0.81 Term ordering decisions:
% 0.48/0.81 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. f1=1.
% 0.48/0.81
% 0.48/0.81 ============================== end of process initial clauses ========
% 0.48/0.81
% 0.48/0.81 ============================== CLAUSES FOR SEARCH ====================
% 0.48/0.81
% 0.48/0.81 ============================== end of clauses for search =============
% 0.48/0.81
% 0.48/0.81 ============================== SEARCH ================================
% 0.48/0.81
% 0.48/0.81 % Starting search at 0.01 seconds.
% 0.48/0.81
% 0.48/0.81 ============================== PROOF =================================
% 0.48/0.81 % SZS status Theorem
% 0.48/0.81 % SZS output start Refutation
% 0.48/0.81
% 0.48/0.81 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.48/0.81 % Length of proof is 10.
% 0.48/0.81 % Level of proof is 3.
% 0.48/0.81 % Maximum clause weight is 8.000.
% 0.48/0.81 % Given clauses 7.
% 0.48/0.81
% 0.48/0.81 2 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 8 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.81 10 -(all A subset(empty_set,A)) # label(t2_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/0.81 11 empty(empty_set) # label(fc1_xboole_0) # label(axiom). [assumption].
% 0.48/0.81 14 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(2)].
% 0.48/0.81 16 -subset(empty_set,c3) # label(t2_xboole_1) # label(negated_conjecture). [clausify(10)].
% 0.48/0.81 17 -in(A,B) | -empty(B) # label(t7_boole) # label(axiom). [clausify(8)].
% 0.48/0.81 24 in(f1(empty_set,c3),empty_set). [resolve(16,a,14,a)].
% 0.48/0.81 26 -in(A,empty_set). [ur(17,b,11,a)].
% 0.48/0.81 27 $F. [resolve(26,a,24,a)].
% 0.48/0.81
% 0.48/0.81 % SZS output end Refutation
% 0.48/0.81 ============================== end of proof ==========================
% 0.48/0.81
% 0.48/0.81 ============================== STATISTICS ============================
% 0.48/0.81
% 0.48/0.81 Given=7. Generated=17. Kept=16. proofs=1.
% 0.48/0.81 Usable=7. Sos=7. Demods=0. Limbo=1, Disabled=12. Hints=0.
% 0.48/0.81 Megabytes=0.04.
% 0.48/0.81 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.48/0.81
% 0.48/0.81 ============================== end of statistics =====================
% 0.48/0.81
% 0.48/0.81 ============================== end of search =========================
% 0.48/0.81
% 0.48/0.81 THEOREM PROVED
% 0.48/0.81 % SZS status Theorem
% 0.48/0.81
% 0.48/0.81 Exiting with 1 proof.
% 0.48/0.81
% 0.48/0.81 Process 3509 exit (max_proofs) Mon Jun 20 04:55:50 2022
% 0.48/0.81 Prover9 interrupted
%------------------------------------------------------------------------------