TSTP Solution File: SEU239+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:30:15 EDT 2022
% Result : Theorem 0.70s 1.02s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.29 % Computer : n029.cluster.edu
% 0.07/0.29 % Model : x86_64 x86_64
% 0.07/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.29 % Memory : 8042.1875MB
% 0.07/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.29 % CPULimit : 300
% 0.07/0.29 % WCLimit : 600
% 0.07/0.29 % DateTime : Sun Jun 19 23:58:15 EDT 2022
% 0.07/0.29 % CPUTime :
% 0.70/0.96 ============================== Prover9 ===============================
% 0.70/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.96 Process 26365 was started by sandbox on n029.cluster.edu,
% 0.70/0.96 Sun Jun 19 23:58:15 2022
% 0.70/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26212_n029.cluster.edu".
% 0.70/0.96 ============================== end of head ===========================
% 0.70/0.96
% 0.70/0.96 ============================== INPUT =================================
% 0.70/0.96
% 0.70/0.96 % Reading from file /tmp/Prover9_26212_n029.cluster.edu
% 0.70/0.96
% 0.70/0.96 set(prolog_style_variables).
% 0.70/0.96 set(auto2).
% 0.70/0.96 % set(auto2) -> set(auto).
% 0.70/0.96 % set(auto) -> set(auto_inference).
% 0.70/0.96 % set(auto) -> set(auto_setup).
% 0.70/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.96 % set(auto) -> set(auto_limits).
% 0.70/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.96 % set(auto) -> set(auto_denials).
% 0.70/0.96 % set(auto) -> set(auto_process).
% 0.70/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.96 % set(auto2) -> assign(stats, some).
% 0.70/0.96 % set(auto2) -> clear(echo_input).
% 0.70/0.96 % set(auto2) -> set(quiet).
% 0.70/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.96 % set(auto2) -> clear(print_given).
% 0.70/0.96 assign(lrs_ticks,-1).
% 0.70/0.96 assign(sos_limit,10000).
% 0.70/0.96 assign(order,kbo).
% 0.70/0.96 set(lex_order_vars).
% 0.70/0.96 clear(print_given).
% 0.70/0.96
% 0.70/0.96 % formulas(sos). % not echoed (36 formulas)
% 0.70/0.96
% 0.70/0.96 ============================== end of input ==========================
% 0.70/0.96
% 0.70/0.96 % From the command line: assign(max_seconds, 300).
% 0.70/0.96
% 0.70/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.96
% 0.70/0.96 % Formulas that are not ordinary clauses:
% 0.70/0.96 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 3 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 5 (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.96 6 (all A (relation(A) -> (all B (is_reflexive_in(A,B) <-> (all C (in(C,B) -> in(ordered_pair(C,C),A))))))) # label(d1_relat_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 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.70/0.96 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.70/0.96 9 (all A (relation(A) -> (reflexive(A) <-> is_reflexive_in(A,relation_field(A))))) # label(d9_relat_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 10 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 11 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 12 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 13 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 14 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 15 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 16 $T # label(dt_k3_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 17 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.96 18 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 19 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 20 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 21 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 22 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 23 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 24 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 25 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 26 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 28 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 29 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 30 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 31 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 32 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 33 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 34 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.97 35 -(all A (relation(A) -> (reflexive(A) <-> (all B (in(B,relation_field(A)) -> in(ordered_pair(B,B),A)))))) # label(l1_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/0.97
% 0.70/0.97 ============================== end of process non-clausal formulas ===
% 0.70/0.97
% 0.70/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.97
% 0.70/0.97 ============================== PREDICATE ELIMINATION =================
% 0.70/0.97 36 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(3)].
% 0.70/0.97 37 relation(c1) # label(rc1_funct_1) # label(axiom). [clausify(24)].
% 0.70/0.97 38 relation(c3) # label(rc2_funct_1) # label(axiom). [clausify(26)].
% 0.70/0.97 39 relation(c5) # label(rc3_funct_1) # label(axiom). [clausify(28)].
% 0.70/0.97 40 relation(c6) # label(l1_wellord1) # label(negated_conjecture). [clausify(35)].
% 0.70/0.97 Derived: -empty(c1) | -function(c1) | one_to_one(c1). [resolve(36,a,37,a)].
% 0.70/0.97 Derived: -empty(c3) | -function(c3) | one_to_one(c3). [resolve(36,a,38,a)].
% 0.70/0.97 Derived: -empty(c5) | -function(c5) | one_to_one(c5). [resolve(36,a,39,a)].
% 0.70/0.97 Derived: -empty(c6) | -function(c6) | one_to_one(c6). [resolve(36,a,40,a)].
% 0.70/0.97 41 -relation(A) | -reflexive(A) | is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom). [clausify(9)].
% 0.70/0.97 Derived: -reflexive(c1) | is_reflexive_in(c1,relation_field(c1)). [resolve(41,a,37,a)].
% 0.70/0.97 Derived: -reflexive(c3) | is_reflexive_in(c3,relation_field(c3)). [resolve(41,a,38,a)].
% 0.70/0.97 Derived: -reflexive(c5) | is_reflexive_in(c5,relation_field(c5)). [resolve(41,a,39,a)].
% 0.70/0.97 Derived: -reflexive(c6) | is_reflexive_in(c6,relation_field(c6)). [resolve(41,a,40,a)].
% 0.70/0.97 42 -relation(A) | reflexive(A) | -is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom). [clausify(9)].
% 0.70/0.97 Derived: reflexive(c1) | -is_reflexive_in(c1,relation_field(c1)). [resolve(42,a,37,a)].
% 0.70/0.97 Derived: reflexive(c3) | -is_reflexive_in(c3,relation_field(c3)). [resolve(42,a,38,a)].
% 0.70/0.97 Derived: reflexive(c5) | -is_reflexive_in(c5,relation_field(c5)). [resolve(42,a,39,a)].
% 0.70/0.97 Derived: reflexive(c6) | -is_reflexive_in(c6,relation_field(c6)). [resolve(42,a,40,a)].
% 0.70/0.97 43 -relation(A) | is_reflexive_in(A,B) | in(f1(A,B),B) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 Derived: is_reflexive_in(c1,A) | in(f1(c1,A),A). [resolve(43,a,37,a)].
% 0.70/1.02 Derived: is_reflexive_in(c3,A) | in(f1(c3,A),A). [resolve(43,a,38,a)].
% 0.70/1.02 Derived: is_reflexive_in(c5,A) | in(f1(c5,A),A). [resolve(43,a,39,a)].
% 0.70/1.02 Derived: is_reflexive_in(c6,A) | in(f1(c6,A),A). [resolve(43,a,40,a)].
% 0.70/1.02 44 -relation(A) | relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) # label(d6_relat_1) # label(axiom). [clausify(8)].
% 0.70/1.02 Derived: relation_field(c1) = set_union2(relation_dom(c1),relation_rng(c1)). [resolve(44,a,37,a)].
% 0.70/1.02 Derived: relation_field(c3) = set_union2(relation_dom(c3),relation_rng(c3)). [resolve(44,a,38,a)].
% 0.70/1.02 Derived: relation_field(c5) = set_union2(relation_dom(c5),relation_rng(c5)). [resolve(44,a,39,a)].
% 0.70/1.02 Derived: relation_field(c6) = set_union2(relation_dom(c6),relation_rng(c6)). [resolve(44,a,40,a)].
% 0.70/1.02 45 -relation(A) | -is_reflexive_in(A,B) | -in(C,B) | in(ordered_pair(C,C),A) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 Derived: -is_reflexive_in(c1,A) | -in(B,A) | in(ordered_pair(B,B),c1). [resolve(45,a,37,a)].
% 0.70/1.02 Derived: -is_reflexive_in(c3,A) | -in(B,A) | in(ordered_pair(B,B),c3). [resolve(45,a,38,a)].
% 0.70/1.02 Derived: -is_reflexive_in(c5,A) | -in(B,A) | in(ordered_pair(B,B),c5). [resolve(45,a,39,a)].
% 0.70/1.02 Derived: -is_reflexive_in(c6,A) | -in(B,A) | in(ordered_pair(B,B),c6). [resolve(45,a,40,a)].
% 0.70/1.02 46 -relation(A) | is_reflexive_in(A,B) | -in(ordered_pair(f1(A,B),f1(A,B)),A) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 Derived: is_reflexive_in(c1,A) | -in(ordered_pair(f1(c1,A),f1(c1,A)),c1). [resolve(46,a,37,a)].
% 0.70/1.02 Derived: is_reflexive_in(c3,A) | -in(ordered_pair(f1(c3,A),f1(c3,A)),c3). [resolve(46,a,38,a)].
% 0.70/1.02 Derived: is_reflexive_in(c5,A) | -in(ordered_pair(f1(c5,A),f1(c5,A)),c5). [resolve(46,a,39,a)].
% 0.70/1.02 Derived: is_reflexive_in(c6,A) | -in(ordered_pair(f1(c6,A),f1(c6,A)),c6). [resolve(46,a,40,a)].
% 0.70/1.02 47 -element(A,B) | empty(B) | in(A,B) # label(t2_subset) # label(axiom). [clausify(31)].
% 0.70/1.02 48 element(f2(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(19)].
% 0.70/1.02 49 -in(A,B) | element(A,B) # label(t1_subset) # label(axiom). [clausify(30)].
% 0.70/1.02 Derived: empty(A) | in(f2(A),A). [resolve(47,a,48,a)].
% 0.70/1.02
% 0.70/1.02 ============================== end predicate elimination =============
% 0.70/1.02
% 0.70/1.02 Auto_denials: (non-Horn, no changes).
% 0.70/1.02
% 0.70/1.02 Term ordering decisions:
% 0.70/1.02 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. ordered_pair=1. set_union2=1. unordered_pair=1. f1=1. relation_field=1. relation_dom=1. relation_rng=1. singleton=1. f2=1.
% 0.70/1.02
% 0.70/1.02 ============================== end of process initial clauses ========
% 0.70/1.02
% 0.70/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.02
% 0.70/1.02 ============================== end of clauses for search =============
% 0.70/1.02
% 0.70/1.02 ============================== SEARCH ================================
% 0.70/1.02
% 0.70/1.02 % Starting search at 0.01 seconds.
% 0.70/1.02
% 0.70/1.02 ============================== PROOF =================================
% 0.70/1.02 % SZS status Theorem
% 0.70/1.02 % SZS output start Refutation
% 0.70/1.02
% 0.70/1.02 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.70/1.02 % Length of proof is 34.
% 0.70/1.02 % Level of proof is 8.
% 0.70/1.02 % Maximum clause weight is 19.000.
% 0.70/1.02 % Given clauses 148.
% 0.70/1.02
% 0.70/1.02 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.02 6 (all A (relation(A) -> (all B (is_reflexive_in(A,B) <-> (all C (in(C,B) -> in(ordered_pair(C,C),A))))))) # label(d1_relat_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.02 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.70/1.02 9 (all A (relation(A) -> (reflexive(A) <-> is_reflexive_in(A,relation_field(A))))) # label(d9_relat_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.02 35 -(all A (relation(A) -> (reflexive(A) <-> (all B (in(B,relation_field(A)) -> in(ordered_pair(B,B),A)))))) # label(l1_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/1.02 40 relation(c6) # label(l1_wellord1) # label(negated_conjecture). [clausify(35)].
% 0.70/1.02 41 -relation(A) | -reflexive(A) | is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom). [clausify(9)].
% 0.70/1.02 42 -relation(A) | reflexive(A) | -is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom). [clausify(9)].
% 0.70/1.02 43 -relation(A) | is_reflexive_in(A,B) | in(f1(A,B),B) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 45 -relation(A) | -is_reflexive_in(A,B) | -in(C,B) | in(ordered_pair(C,C),A) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 46 -relation(A) | is_reflexive_in(A,B) | -in(ordered_pair(f1(A,B),f1(A,B)),A) # label(d1_relat_2) # label(axiom). [clausify(6)].
% 0.70/1.02 55 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(4)].
% 0.70/1.02 57 ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) # label(d5_tarski) # label(axiom). [clausify(7)].
% 0.70/1.02 58 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,B)). [copy(57),rewrite([55(4)])].
% 0.70/1.02 64 -reflexive(c6) | -in(ordered_pair(c7,c7),c6) # label(l1_wellord1) # label(negated_conjecture). [clausify(35)].
% 0.70/1.02 65 -reflexive(c6) | -in(unordered_pair(singleton(c7),unordered_pair(c7,c7)),c6). [copy(64),rewrite([58(5)])].
% 0.70/1.02 69 -reflexive(c6) | in(c7,relation_field(c6)) # label(l1_wellord1) # label(negated_conjecture). [clausify(35)].
% 0.70/1.02 71 reflexive(c6) | -in(A,relation_field(c6)) | in(ordered_pair(A,A),c6) # label(l1_wellord1) # label(negated_conjecture). [clausify(35)].
% 0.70/1.02 72 reflexive(c6) | -in(A,relation_field(c6)) | in(unordered_pair(singleton(A),unordered_pair(A,A)),c6). [copy(71),rewrite([58(6)])].
% 0.70/1.02 76 -reflexive(c6) | is_reflexive_in(c6,relation_field(c6)). [resolve(41,a,40,a)].
% 0.70/1.02 80 reflexive(c6) | -is_reflexive_in(c6,relation_field(c6)). [resolve(42,a,40,a)].
% 0.70/1.02 84 is_reflexive_in(c6,A) | in(f1(c6,A),A). [resolve(43,a,40,a)].
% 0.70/1.02 99 -is_reflexive_in(c6,A) | -in(B,A) | in(ordered_pair(B,B),c6). [resolve(45,a,40,a)].
% 0.70/1.02 100 -is_reflexive_in(c6,A) | -in(B,A) | in(unordered_pair(singleton(B),unordered_pair(B,B)),c6). [copy(99),rewrite([58(4)])].
% 0.70/1.02 107 is_reflexive_in(c6,A) | -in(ordered_pair(f1(c6,A),f1(c6,A)),c6). [resolve(46,a,40,a)].
% 0.70/1.02 108 is_reflexive_in(c6,A) | -in(unordered_pair(singleton(f1(c6,A)),unordered_pair(f1(c6,A),f1(c6,A))),c6). [copy(107),rewrite([58(7)])].
% 0.70/1.02 126 in(f1(c6,relation_field(c6)),relation_field(c6)) | reflexive(c6). [resolve(84,a,80,b)].
% 0.70/1.02 179 reflexive(c6) | in(unordered_pair(singleton(f1(c6,relation_field(c6))),unordered_pair(f1(c6,relation_field(c6)),f1(c6,relation_field(c6)))),c6). [resolve(126,a,72,b),merge(b)].
% 0.70/1.02 305 reflexive(c6) | is_reflexive_in(c6,relation_field(c6)). [resolve(179,b,108,b)].
% 0.70/1.02 314 reflexive(c6). [resolve(305,b,80,b),merge(b)].
% 0.70/1.02 315 is_reflexive_in(c6,relation_field(c6)). [back_unit_del(76),unit_del(a,314)].
% 0.70/1.02 316 in(c7,relation_field(c6)). [back_unit_del(69),unit_del(a,314)].
% 0.70/1.02 317 -in(unordered_pair(singleton(c7),unordered_pair(c7,c7)),c6). [back_unit_del(65),unit_del(a,314)].
% 0.70/1.02 324 $F. [ur(100,a,315,a,c,317,a),unit_del(a,316)].
% 0.70/1.02
% 0.70/1.02 % SZS output end Refutation
% 0.70/1.02 ============================== end of proof ==========================
% 0.70/1.02
% 0.70/1.02 ============================== STATISTICS ============================
% 0.70/1.02
% 0.70/1.02 Given=148. Generated=1059. Kept=257. proofs=1.
% 0.70/1.02 Usable=129. Sos=80. Demods=11. Limbo=0, Disabled=115. Hints=0.
% 0.70/1.02 Megabytes=0.48.
% 0.70/1.02 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.70/1.02
% 0.70/1.02 ============================== end of statistics =====================
% 0.70/1.02
% 0.70/1.02 ============================== end of search =========================
% 0.70/1.02
% 0.70/1.02 THEOREM PROVED
% 0.70/1.02 % SZS status Theorem
% 0.70/1.02
% 0.70/1.02 Exiting with 1 proof.
% 0.70/1.02
% 0.70/1.02 Process 26365 exit (max_proofs) Sun Jun 19 23:58:15 2022
% 0.70/1.02 Prover9 interrupted
%------------------------------------------------------------------------------