TSTP Solution File: SEU153+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:25 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 : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 21:18:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.03 ============================== Prover9 ===============================
% 0.76/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.03 Process 4464 was started by sandbox2 on n024.cluster.edu,
% 0.76/1.03 Sat Jun 18 21:18:18 2022
% 0.76/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4310_n024.cluster.edu".
% 0.76/1.03 ============================== end of head ===========================
% 0.76/1.03
% 0.76/1.03 ============================== INPUT =================================
% 0.76/1.03
% 0.76/1.03 % Reading from file /tmp/Prover9_4310_n024.cluster.edu
% 0.76/1.03
% 0.76/1.03 set(prolog_style_variables).
% 0.76/1.03 set(auto2).
% 0.76/1.03 % set(auto2) -> set(auto).
% 0.76/1.03 % set(auto) -> set(auto_inference).
% 0.76/1.03 % set(auto) -> set(auto_setup).
% 0.76/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.03 % set(auto) -> set(auto_limits).
% 0.76/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.03 % set(auto) -> set(auto_denials).
% 0.76/1.03 % set(auto) -> set(auto_process).
% 0.76/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.03 % set(auto2) -> assign(stats, some).
% 0.76/1.03 % set(auto2) -> clear(echo_input).
% 0.76/1.03 % set(auto2) -> set(quiet).
% 0.76/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.03 % set(auto2) -> clear(print_given).
% 0.76/1.03 assign(lrs_ticks,-1).
% 0.76/1.03 assign(sos_limit,10000).
% 0.76/1.03 assign(order,kbo).
% 0.76/1.03 set(lex_order_vars).
% 0.76/1.03 clear(print_given).
% 0.76/1.03
% 0.76/1.03 % formulas(sos). % not echoed (15 formulas)
% 0.76/1.03
% 0.76/1.03 ============================== end of input ==========================
% 0.76/1.03
% 0.76/1.03 % From the command line: assign(max_seconds, 300).
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.03
% 0.76/1.03 % Formulas that are not ordinary clauses:
% 0.76/1.03 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 4 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 6 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 7 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 9 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 10 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 11 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 12 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 13 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 14 -(all A all B -(disjoint(singleton(A),B) & in(A,B))) # label(l25_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.03
% 0.76/1.03 ============================== end of process non-clausal formulas ===
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.03
% 0.76/1.03 ============================== PREDICATE ELIMINATION =================
% 0.76/1.03
% 0.76/1.03 ============================== end predicate elimination =============
% 0.76/1.03
% 0.76/1.03 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: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_intersection2=1. f1=1. singleton=1. f2=1. f3=1.
% 0.76/1.04
% 0.76/1.04 ============================== end of process initial clauses ========
% 0.76/1.04
% 0.76/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.04
% 0.76/1.04 ============================== end of clauses for search =============
% 0.76/1.04
% 0.76/1.04 ============================== SEARCH ================================
% 0.76/1.04
% 0.76/1.04 % Starting search at 0.01 seconds.
% 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.03 (+ 0.00) seconds.
% 0.76/1.04 % Length of proof is 23.
% 0.76/1.04 % Level of proof is 5.
% 0.76/1.04 % Maximum clause weight is 14.000.
% 0.76/1.04 % Given clauses 53.
% 0.76/1.04
% 0.76/1.04 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 4 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 6 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 10 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.04 14 -(all A all B -(disjoint(singleton(A),B) & in(A,B))) # label(l25_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.04 17 in(c3,c4) # label(l25_zfmisc_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.04 18 disjoint(singleton(c3),c4) # label(l25_zfmisc_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.04 19 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(10)].
% 0.76/1.04 20 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(2)].
% 0.76/1.04 22 singleton(A) = B | in(f1(A,B),B) | f1(A,B) = A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.76/1.04 27 empty_set != A | -in(B,A) # label(d1_xboole_0) # label(axiom). [clausify(4)].
% 0.76/1.04 29 -disjoint(A,B) | set_intersection2(A,B) = empty_set # label(d7_xboole_0) # label(axiom). [clausify(6)].
% 0.76/1.04 32 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.76/1.04 36 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 0.76/1.04 59 -in(A,empty_set). [ur(27,a,19,a(flip)),rewrite([19(3)])].
% 0.76/1.04 61 set_intersection2(c4,singleton(c3)) = empty_set. [resolve(29,a,18,a),rewrite([20(4)])].
% 0.76/1.04 158 singleton(A) = empty_set | f1(A,empty_set) = A. [resolve(59,a,22,b)].
% 0.76/1.04 160 singleton(A) != empty_set. [ur(32,b,59,a,c,19,a)].
% 0.76/1.04 161 f1(A,empty_set) = A. [back_unit_del(158),unit_del(a,160)].
% 0.76/1.04 175 -in(c3,singleton(c3)). [ur(36,a,61,a,b,59,a,c,17,a)].
% 0.76/1.04 185 $F. [ur(32,b,175,a,c,161,a(flip)),rewrite([161(3)]),xx(a)].
% 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=53. Generated=505. Kept=170. proofs=1.
% 0.76/1.04 Usable=50. Sos=109. Demods=5. Limbo=3, Disabled=31. Hints=0.
% 0.76/1.04 Megabytes=0.15.
% 0.76/1.04 User_CPU=0.03, 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 4464 exit (max_proofs) Sat Jun 18 21:18:18 2022
% 0.76/1.04 Prover9 interrupted
%------------------------------------------------------------------------------