TSTP Solution File: SEU123+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:08 EDT 2022
% Result : Theorem 0.42s 0.97s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 05:51:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.97 ============================== Prover9 ===============================
% 0.42/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.97 Process 10813 was started by sandbox on n027.cluster.edu,
% 0.42/0.97 Mon Jun 20 05:51:25 2022
% 0.42/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10660_n027.cluster.edu".
% 0.42/0.97 ============================== end of head ===========================
% 0.42/0.97
% 0.42/0.97 ============================== INPUT =================================
% 0.42/0.97
% 0.42/0.97 % Reading from file /tmp/Prover9_10660_n027.cluster.edu
% 0.42/0.97
% 0.42/0.97 set(prolog_style_variables).
% 0.42/0.97 set(auto2).
% 0.42/0.97 % set(auto2) -> set(auto).
% 0.42/0.97 % set(auto) -> set(auto_inference).
% 0.42/0.97 % set(auto) -> set(auto_setup).
% 0.42/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.97 % set(auto) -> set(auto_limits).
% 0.42/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.97 % set(auto) -> set(auto_denials).
% 0.42/0.97 % set(auto) -> set(auto_process).
% 0.42/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.97 % set(auto2) -> assign(stats, some).
% 0.42/0.97 % set(auto2) -> clear(echo_input).
% 0.42/0.97 % set(auto2) -> set(quiet).
% 0.42/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.97 % set(auto2) -> clear(print_given).
% 0.42/0.97 assign(lrs_ticks,-1).
% 0.42/0.97 assign(sos_limit,10000).
% 0.42/0.97 assign(order,kbo).
% 0.42/0.97 set(lex_order_vars).
% 0.42/0.97 clear(print_given).
% 0.42/0.97
% 0.42/0.97 % formulas(sos). % not echoed (12 formulas)
% 0.42/0.97
% 0.42/0.97 ============================== end of input ==========================
% 0.42/0.97
% 0.42/0.97 % From the command line: assign(max_seconds, 300).
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.97
% 0.42/0.97 % Formulas that are not ordinary clauses:
% 0.42/0.97 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 2 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 3 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 4 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 5 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 6 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 7 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 8 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 9 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 10 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 11 -(all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97
% 0.42/0.97 ============================== end of process non-clausal formulas ===
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.97
% 0.42/0.97 ============================== PREDICATE ELIMINATION =================
% 0.42/0.97
% 0.42/0.97 ============================== end predicate elimination =============
% 0.42/0.97
% 0.42/0.97 Auto_denials:
% 0.42/0.97 % copying label rc2_xboole_0 to answer in negative clause
% 0.42/0.97 % copying label t3_xboole_1 to answer in negative clause
% 0.42/0.97 % copying label t7_boole to answer in negative clause
% 0.42/0.97 % copying label antisymmetry_r2_hidden to answer in negative clause
% 0.42/0.97 % assign(max_proofs, 4). % (Horn set with more than one neg. clause)
% 0.42/0.97
% 0.42/0.97 Term ordering decisions:
% 0.42/0.97 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1.
% 0.42/0.97
% 0.42/0.97 ============================== end of process initial clauses ========
% 0.42/0.97
% 0.42/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.97
% 0.42/0.97 ============================== end of clauses for search =============
% 0.42/0.97
% 0.42/0.97 ============================== SEARCH ================================
% 0.42/0.97
% 0.42/0.97 % Starting search at 0.01 seconds.
% 0.42/0.97
% 0.42/0.97 ============================== PROOF =================================
% 0.42/0.97 % SZS status Theorem
% 0.42/0.97 % SZS output start Refutation
% 0.42/0.97
% 0.42/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: t3_xboole_1.
% 0.42/0.97 % Length of proof is 9.
% 0.42/0.97 % Level of proof is 3.
% 0.42/0.97 % Maximum clause weight is 9.000.
% 0.42/0.97 % Given clauses 14.
% 0.42/0.97
% 0.42/0.97 2 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 7 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 11 -(all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97 15 subset(empty_set,A) # label(t2_xboole_1) # label(axiom). [clausify(7)].
% 0.42/0.97 16 subset(c3,empty_set) # label(t3_xboole_1) # label(negated_conjecture). [clausify(11)].
% 0.42/0.97 18 empty_set != c3 # label(t3_xboole_1) # label(negated_conjecture) # answer(t3_xboole_1). [clausify(11)].
% 0.42/0.97 19 c3 != empty_set # answer(t3_xboole_1). [copy(18),flip(a)].
% 0.42/0.97 26 A = B | -subset(B,A) | -subset(A,B) # label(d10_xboole_0) # label(axiom). [clausify(2)].
% 0.42/0.97 31 $F # answer(t3_xboole_1). [hyper(26,b,16,a,c,15,a),flip(a),unit_del(a,19)].
% 0.42/0.97
% 0.42/0.97 % SZS output end Refutation
% 0.42/0.97 ============================== end of proof ==========================
% 0.42/0.97 % Redundant proof: 32 $F # answer(t3_xboole_1). [hyper(26,b,15,a,c,16,a),unit_del(a,19)].
% 0.42/0.97 % Redundant proof: 33 $F # answer(t3_xboole_1). [ur(26,a,19,a,c,16,a),unit_del(a,15)].
% 0.42/0.97 % Redundant proof: 34 $F # answer(t3_xboole_1). [ur(26,a,19,a(flip),c,15,a),unit_del(a,16)].
% 0.42/0.97 % Redundant proof: 35 $F # answer(t3_xboole_1). [ur(26,a,19,a,b,15,a),unit_del(a,16)].
% 0.42/0.97 % Redundant proof: 36 $F # answer(t3_xboole_1). [ur(26,a,19,a(flip),b,16,a),unit_del(a,15)].
% 0.42/0.97
% 0.42/0.97 % Disable descendants (x means already disabled):
% 0.42/0.97 18x 19 30
% 0.42/0.97
% 0.42/0.97 ============================== STATISTICS ============================
% 0.42/0.97
% 0.42/0.97 Given=16. Generated=41. Kept=18. proofs=1.
% 0.42/0.97 Usable=14. Sos=0. Demods=1. Limbo=0, Disabled=18. Hints=0.
% 0.42/0.97 Megabytes=0.04.
% 0.42/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.97
% 0.42/0.97 ============================== end of statistics =====================
% 0.42/0.97
% 0.42/0.97 ============================== end of search =========================
% 0.42/0.97
% 0.42/0.97 SEARCH FAILED
% 0.42/0.97
% 0.42/0.97 Exiting with 1 proof.
% 0.42/0.97
% 0.42/0.97 Process 10813 exit (sos_empty) Mon Jun 20 05:51:25 2022
% 0.42/0.98 Prover9 interrupted
%------------------------------------------------------------------------------