TSTP Solution File: SEU180+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 13:29:41 EDT 2022
% Result : Theorem 50.19s 50.49s
% Output : Refutation 50.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 04:42:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.00 ============================== Prover9 ===============================
% 0.72/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.00 Process 15378 was started by sandbox on n017.cluster.edu,
% 0.72/1.00 Sun Jun 19 04:42:58 2022
% 0.72/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15152_n017.cluster.edu".
% 0.72/1.00 ============================== end of head ===========================
% 0.72/1.00
% 0.72/1.00 ============================== INPUT =================================
% 0.72/1.00
% 0.72/1.00 % Reading from file /tmp/Prover9_15152_n017.cluster.edu
% 0.72/1.00
% 0.72/1.00 set(prolog_style_variables).
% 0.72/1.00 set(auto2).
% 0.72/1.00 % set(auto2) -> set(auto).
% 0.72/1.00 % set(auto) -> set(auto_inference).
% 0.72/1.00 % set(auto) -> set(auto_setup).
% 0.72/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.00 % set(auto) -> set(auto_limits).
% 0.72/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.00 % set(auto) -> set(auto_denials).
% 0.72/1.00 % set(auto) -> set(auto_process).
% 0.72/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.00 % set(auto2) -> assign(stats, some).
% 0.72/1.00 % set(auto2) -> clear(echo_input).
% 0.72/1.00 % set(auto2) -> set(quiet).
% 0.72/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.00 % set(auto2) -> clear(print_given).
% 0.72/1.00 assign(lrs_ticks,-1).
% 0.72/1.00 assign(sos_limit,10000).
% 0.72/1.00 assign(order,kbo).
% 0.72/1.00 set(lex_order_vars).
% 0.72/1.00 clear(print_given).
% 0.72/1.00
% 0.72/1.00 % formulas(sos). % not echoed (36 formulas)
% 0.72/1.00
% 0.72/1.00 ============================== end of input ==========================
% 0.72/1.00
% 0.72/1.00 % From the command line: assign(max_seconds, 300).
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.00
% 0.72/1.00 % Formulas that are not ordinary clauses:
% 0.72/1.00 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 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.72/1.00 4 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 5 (all A (relation(A) -> (all B (B = relation_dom(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(C,D),A)))))))) # label(d4_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 6 (all A (relation(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(D,C),A)))))))) # label(d5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 7 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 8 (all A (relation(A) -> relation_field(A) = set_union2(relation_dom(A),relation_rng(A)))) # label(d6_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 9 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 10 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 11 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 12 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 13 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 14 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 15 $T # label(dt_k3_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 16 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 17 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 18 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 19 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 20 (all A all B (relation(A) & relation(B) -> relation(set_union2(A,B)))) # label(fc2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 21 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 22 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 23 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 24 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 25 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 26 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 27 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 28 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 29 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 30 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 31 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 32 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 33 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 34 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 35 -(all A all B all C (relation(C) -> (in(ordered_pair(A,B),C) -> in(A,relation_field(C)) & in(B,relation_field(C))))) # label(t30_relat_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 50.19/50.49
% 50.19/50.49 ============================== end of process non-clausal formulas ===
% 50.19/50.49
% 50.19/50.49 ============================== PROCESS INITIAL CLAUSES ===============
% 50.19/50.49
% 50.19/50.49 ============================== PREDICATE ELIMINATION =================
% 50.19/50.49 36 -element(A,B) | empty(B) | in(A,B) # label(t2_subset) # label(axiom). [clausify(31)].
% 50.19/50.49 37 element(f8(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(18)].
% 50.19/50.49 38 -in(A,B) | element(A,B) # label(t1_subset) # label(axiom). [clausify(30)].
% 50.19/50.49 Derived: empty(A) | in(f8(A),A). [resolve(36,a,37,a)].
% 50.19/50.49
% 50.19/50.49 ============================== end predicate elimination =============
% 50.19/50.49
% 50.19/50.49 Auto_denials: (non-Horn, no changes).
% 50.19/50.49
% 50.19/50.49 Term ordering decisions:
% 50.19/50.49 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. set_union2=1. ordered_pair=1. unordered_pair=1. f3=1. f4=1. f6=1. f7=1. relation_dom=1. relation_rng=1. relation_field=1. singleton=1. f8=1. f1=1. f2=1. f5=1.
% 50.19/50.49
% 50.19/50.49 ============================== end of process initial clauses ========
% 50.19/50.49
% 50.19/50.49 ============================== CLAUSES FOR SEARCH ====================
% 50.19/50.49
% 50.19/50.49 ============================== end of clauses for search =============
% 50.19/50.49
% 50.19/50.49 ============================== SEARCH ================================
% 50.19/50.49
% 50.19/50.49 % Starting search at 0.02 seconds.
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=19.000, iters=3360
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=18.000, iters=3348
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=17.000, iters=3375
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=16.000, iters=3380
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=15.000, iters=3375
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=14.000, iters=3336
% 50.19/50.49
% 50.19/50.49 Low Water (keep): wt=13.000, iters=3334
% 50.19/50.49
% 50.19/50.49 Low Water (displace): id=2954, wt=52.000
% 50.19/50.49
% 50.19/50.49 ============================== PROOF =================================
% 50.19/50.49 % SZS status Theorem
% 50.19/50.49 % SZS output start Refutation
% 50.19/50.49
% 50.19/50.49 % Proof 1 at 48.33 (+ 1.15) seconds.
% 50.19/50.49 % Length of proof is 62.
% 50.19/50.49 % Level of proof is 16.
% 50.19/50.49 % Maximum clause weight is 28.000.
% 50.19/50.49 % Given clauses 4961.
% 50.19/50.49
% 50.19/50.49 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 4 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 5 (all A (relation(A) -> (all B (B = relation_dom(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(C,D),A)))))))) # label(d4_relat_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 6 (all A (relation(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(D,C),A)))))))) # label(d5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 7 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 8 (all A (relation(A) -> relation_field(A) = set_union2(relation_dom(A),relation_rng(A)))) # label(d6_relat_1) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 25 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 33 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 50.19/50.49 35 -(all A all B all C (relation(C) -> (in(ordered_pair(A,B),C) -> in(A,relation_field(C)) & in(B,relation_field(C))))) # label(t30_relat_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 50.19/50.49 39 empty(empty_set) # label(fc1_xboole_0) # label(axiom). [assumption].
% 50.19/50.49 43 relation(c6) # label(t30_relat_1) # label(negated_conjecture). [clausify(35)].
% 50.19/50.49 44 set_union2(A,A) = A # label(idempotence_k2_xboole_0) # label(axiom). [clausify(25)].
% 50.19/50.49 46 in(ordered_pair(c4,c5),c6) # label(t30_relat_1) # label(negated_conjecture). [clausify(35)].
% 50.19/50.49 47 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(2)].
% 50.19/50.49 48 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(3)].
% 50.19/50.49 49 ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) # label(d5_tarski) # label(axiom). [clausify(7)].
% 50.19/50.49 50 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,B)). [copy(49),rewrite([47(4)])].
% 50.19/50.49 51 set_union2(A,B) = C | in(f1(A,B,C),C) | in(f1(A,B,C),A) | in(f1(A,B,C),B) # label(d2_xboole_0) # label(axiom). [clausify(4)].
% 50.19/50.49 57 -in(A,B) | -empty(B) # label(t7_boole) # label(axiom). [clausify(33)].
% 50.19/50.49 59 -in(c4,relation_field(c6)) | -in(c5,relation_field(c6)) # label(t30_relat_1) # label(negated_conjecture). [clausify(35)].
% 50.19/50.49 65 -relation(A) | relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) # label(d6_relat_1) # label(axiom). [clausify(8)].
% 50.19/50.49 66 -relation(A) | set_union2(relation_dom(A),relation_rng(A)) = relation_field(A). [copy(65),flip(b)].
% 50.19/50.49 67 set_union2(A,B) != C | in(D,C) | -in(D,A) # label(d2_xboole_0) # label(axiom). [clausify(4)].
% 50.19/50.49 68 set_union2(A,B) != C | in(D,C) | -in(D,B) # label(d2_xboole_0) # label(axiom). [clausify(4)].
% 50.19/50.49 69 set_union2(A,B) != C | -in(D,C) | in(D,A) | in(D,B) # label(d2_xboole_0) # label(axiom). [clausify(4)].
% 50.19/50.49 70 -relation(A) | relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) # label(d4_relat_1) # label(axiom). [clausify(5)].
% 50.19/50.49 71 -relation(A) | relation_dom(A) != B | in(C,B) | -in(unordered_pair(singleton(C),unordered_pair(C,D)),A). [copy(70),rewrite([50(5)])].
% 50.19/50.49 72 -relation(A) | relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) # label(d5_relat_1) # label(axiom). [clausify(6)].
% 50.19/50.49 73 -relation(A) | relation_rng(A) != B | in(C,B) | -in(unordered_pair(singleton(D),unordered_pair(C,D)),A). [copy(72),rewrite([50(5),47(6)])].
% 50.19/50.49 74 set_union2(A,B) = C | -in(f1(A,B,C),C) | -in(f1(A,B,C),A) # label(d2_xboole_0) # label(axiom). [clausify(4)].
% 50.19/50.49 89 in(unordered_pair(singleton(c4),unordered_pair(c4,c5)),c6). [back_rewrite(46),rewrite([50(3)])].
% 50.19/50.49 90 set_union2(A,B) = A | in(f1(A,B,A),A) | in(f1(A,B,A),B). [factor(51,b,c)].
% 50.19/50.49 95 set_union2(A,B) = A | -in(f1(A,B,A),A). [factor(74,b,c)].
% 50.19/50.49 102 -in(A,empty_set). [ur(57,b,39,a)].
% 50.19/50.49 119 set_union2(relation_dom(c6),relation_rng(c6)) = relation_field(c6). [resolve(66,a,43,a)].
% 50.19/50.49 122 set_union2(A,B) != C | in(f1(D,E,A),C) | set_union2(D,E) = A | in(f1(D,E,A),D) | in(f1(D,E,A),E). [resolve(67,c,51,b)].
% 50.19/50.49 129 set_union2(A,B) != C | in(f1(C,D,A),C) | set_union2(C,D) = A | in(f1(C,D,A),D). [factor(122,b,d)].
% 50.19/50.49 214 relation_dom(c6) != A | in(c4,A). [resolve(89,a,71,d),unit_del(a,43)].
% 50.19/50.49 270 set_union2(A,B) = A | in(f1(A,B,A),B). [resolve(95,b,90,b),merge(b)].
% 50.19/50.49 322 in(c4,relation_dom(c6)). [resolve(214,a,44,a(flip)),rewrite([44(6)])].
% 50.19/50.49 367 set_union2(A,relation_dom(c6)) != B | in(c4,B). [resolve(322,a,68,c)].
% 50.19/50.49 574 in(c4,set_union2(A,relation_dom(c6))). [resolve(367,a,48,a),rewrite([48(4)])].
% 50.19/50.49 578 set_union2(A,relation_dom(c6)) != set_union2(B,C) | in(c4,B) | in(c4,C). [resolve(574,a,69,b),flip(a)].
% 50.19/50.49 1132 set_union2(A,B) = A | set_union2(B,C) != D | in(f1(A,B,A),D). [resolve(270,b,68,c),rewrite([48(3)])].
% 50.19/50.49 1381 in(f1(set_union2(A,B),C,B),set_union2(A,B)) | set_union2(C,set_union2(A,B)) = B | in(f1(set_union2(A,B),C,B),C). [resolve(129,a,48,a),rewrite([48(6)])].
% 50.19/50.49 12575 set_union2(A,B) = A | in(f1(A,B,A),set_union2(B,C)). [resolve(1132,b,48,a),rewrite([48(4)])].
% 50.19/50.49 12590 set_union2(A,set_union2(A,B)) = set_union2(A,B). [resolve(12575,b,95,b),rewrite([48(2),48(6)]),merge(b)].
% 50.19/50.49 12593 set_union2(A,B) = A | set_union2(C,set_union2(B,D)) != E | in(f1(A,B,A),E). [resolve(12575,b,68,c)].
% 50.19/50.49 12716 set_union2(relation_dom(c6),relation_field(c6)) = relation_field(c6). [para(119(a,1),12590(a,1,2)),rewrite([119(10)])].
% 50.19/50.49 19298 in(f1(set_union2(A,B),empty_set,B),set_union2(A,B)) | set_union2(empty_set,set_union2(A,B)) = B. [resolve(1381,c,102,a)].
% 50.19/50.49 19797 in(f1(relation_field(c6),empty_set,relation_field(c6)),relation_field(c6)) | set_union2(empty_set,relation_field(c6)) = relation_field(c6). [para(12716(a,1),19298(a,1,1)),rewrite([12716(11),12716(15)])].
% 50.19/50.49 19830 set_union2(empty_set,relation_field(c6)) = relation_field(c6). [resolve(19797,a,95,b),rewrite([48(11)]),merge(b)].
% 50.19/50.49 21347 set_union2(A,B) = A | in(f1(A,B,A),set_union2(C,set_union2(B,D))). [resolve(12593,b,48,a),rewrite([48(5)])].
% 50.19/50.49 21351 set_union2(A,set_union2(B,set_union2(A,C))) = set_union2(B,set_union2(A,C)). [resolve(21347,b,95,b),rewrite([48(3),48(9)]),merge(b)].
% 50.19/50.49 22835 set_union2(empty_set,set_union2(A,relation_field(c6))) = set_union2(A,relation_field(c6)). [para(19830(a,1),21351(a,1,2,2)),rewrite([19830(9)])].
% 50.19/50.49 22886 set_union2(A,relation_field(c6)) != set_union2(B,relation_dom(c6)) | in(c4,set_union2(A,relation_field(c6))). [para(22835(a,1),578(a,2)),flip(a),unit_del(b,102)].
% 50.19/50.49 23219 in(c4,relation_field(c6)). [resolve(22886,a,48,a),rewrite([12716(6)])].
% 50.19/50.49 23220 -in(c5,relation_field(c6)). [back_unit_del(59),unit_del(a,23219)].
% 50.19/50.49 23222 -in(c5,relation_rng(c6)). [ur(68,a,119,a,b,23220,a)].
% 50.19/50.49 23225 -in(unordered_pair(singleton(A),unordered_pair(A,c5)),c6). [ur(73,a,43,a,b,xx,c,23222,a),rewrite([47(3)])].
% 50.19/50.49 23226 $F. [resolve(23225,a,89,a)].
% 50.19/50.49
% 50.19/50.49 % SZS output end Refutation
% 50.19/50.49 ============================== end of proof ==========================
% 50.19/50.49
% 50.19/50.49 ============================== STATISTICS ============================
% 50.19/50.49
% 50.19/50.49 Given=4961. Generated=2067441. Kept=23175. proofs=1.
% 50.19/50.49 Usable=4038. Sos=9526. Demods=34. Limbo=1, Disabled=9651. Hints=0.
% 50.19/50.49 Megabytes=24.16.
% 50.19/50.49 User_CPU=48.34, System_CPU=1.15, Wall_clock=50.
% 50.19/50.49
% 50.19/50.49 ============================== end of statistics =====================
% 50.19/50.49
% 50.19/50.49 ============================== end of search =========================
% 50.19/50.49
% 50.19/50.49 THEOREM PROVED
% 50.19/50.49 % SZS status Theorem
% 50.19/50.49
% 50.19/50.49 Exiting with 1 proof.
% 50.19/50.49
% 50.19/50.49 Process 15378 exit (max_proofs) Sun Jun 19 04:43:48 2022
% 50.19/50.49 Prover9 interrupted
%------------------------------------------------------------------------------