TSTP Solution File: SET904+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET904+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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 04:33:17 EDT 2022
% Result : Theorem 27.01s 27.30s
% Output : Refutation 27.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET904+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.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 : Sun Jul 10 07:49:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/0.99 ============================== Prover9 ===============================
% 0.70/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.99 Process 8242 was started by sandbox on n026.cluster.edu,
% 0.70/0.99 Sun Jul 10 07:49:27 2022
% 0.70/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8089_n026.cluster.edu".
% 0.70/0.99 ============================== end of head ===========================
% 0.70/0.99
% 0.70/0.99 ============================== INPUT =================================
% 0.70/0.99
% 0.70/0.99 % Reading from file /tmp/Prover9_8089_n026.cluster.edu
% 0.70/0.99
% 0.70/0.99 set(prolog_style_variables).
% 0.70/0.99 set(auto2).
% 0.70/0.99 % set(auto2) -> set(auto).
% 0.70/0.99 % set(auto) -> set(auto_inference).
% 0.70/0.99 % set(auto) -> set(auto_setup).
% 0.70/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.99 % set(auto) -> set(auto_limits).
% 0.70/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.99 % set(auto) -> set(auto_denials).
% 0.70/0.99 % set(auto) -> set(auto_process).
% 0.70/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.99 % set(auto2) -> assign(stats, some).
% 0.70/0.99 % set(auto2) -> clear(echo_input).
% 0.70/0.99 % set(auto2) -> set(quiet).
% 0.70/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.99 % set(auto2) -> clear(print_given).
% 0.70/0.99 assign(lrs_ticks,-1).
% 0.70/0.99 assign(sos_limit,10000).
% 0.70/0.99 assign(order,kbo).
% 0.70/0.99 set(lex_order_vars).
% 0.70/0.99 clear(print_given).
% 0.70/0.99
% 0.70/0.99 % formulas(sos). % not echoed (10 formulas)
% 0.70/0.99
% 0.70/0.99 ============================== end of input ==========================
% 0.70/0.99
% 0.70/0.99 % From the command line: assign(max_seconds, 300).
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.99
% 0.70/0.99 % Formulas that are not ordinary clauses:
% 0.70/0.99 1 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 2 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 4 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 5 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 6 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 7 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 8 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 9 (all A all B (subset(set_union2(singleton(A),B),B) -> in(A,B))) # label(l21_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 10 -(all A all B (subset(set_union2(singleton(A),B),B) -> in(A,B))) # label(t45_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/0.99
% 0.70/0.99 ============================== end of process non-clausal formulas ===
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.99
% 0.70/0.99 ============================== PREDICATE ELIMINATION =================
% 0.70/0.99
% 0.70/0.99 ============================== end predicate elimination =============
% 0.70/0.99
% 0.70/0.99 Auto_denials:
% 0.70/0.99 % copying label rc2_xboole_0 to answer in negative clause
% 0.70/0.99 % copying label t45_zfmisc_1 to answer in negative clause
% 0.70/0.99 % copying label antisymmetry_r2_hidden to answer in negative clause
% 0.70/0.99 % assign(max_proofs, 3). % (Horn set with more than one neg. clause)
% 0.70/0.99
% 0.70/0.99 Term ordering decisions:
% 0.70/0.99
% 0.70/0.99 % Assigning unary symbol singleton kb_weight 0 and highest precedence (10).
% 0.70/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. set_union2=1. singleton=0.
% 27.01/27.30
% 27.01/27.30 ============================== end of process initial clauses ========
% 27.01/27.30
% 27.01/27.30 ============================== CLAUSES FOR SEARCH ====================
% 27.01/27.30
% 27.01/27.30 ============================== end of clauses for search =============
% 27.01/27.30
% 27.01/27.30 ============================== SEARCH ================================
% 27.01/27.30
% 27.01/27.30 % Starting search at 0.01 seconds.
% 27.01/27.30
% 27.01/27.30 ============================== PROOF =================================
% 27.01/27.30 % SZS status Theorem
% 27.01/27.30 % SZS output start Refutation
% 27.01/27.30
% 27.01/27.30 % Proof 1 at 0.01 (+ 0.00) seconds: t45_zfmisc_1.
% 27.01/27.30 % Length of proof is 10.
% 27.01/27.30 % Level of proof is 3.
% 27.01/27.30 % Maximum clause weight is 9.000.
% 27.01/27.30 % Given clauses 9.
% 27.01/27.30
% 27.01/27.30 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 27.01/27.30 9 (all A all B (subset(set_union2(singleton(A),B),B) -> in(A,B))) # label(l21_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 27.01/27.30 10 -(all A all B (subset(set_union2(singleton(A),B),B) -> in(A,B))) # label(t45_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 27.01/27.30 14 subset(set_union2(singleton(c3),c4),c4) # label(t45_zfmisc_1) # label(negated_conjecture). [clausify(10)].
% 27.01/27.30 15 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(3)].
% 27.01/27.30 17 -in(c3,c4) # label(t45_zfmisc_1) # label(negated_conjecture) # answer(t45_zfmisc_1). [clausify(10)].
% 27.01/27.30 21 -subset(set_union2(singleton(A),B),B) | in(A,B) # label(l21_zfmisc_1) # label(axiom). [clausify(9)].
% 27.01/27.30 22 -subset(set_union2(A,singleton(B)),A) | in(B,A). [copy(21),rewrite([15(2)])].
% 27.01/27.30 23 subset(set_union2(c4,singleton(c3)),c4). [back_rewrite(14),rewrite([15(4)])].
% 27.01/27.30 25 $F # answer(t45_zfmisc_1). [ur(22,b,17,a),unit_del(a,23)].
% 27.01/27.30
% 27.01/27.30 % SZS output end Refutation
% 27.01/27.30 ============================== end of proof ==========================
% 27.01/27.30
% 27.01/27.30 % Disable descendants (x means already disabled):
% 27.01/27.30 17
% 27.01/27.30
% 27.01/27.30 ============================== STATISTICS ============================
% 27.01/27.30
% 27.01/27.30 Given=115. Generated=10033. Kept=116. proofs=1.
% 27.01/27.30 Usable=114. Sos=0. Demods=2. Limbo=0, Disabled=13. Hints=0.
% 27.01/27.30 Megabytes=0.64.
% 27.01/27.30 User_CPU=26.32, System_CPU=0.01, Wall_clock=26.
% 27.01/27.30
% 27.01/27.30 ============================== end of statistics =====================
% 27.01/27.30
% 27.01/27.30 ============================== end of search =========================
% 27.01/27.30
% 27.01/27.30 SEARCH FAILED
% 27.01/27.30
% 27.01/27.30 Exiting with 1 proof.
% 27.01/27.30
% 27.01/27.30 Process 8242 exit (sos_empty) Sun Jul 10 07:49:53 2022
% 27.01/27.30 Prover9 interrupted
%------------------------------------------------------------------------------