TSTP Solution File: SEU359+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU359+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:31:14 EDT 2022
% Result : Theorem 0.81s 1.12s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU359+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 09:35:40 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.08 ============================== Prover9 ===============================
% 0.49/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.08 Process 9715 was started by sandbox on n006.cluster.edu,
% 0.49/1.08 Sun Jun 19 09:35:41 2022
% 0.49/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9561_n006.cluster.edu".
% 0.49/1.08 ============================== end of head ===========================
% 0.49/1.08
% 0.49/1.08 ============================== INPUT =================================
% 0.49/1.08
% 0.49/1.08 % Reading from file /tmp/Prover9_9561_n006.cluster.edu
% 0.49/1.08
% 0.49/1.08 set(prolog_style_variables).
% 0.49/1.08 set(auto2).
% 0.49/1.08 % set(auto2) -> set(auto).
% 0.49/1.08 % set(auto) -> set(auto_inference).
% 0.49/1.08 % set(auto) -> set(auto_setup).
% 0.49/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.08 % set(auto) -> set(auto_limits).
% 0.49/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.08 % set(auto) -> set(auto_denials).
% 0.49/1.08 % set(auto) -> set(auto_process).
% 0.49/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.08 % set(auto2) -> assign(stats, some).
% 0.49/1.08 % set(auto2) -> clear(echo_input).
% 0.49/1.08 % set(auto2) -> set(quiet).
% 0.49/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.08 % set(auto2) -> clear(print_given).
% 0.49/1.08 assign(lrs_ticks,-1).
% 0.49/1.08 assign(sos_limit,10000).
% 0.49/1.08 assign(order,kbo).
% 0.49/1.08 set(lex_order_vars).
% 0.49/1.08 clear(print_given).
% 0.49/1.08
% 0.49/1.08 % formulas(sos). % not echoed (11 formulas)
% 0.49/1.08
% 0.49/1.08 ============================== end of input ==========================
% 0.49/1.08
% 0.49/1.08 % From the command line: assign(max_seconds, 300).
% 0.49/1.08
% 0.49/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.08
% 0.49/1.08 % Formulas that are not ordinary clauses:
% 0.49/1.08 1 (all A (rel_str(A) -> (all B all C (element(C,the_carrier(A)) -> (ex_sup_of_relstr_set(A,B) -> (C = join_on_relstr(A,B) <-> relstr_set_smaller(A,B,C) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,B,D) -> related(A,C,D)))))))))) # label(d9_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 2 (all A all B (rel_str(A) -> element(join_on_relstr(A,B),the_carrier(A)))) # label(dt_k1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 3 (all A (rel_str(A) -> one_sorted_str(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 4 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 5 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 6 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 7 (exists A rel_str(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 8 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 9 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 10 (all A (antisymmetric_relstr(A) & rel_str(A) -> (all B (ex_sup_of_relstr_set(A,B) <-> (exists C (element(C,the_carrier(A)) & relstr_set_smaller(A,B,C) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,B,D) -> related(A,C,D)))))))))) # label(t15_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.08 11 -(all A (antisymmetric_relstr(A) & rel_str(A) -> (all B (element(B,the_carrier(A)) -> (all C ((B = join_on_relstr(A,C) & ex_sup_of_relstr_set(A,C) -> relstr_set_smaller(A,C,B) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,C,D) -> related(A,B,D))))) & (relstr_set_smaller(A,C,B) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,C,D) -> related(A,B,D)))) -> B = join_on_relstr(A,C) & ex_sup_of_relstr_set(A,C)))))))) # label(t30_yellow_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.08
% 0.81/1.08 ============================== end of process non-clausal formulas ===
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.08
% 0.81/1.08 ============================== PREDICATE ELIMINATION =================
% 0.81/1.08 12 -rel_str(A) | one_sorted_str(A) # label(dt_l1_orders_2) # label(axiom). [clausify(3)].
% 0.81/1.08 13 rel_str(c1) # label(existence_l1_orders_2) # label(axiom). [clausify(7)].
% 0.81/1.08 14 rel_str(c3) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.08 Derived: one_sorted_str(c1). [resolve(12,a,13,a)].
% 0.81/1.08 Derived: one_sorted_str(c3). [resolve(12,a,14,a)].
% 0.81/1.08 15 -rel_str(A) | element(join_on_relstr(A,B),the_carrier(A)) # label(dt_k1_yellow_0) # label(axiom). [clausify(2)].
% 0.81/1.08 Derived: element(join_on_relstr(c1,A),the_carrier(c1)). [resolve(15,a,13,a)].
% 0.81/1.08 Derived: element(join_on_relstr(c3,A),the_carrier(c3)). [resolve(15,a,14,a)].
% 0.81/1.08 16 -antisymmetric_relstr(A) | -rel_str(A) | -ex_sup_of_relstr_set(A,B) | element(f3(A,B),the_carrier(A)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c1) | -ex_sup_of_relstr_set(c1,A) | element(f3(c1,A),the_carrier(c1)). [resolve(16,b,13,a)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c3) | -ex_sup_of_relstr_set(c3,A) | element(f3(c3,A),the_carrier(c3)). [resolve(16,b,14,a)].
% 0.81/1.08 17 -antisymmetric_relstr(A) | -rel_str(A) | -ex_sup_of_relstr_set(A,B) | relstr_set_smaller(A,B,f3(A,B)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c1) | -ex_sup_of_relstr_set(c1,A) | relstr_set_smaller(c1,A,f3(c1,A)). [resolve(17,b,13,a)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c3) | -ex_sup_of_relstr_set(c3,A) | relstr_set_smaller(c3,A,f3(c3,A)). [resolve(17,b,14,a)].
% 0.81/1.08 18 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) != B | relstr_set_smaller(A,C,B) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.08 Derived: -element(A,the_carrier(c1)) | -ex_sup_of_relstr_set(c1,B) | join_on_relstr(c1,B) != A | relstr_set_smaller(c1,B,A). [resolve(18,a,13,a)].
% 0.81/1.08 Derived: -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) != A | relstr_set_smaller(c3,B,A). [resolve(18,a,14,a)].
% 0.81/1.08 19 -antisymmetric_relstr(A) | -rel_str(A) | -ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | related(A,f3(A,B),C) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c1) | -ex_sup_of_relstr_set(c1,A) | -element(B,the_carrier(c1)) | -relstr_set_smaller(c1,A,B) | related(c1,f3(c1,A),B). [resolve(19,b,13,a)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c3) | -ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | related(c3,f3(c3,A),B). [resolve(19,b,14,a)].
% 0.81/1.08 20 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | element(f4(A,B,C),the_carrier(A)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c1) | ex_sup_of_relstr_set(c1,A) | -element(B,the_carrier(c1)) | -relstr_set_smaller(c1,A,B) | element(f4(c1,A,B),the_carrier(c1)). [resolve(20,b,13,a)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | element(f4(c3,A,B),the_carrier(c3)). [resolve(20,b,14,a)].
% 0.81/1.08 21 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | relstr_set_smaller(A,B,f4(A,B,C)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c1) | ex_sup_of_relstr_set(c1,A) | -element(B,the_carrier(c1)) | -relstr_set_smaller(c1,A,B) | relstr_set_smaller(c1,A,f4(c1,A,B)). [resolve(21,b,13,a)].
% 0.81/1.08 Derived: -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | relstr_set_smaller(c3,A,f4(c3,A,B)). [resolve(21,b,14,a)].
% 0.81/1.08 22 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | -related(A,C,f4(A,B,C)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.12 Derived: -antisymmetric_relstr(c1) | ex_sup_of_relstr_set(c1,A) | -element(B,the_carrier(c1)) | -relstr_set_smaller(c1,A,B) | -related(c1,B,f4(c1,A,B)). [resolve(22,b,13,a)].
% 0.81/1.12 Derived: -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | -related(c3,B,f4(c3,A,B)). [resolve(22,b,14,a)].
% 0.81/1.12 23 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | element(f1(A,C,B),the_carrier(A)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 Derived: -element(A,the_carrier(c1)) | -ex_sup_of_relstr_set(c1,B) | join_on_relstr(c1,B) = A | -relstr_set_smaller(c1,B,A) | element(f1(c1,B,A),the_carrier(c1)). [resolve(23,a,13,a)].
% 0.81/1.12 Derived: -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | element(f1(c3,B,A),the_carrier(c3)). [resolve(23,a,14,a)].
% 0.81/1.12 24 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | relstr_set_smaller(A,C,f1(A,C,B)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 Derived: -element(A,the_carrier(c1)) | -ex_sup_of_relstr_set(c1,B) | join_on_relstr(c1,B) = A | -relstr_set_smaller(c1,B,A) | relstr_set_smaller(c1,B,f1(c1,B,A)). [resolve(24,a,13,a)].
% 0.81/1.12 Derived: -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | relstr_set_smaller(c3,B,f1(c3,B,A)). [resolve(24,a,14,a)].
% 0.81/1.12 25 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | -related(A,B,f1(A,C,B)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 Derived: -element(A,the_carrier(c1)) | -ex_sup_of_relstr_set(c1,B) | join_on_relstr(c1,B) = A | -relstr_set_smaller(c1,B,A) | -related(c1,A,f1(c1,B,A)). [resolve(25,a,13,a)].
% 0.81/1.12 Derived: -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | -related(c3,A,f1(c3,B,A)). [resolve(25,a,14,a)].
% 0.81/1.12 26 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) != B | -element(D,the_carrier(A)) | -relstr_set_smaller(A,C,D) | related(A,B,D) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 Derived: -element(A,the_carrier(c1)) | -ex_sup_of_relstr_set(c1,B) | join_on_relstr(c1,B) != A | -element(C,the_carrier(c1)) | -relstr_set_smaller(c1,B,C) | related(c1,A,C). [resolve(26,a,13,a)].
% 0.81/1.12 Derived: -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) != A | -element(C,the_carrier(c3)) | -relstr_set_smaller(c3,B,C) | related(c3,A,C). [resolve(26,a,14,a)].
% 0.81/1.12
% 0.81/1.12 ============================== end predicate elimination =============
% 0.81/1.12
% 0.81/1.12 Auto_denials: (non-Horn, no changes).
% 0.81/1.12
% 0.81/1.12 Term ordering decisions:
% 0.81/1.12 Function symbol KB weights: c1=1. c3=1. c4=1. c5=1. c6=1. join_on_relstr=1. f3=1. the_carrier=1. f2=1. f1=1. f4=1.
% 0.81/1.12
% 0.81/1.12 ============================== end of process initial clauses ========
% 0.81/1.12
% 0.81/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.12
% 0.81/1.12 ============================== end of clauses for search =============
% 0.81/1.12
% 0.81/1.12 ============================== SEARCH ================================
% 0.81/1.12
% 0.81/1.12 % Starting search at 0.02 seconds.
% 0.81/1.12
% 0.81/1.12 ============================== PROOF =================================
% 0.81/1.12 % SZS status Theorem
% 0.81/1.12 % SZS output start Refutation
% 0.81/1.12
% 0.81/1.12 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.81/1.12 % Length of proof is 95.
% 0.81/1.12 % Level of proof is 45.
% 0.81/1.12 % Maximum clause weight is 26.000.
% 0.81/1.12 % Given clauses 216.
% 0.81/1.12
% 0.81/1.12 1 (all A (rel_str(A) -> (all B all C (element(C,the_carrier(A)) -> (ex_sup_of_relstr_set(A,B) -> (C = join_on_relstr(A,B) <-> relstr_set_smaller(A,B,C) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,B,D) -> related(A,C,D)))))))))) # label(d9_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.12 2 (all A all B (rel_str(A) -> element(join_on_relstr(A,B),the_carrier(A)))) # label(dt_k1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.12 10 (all A (antisymmetric_relstr(A) & rel_str(A) -> (all B (ex_sup_of_relstr_set(A,B) <-> (exists C (element(C,the_carrier(A)) & relstr_set_smaller(A,B,C) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,B,D) -> related(A,C,D)))))))))) # label(t15_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.12 11 -(all A (antisymmetric_relstr(A) & rel_str(A) -> (all B (element(B,the_carrier(A)) -> (all C ((B = join_on_relstr(A,C) & ex_sup_of_relstr_set(A,C) -> relstr_set_smaller(A,C,B) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,C,D) -> related(A,B,D))))) & (relstr_set_smaller(A,C,B) & (all D (element(D,the_carrier(A)) -> (relstr_set_smaller(A,C,D) -> related(A,B,D)))) -> B = join_on_relstr(A,C) & ex_sup_of_relstr_set(A,C)))))))) # label(t30_yellow_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.12 14 rel_str(c3) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 15 -rel_str(A) | element(join_on_relstr(A,B),the_carrier(A)) # label(dt_k1_yellow_0) # label(axiom). [clausify(2)].
% 0.81/1.12 18 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) != B | relstr_set_smaller(A,C,B) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 20 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | element(f4(A,B,C),the_carrier(A)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.12 21 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | relstr_set_smaller(A,B,f4(A,B,C)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.12 22 -antisymmetric_relstr(A) | -rel_str(A) | ex_sup_of_relstr_set(A,B) | -element(C,the_carrier(A)) | -relstr_set_smaller(A,B,C) | -related(A,C,f4(A,B,C)) # label(t15_yellow_0) # label(axiom). [clausify(10)].
% 0.81/1.12 23 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | element(f1(A,C,B),the_carrier(A)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 24 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | relstr_set_smaller(A,C,f1(A,C,B)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 25 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) = B | -relstr_set_smaller(A,C,B) | -related(A,B,f1(A,C,B)) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 26 -rel_str(A) | -element(B,the_carrier(A)) | -ex_sup_of_relstr_set(A,C) | join_on_relstr(A,C) != B | -element(D,the_carrier(A)) | -relstr_set_smaller(A,C,D) | related(A,B,D) # label(d9_yellow_0) # label(axiom). [clausify(1)].
% 0.81/1.12 27 antisymmetric_relstr(c3) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 29 element(c4,the_carrier(c3)) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 30 ex_sup_of_relstr_set(c3,c5) | relstr_set_smaller(c3,c5,c4) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 31 join_on_relstr(c3,c5) = c4 | relstr_set_smaller(c3,c5,c4) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 32 -relstr_set_smaller(c3,c5,c4) | -related(c3,c4,c6) | join_on_relstr(c3,c5) != c4 | -ex_sup_of_relstr_set(c3,c5) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 33 ex_sup_of_relstr_set(c3,c5) | -element(A,the_carrier(c3)) | -relstr_set_smaller(c3,c5,A) | related(c3,c4,A) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 34 -relstr_set_smaller(c3,c5,c4) | element(c6,the_carrier(c3)) | join_on_relstr(c3,c5) != c4 | -ex_sup_of_relstr_set(c3,c5) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 35 -relstr_set_smaller(c3,c5,c4) | relstr_set_smaller(c3,c5,c6) | join_on_relstr(c3,c5) != c4 | -ex_sup_of_relstr_set(c3,c5) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 36 join_on_relstr(c3,c5) = c4 | -element(A,the_carrier(c3)) | -relstr_set_smaller(c3,c5,A) | related(c3,c4,A) # label(t30_yellow_0) # label(negated_conjecture). [clausify(11)].
% 0.81/1.12 41 element(join_on_relstr(c3,A),the_carrier(c3)). [resolve(15,a,14,a)].
% 0.81/1.12 49 -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) != A | relstr_set_smaller(c3,B,A). [resolve(18,a,14,a)].
% 0.81/1.12 54 -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | element(f4(c3,A,B),the_carrier(c3)). [resolve(20,b,14,a)].
% 0.81/1.12 55 ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | element(f4(c3,A,B),the_carrier(c3)). [copy(54),unit_del(a,27)].
% 0.81/1.12 57 -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | relstr_set_smaller(c3,A,f4(c3,A,B)). [resolve(21,b,14,a)].
% 0.81/1.12 58 ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | relstr_set_smaller(c3,A,f4(c3,A,B)). [copy(57),unit_del(a,27)].
% 0.81/1.12 60 -antisymmetric_relstr(c3) | ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | -related(c3,B,f4(c3,A,B)). [resolve(22,b,14,a)].
% 0.81/1.12 61 ex_sup_of_relstr_set(c3,A) | -element(B,the_carrier(c3)) | -relstr_set_smaller(c3,A,B) | -related(c3,B,f4(c3,A,B)). [copy(60),unit_del(a,27)].
% 0.81/1.12 63 -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | element(f1(c3,B,A),the_carrier(c3)). [resolve(23,a,14,a)].
% 0.81/1.12 65 -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | relstr_set_smaller(c3,B,f1(c3,B,A)). [resolve(24,a,14,a)].
% 0.81/1.12 67 -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) = A | -relstr_set_smaller(c3,B,A) | -related(c3,A,f1(c3,B,A)). [resolve(25,a,14,a)].
% 0.81/1.12 69 -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,B) | join_on_relstr(c3,B) != A | -element(C,the_carrier(c3)) | -relstr_set_smaller(c3,B,C) | related(c3,A,C). [resolve(26,a,14,a)].
% 0.81/1.12 80 ex_sup_of_relstr_set(c3,c5) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(55,c,30,b),merge(d),unit_del(b,29)].
% 0.81/1.12 82 ex_sup_of_relstr_set(c3,c5) | relstr_set_smaller(c3,c5,f4(c3,c5,c4)). [resolve(58,c,30,b),merge(d),unit_del(b,29)].
% 0.81/1.12 83 -ex_sup_of_relstr_set(c3,c5) | join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)). [resolve(63,d,31,b),merge(e),unit_del(a,29)].
% 0.81/1.12 84 -ex_sup_of_relstr_set(c3,c5) | join_on_relstr(c3,c5) = c4 | relstr_set_smaller(c3,c5,f1(c3,c5,c4)). [resolve(65,d,31,b),merge(e),unit_del(a,29)].
% 0.81/1.12 86 element(f4(c3,c5,c4),the_carrier(c3)) | -element(A,the_carrier(c3)) | join_on_relstr(c3,c5) != A | relstr_set_smaller(c3,c5,A). [resolve(80,a,49,b)].
% 0.81/1.12 94 ex_sup_of_relstr_set(c3,c5) | -element(f4(c3,c5,c4),the_carrier(c3)) | related(c3,c4,f4(c3,c5,c4)). [resolve(82,b,33,c),merge(b)].
% 0.81/1.12 104 join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(83,a,80,a)].
% 0.81/1.12 105 join_on_relstr(c3,c5) = c4 | relstr_set_smaller(c3,c5,f1(c3,c5,c4)) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(84,a,80,a)].
% 0.81/1.12 125 element(f4(c3,c5,c4),the_carrier(c3)) | join_on_relstr(c3,c5) != join_on_relstr(c3,A) | relstr_set_smaller(c3,c5,join_on_relstr(c3,A)). [resolve(86,b,41,a)].
% 0.81/1.12 129 join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5) | related(c3,c4,f4(c3,c5,c4)). [resolve(104,c,94,b)].
% 0.81/1.12 138 join_on_relstr(c3,c5) = c4 | element(f4(c3,c5,c4),the_carrier(c3)) | -element(f1(c3,c5,c4),the_carrier(c3)) | related(c3,c4,f1(c3,c5,c4)). [resolve(105,b,36,c),merge(c)].
% 0.81/1.12 142 element(f4(c3,c5,c4),the_carrier(c3)) | relstr_set_smaller(c3,c5,join_on_relstr(c3,c5)). [xx_res(125,b)].
% 0.81/1.12 151 join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(129,d,61,d),merge(d),unit_del(d,29)].
% 0.81/1.12 152 join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5). [resolve(151,d,31,b),merge(d)].
% 0.81/1.12 156 join_on_relstr(c3,c5) = c4 | element(f1(c3,c5,c4),the_carrier(c3)). [resolve(152,c,83,a),merge(c),merge(d)].
% 0.81/1.12 186 join_on_relstr(c3,c5) = c4 | element(f4(c3,c5,c4),the_carrier(c3)) | related(c3,c4,f1(c3,c5,c4)). [resolve(138,c,156,b),merge(d)].
% 0.81/1.12 187 join_on_relstr(c3,c5) = c4 | element(f4(c3,c5,c4),the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(186,c,67,e),merge(e),unit_del(c,29)].
% 0.81/1.12 189 join_on_relstr(c3,c5) = c4 | element(f4(c3,c5,c4),the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5). [resolve(187,d,31,b),merge(d)].
% 0.81/1.12 190 join_on_relstr(c3,c5) = c4 | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(189,c,80,a),merge(c)].
% 0.81/1.12 191 join_on_relstr(c3,c5) = c4 | ex_sup_of_relstr_set(c3,c5) | related(c3,c4,f4(c3,c5,c4)). [resolve(190,b,94,b)].
% 0.81/1.12 194 join_on_relstr(c3,c5) = c4 | ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(191,c,61,d),merge(c),unit_del(c,29)].
% 0.81/1.12 195 join_on_relstr(c3,c5) = c4 | ex_sup_of_relstr_set(c3,c5). [resolve(194,c,31,b),merge(c)].
% 0.81/1.12 197 join_on_relstr(c3,c5) = c4 | relstr_set_smaller(c3,c5,f1(c3,c5,c4)). [resolve(195,b,84,a),merge(b)].
% 0.81/1.12 217 join_on_relstr(c3,c5) = c4 | -element(f1(c3,c5,c4),the_carrier(c3)) | related(c3,c4,f1(c3,c5,c4)). [resolve(197,b,36,c),merge(b)].
% 0.81/1.12 240 join_on_relstr(c3,c5) = c4 | related(c3,c4,f1(c3,c5,c4)). [resolve(217,b,156,b),merge(c)].
% 0.81/1.12 241 join_on_relstr(c3,c5) = c4 | -ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(240,b,67,e),merge(d),unit_del(b,29)].
% 0.81/1.12 242 join_on_relstr(c3,c5) = c4 | -ex_sup_of_relstr_set(c3,c5). [resolve(241,c,31,b),merge(c)].
% 0.81/1.12 243 join_on_relstr(c3,c5) = c4. [resolve(242,b,195,b),merge(b)].
% 0.81/1.12 264 element(f4(c3,c5,c4),the_carrier(c3)) | relstr_set_smaller(c3,c5,c4). [back_rewrite(142),rewrite([243(12)])].
% 0.81/1.12 268 -relstr_set_smaller(c3,c5,c4) | relstr_set_smaller(c3,c5,c6) | -ex_sup_of_relstr_set(c3,c5). [back_rewrite(35),rewrite([243(11)]),xx(c)].
% 0.81/1.12 269 -relstr_set_smaller(c3,c5,c4) | element(c6,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5). [back_rewrite(34),rewrite([243(11)]),xx(c)].
% 0.81/1.12 270 -relstr_set_smaller(c3,c5,c4) | -related(c3,c4,c6) | -ex_sup_of_relstr_set(c3,c5). [back_rewrite(32),rewrite([243(11)]),xx(c)].
% 0.81/1.12 273 relstr_set_smaller(c3,c5,c6) | -ex_sup_of_relstr_set(c3,c5) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(268,a,264,b)].
% 0.81/1.12 274 element(c6,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(269,a,264,b)].
% 0.81/1.12 275 relstr_set_smaller(c3,c5,c6) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(273,b,80,a),merge(c)].
% 0.81/1.12 277 element(f4(c3,c5,c4),the_carrier(c3)) | -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5) | c4 != A | -element(c6,the_carrier(c3)) | related(c3,A,c6). [resolve(275,a,69,e),rewrite([243(16)])].
% 0.81/1.12 281 element(c6,the_carrier(c3)) | element(f4(c3,c5,c4),the_carrier(c3)). [resolve(274,b,80,a),merge(c)].
% 0.81/1.12 282 element(c6,the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5) | related(c3,c4,f4(c3,c5,c4)). [resolve(281,b,94,b)].
% 0.81/1.12 285 element(c6,the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(282,c,61,d),merge(c),unit_del(c,29)].
% 0.81/1.12 286 element(c6,the_carrier(c3)) | ex_sup_of_relstr_set(c3,c5). [resolve(285,c,30,b),merge(c)].
% 0.81/1.12 287 element(c6,the_carrier(c3)) | -element(A,the_carrier(c3)) | c4 != A | relstr_set_smaller(c3,c5,A). [resolve(286,b,49,b),rewrite([243(10)])].
% 0.81/1.12 301 element(c6,the_carrier(c3)) | relstr_set_smaller(c3,c5,c4). [resolve(287,b,29,a),xx(b)].
% 0.81/1.12 304 element(c6,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5). [resolve(301,b,269,a),merge(b)].
% 0.81/1.12 309 element(c6,the_carrier(c3)). [resolve(304,b,286,b),merge(b)].
% 0.81/1.12 313 element(f4(c3,c5,c4),the_carrier(c3)) | -element(A,the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5) | c4 != A | related(c3,A,c6). [back_unit_del(277),unit_del(e,309)].
% 0.81/1.12 345 element(f4(c3,c5,c4),the_carrier(c3)) | -element(A,the_carrier(c3)) | c4 != A | related(c3,A,c6). [resolve(313,c,80,a),merge(e)].
% 0.81/1.12 349 element(f4(c3,c5,c4),the_carrier(c3)) | related(c3,c4,c6). [resolve(345,b,29,a),xx(b)].
% 0.81/1.12 351 element(f4(c3,c5,c4),the_carrier(c3)) | -relstr_set_smaller(c3,c5,c4) | -ex_sup_of_relstr_set(c3,c5). [resolve(349,b,270,b)].
% 0.81/1.12 353 element(f4(c3,c5,c4),the_carrier(c3)) | -ex_sup_of_relstr_set(c3,c5). [resolve(351,b,264,b),merge(c)].
% 0.81/1.12 354 element(f4(c3,c5,c4),the_carrier(c3)). [resolve(353,b,80,a),merge(b)].
% 0.81/1.12 355 ex_sup_of_relstr_set(c3,c5) | related(c3,c4,f4(c3,c5,c4)). [back_unit_del(94),unit_del(b,354)].
% 0.81/1.12 362 ex_sup_of_relstr_set(c3,c5) | -relstr_set_smaller(c3,c5,c4). [resolve(355,b,61,d),merge(b),unit_del(b,29)].
% 0.81/1.12 363 ex_sup_of_relstr_set(c3,c5). [resolve(362,b,30,b),merge(b)].
% 0.81/1.12 368 -relstr_set_smaller(c3,c5,c4) | -related(c3,c4,c6). [back_unit_del(270),unit_del(c,363)].
% 0.81/1.12 369 -relstr_set_smaller(c3,c5,c4) | relstr_set_smaller(c3,c5,c6). [back_unit_del(268),unit_del(c,363)].
% 0.81/1.12 370 -element(A,the_carrier(c3)) | c4 != A | relstr_set_smaller(c3,c5,A). [resolve(363,a,49,b),rewrite([243(6)])].
% 0.81/1.12 380 relstr_set_smaller(c3,c5,c4). [resolve(370,a,29,a),xx(a)].
% 0.81/1.12 382 relstr_set_smaller(c3,c5,c6). [back_unit_del(369),unit_del(a,380)].
% 0.81/1.12 383 -related(c3,c4,c6). [back_unit_del(368),unit_del(a,380)].
% 0.81/1.12 389 $F. [ur(69,a,29,a,b,363,a,c,243,a,d,309,a,f,383,a),unit_del(a,382)].
% 0.81/1.12
% 0.81/1.12 % SZS output end Refutation
% 0.81/1.12 ============================== end of proof ==========================
% 0.81/1.12
% 0.81/1.12 ============================== STATISTICS ============================
% 0.81/1.12
% 0.81/1.12 Given=216. Generated=576. Kept=356. proofs=1.
% 0.81/1.12 Usable=39. Sos=12. Demods=1. Limbo=0, Disabled=360. Hints=0.
% 0.81/1.12 Megabytes=0.40.
% 0.81/1.12 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.81/1.12
% 0.81/1.12 ============================== end of statistics =====================
% 0.81/1.12
% 0.81/1.12 ============================== end of search =========================
% 0.81/1.12
% 0.81/1.12 THEOREM PROVED
% 0.81/1.12 % SZS status Theorem
% 0.81/1.12
% 0.81/1.12 Exiting with 1 proof.
% 0.81/1.12
% 0.81/1.12 Process 9715 exit (max_proofs) Sun Jun 19 09:35:41 2022
% 0.81/1.12 Prover9 interrupted
%------------------------------------------------------------------------------