TSTP Solution File: SEU244+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU244+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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 : 300s
% DateTime : Wed Jul 27 13:15:19 EDT 2022
% Result : Theorem 1.69s 1.91s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 25
% Syntax : Number of clauses : 48 ( 14 unt; 11 nHn; 48 RR)
% Number of literals : 112 ( 0 equ; 54 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ relation(A)
| ~ antisymmetric(A)
| is_antisymmetric_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ relation(A)
| antisymmetric(A)
| ~ is_antisymmetric_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ relation(A)
| ~ connected(A)
| is_connected_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ relation(A)
| connected(A)
| ~ is_connected_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ relation(A)
| ~ transitive(A)
| is_transitive_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ relation(A)
| transitive(A)
| ~ is_transitive_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ relation(A)
| ~ well_ordering(A)
| reflexive(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ relation(A)
| ~ well_ordering(A)
| transitive(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ relation(A)
| ~ well_ordering(A)
| antisymmetric(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ relation(A)
| ~ well_ordering(A)
| connected(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ relation(A)
| ~ well_ordering(A)
| well_founded_relation(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ relation(A)
| well_ordering(A)
| ~ reflexive(A)
| ~ transitive(A)
| ~ antisymmetric(A)
| ~ connected(A)
| ~ well_founded_relation(A) ),
file('SEU244+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ relation(A)
| ~ well_orders(A,B)
| is_reflexive_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ relation(A)
| ~ well_orders(A,B)
| is_transitive_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ relation(A)
| ~ well_orders(A,B)
| is_antisymmetric_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ relation(A)
| ~ well_orders(A,B)
| is_connected_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ relation(A)
| ~ well_orders(A,B)
| is_well_founded_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ relation(A)
| well_orders(A,B)
| ~ is_reflexive_in(A,B)
| ~ is_transitive_in(A,B)
| ~ is_antisymmetric_in(A,B)
| ~ is_connected_in(A,B)
| ~ is_well_founded_in(A,B) ),
file('SEU244+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ relation(A)
| ~ reflexive(A)
| is_reflexive_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ relation(A)
| reflexive(A)
| ~ is_reflexive_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ relation(A)
| ~ well_founded_relation(A)
| is_well_founded_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ relation(A)
| well_founded_relation(A)
| ~ is_well_founded_in(A,relation_field(A)) ),
file('SEU244+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ well_orders(dollar_c1,relation_field(dollar_c1))
| ~ well_ordering(dollar_c1) ),
file('SEU244+1.p',unknown),
[] ).
cnf(30,axiom,
relation(dollar_c1),
file('SEU244+1.p',unknown),
[] ).
cnf(31,axiom,
( well_orders(dollar_c1,relation_field(dollar_c1))
| well_ordering(dollar_c1) ),
file('SEU244+1.p',unknown),
[] ).
cnf(34,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| well_founded_relation(dollar_c1) ),
inference(hyper,[status(thm)],[31,11,30]),
[iquote('hyper,31,11,30')] ).
cnf(35,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| connected(dollar_c1) ),
inference(hyper,[status(thm)],[31,10,30]),
[iquote('hyper,31,10,30')] ).
cnf(36,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| antisymmetric(dollar_c1) ),
inference(hyper,[status(thm)],[31,9,30]),
[iquote('hyper,31,9,30')] ).
cnf(37,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| transitive(dollar_c1) ),
inference(hyper,[status(thm)],[31,8,30]),
[iquote('hyper,31,8,30')] ).
cnf(38,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| reflexive(dollar_c1) ),
inference(hyper,[status(thm)],[31,7,30]),
[iquote('hyper,31,7,30')] ).
cnf(39,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| is_well_founded_in(dollar_c1,relation_field(dollar_c1)) ),
inference(hyper,[status(thm)],[34,23,30]),
[iquote('hyper,34,23,30')] ).
cnf(41,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| is_connected_in(dollar_c1,relation_field(dollar_c1)) ),
inference(hyper,[status(thm)],[35,3,30]),
[iquote('hyper,35,3,30')] ).
cnf(42,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| is_antisymmetric_in(dollar_c1,relation_field(dollar_c1)) ),
inference(hyper,[status(thm)],[36,1,30]),
[iquote('hyper,36,1,30')] ).
cnf(43,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| is_transitive_in(dollar_c1,relation_field(dollar_c1)) ),
inference(hyper,[status(thm)],[37,5,30]),
[iquote('hyper,37,5,30')] ).
cnf(44,plain,
( well_orders(dollar_c1,relation_field(dollar_c1))
| is_reflexive_in(dollar_c1,relation_field(dollar_c1)) ),
inference(hyper,[status(thm)],[38,21,30]),
[iquote('hyper,38,21,30')] ).
cnf(47,plain,
is_well_founded_in(dollar_c1,relation_field(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[39,17,30])]),
[iquote('hyper,39,17,30,factor_simp')] ).
cnf(48,plain,
well_founded_relation(dollar_c1),
inference(hyper,[status(thm)],[47,24,30]),
[iquote('hyper,47,24,30')] ).
cnf(49,plain,
is_connected_in(dollar_c1,relation_field(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[41,16,30])]),
[iquote('hyper,41,16,30,factor_simp')] ).
cnf(50,plain,
connected(dollar_c1),
inference(hyper,[status(thm)],[49,4,30]),
[iquote('hyper,49,4,30')] ).
cnf(51,plain,
is_antisymmetric_in(dollar_c1,relation_field(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[42,15,30])]),
[iquote('hyper,42,15,30,factor_simp')] ).
cnf(52,plain,
antisymmetric(dollar_c1),
inference(hyper,[status(thm)],[51,2,30]),
[iquote('hyper,51,2,30')] ).
cnf(53,plain,
is_transitive_in(dollar_c1,relation_field(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[43,14,30])]),
[iquote('hyper,43,14,30,factor_simp')] ).
cnf(54,plain,
transitive(dollar_c1),
inference(hyper,[status(thm)],[53,6,30]),
[iquote('hyper,53,6,30')] ).
cnf(55,plain,
is_reflexive_in(dollar_c1,relation_field(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[44,13,30])]),
[iquote('hyper,44,13,30,factor_simp')] ).
cnf(56,plain,
reflexive(dollar_c1),
inference(hyper,[status(thm)],[55,22,30]),
[iquote('hyper,55,22,30')] ).
cnf(57,plain,
well_orders(dollar_c1,relation_field(dollar_c1)),
inference(hyper,[status(thm)],[55,18,30,53,51,49,47]),
[iquote('hyper,55,18,30,53,51,49,47')] ).
cnf(58,plain,
well_ordering(dollar_c1),
inference(hyper,[status(thm)],[56,12,30,54,52,50,48]),
[iquote('hyper,56,12,30,54,52,50,48')] ).
cnf(59,plain,
$false,
inference(hyper,[status(thm)],[57,25,58]),
[iquote('hyper,57,25,58')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU244+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:02:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n014.cluster.edu,
% 1.69/1.90 Wed Jul 27 08:02:24 2022
% 1.69/1.90 The command was "./otter". The process ID is 3409.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 formula_list(usable).
% 1.69/1.90 all A (A=A).
% 1.69/1.90 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.69/1.90 all A (relation(A)-> (antisymmetric(A)<->is_antisymmetric_in(A,relation_field(A)))).
% 1.69/1.90 all A (relation(A)-> (connected(A)<->is_connected_in(A,relation_field(A)))).
% 1.69/1.90 all A (relation(A)-> (transitive(A)<->is_transitive_in(A,relation_field(A)))).
% 1.69/1.90 all A (relation(A)-> (well_ordering(A)<->reflexive(A)&transitive(A)&antisymmetric(A)&connected(A)&well_founded_relation(A))).
% 1.69/1.90 all A (relation(A)-> (all B (well_orders(A,B)<->is_reflexive_in(A,B)&is_transitive_in(A,B)&is_antisymmetric_in(A,B)&is_connected_in(A,B)&is_well_founded_in(A,B)))).
% 1.69/1.90 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 1.69/1.90 all A (relation(A)-> (reflexive(A)<->is_reflexive_in(A,relation_field(A)))).
% 1.69/1.90 $T.
% 1.69/1.90 $T.
% 1.69/1.90 $T.
% 1.69/1.90 $T.
% 1.69/1.90 all A B (set_union2(A,A)=A).
% 1.69/1.90 all A (relation(A)-> (well_founded_relation(A)<->is_well_founded_in(A,relation_field(A)))).
% 1.69/1.90 -(all A (relation(A)-> (well_orders(A,relation_field(A))<->well_ordering(A)))).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 -------> usable clausifies to:
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] A=A.
% 1.69/1.90 0 [] set_union2(A,B)=set_union2(B,A).
% 1.69/1.90 0 [] -relation(A)| -antisymmetric(A)|is_antisymmetric_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)|antisymmetric(A)| -is_antisymmetric_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)| -connected(A)|is_connected_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)|connected(A)| -is_connected_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)| -transitive(A)|is_transitive_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)|transitive(A)| -is_transitive_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 1.69/1.90 0 [] -relation(A)| -well_ordering(A)|transitive(A).
% 1.69/1.90 0 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 1.69/1.90 0 [] -relation(A)| -well_ordering(A)|connected(A).
% 1.69/1.90 0 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 1.69/1.90 0 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 1.69/1.90 0 [] -relation(A)| -well_orders(A,B)|is_reflexive_in(A,B).
% 1.69/1.90 0 [] -relation(A)| -well_orders(A,B)|is_transitive_in(A,B).
% 1.69/1.90 0 [] -relation(A)| -well_orders(A,B)|is_antisymmetric_in(A,B).
% 1.69/1.90 0 [] -relation(A)| -well_orders(A,B)|is_connected_in(A,B).
% 1.69/1.90 0 [] -relation(A)| -well_orders(A,B)|is_well_founded_in(A,B).
% 1.69/1.90 0 [] -relation(A)|well_orders(A,B)| -is_reflexive_in(A,B)| -is_transitive_in(A,B)| -is_antisymmetric_in(A,B)| -is_connected_in(A,B)| -is_well_founded_in(A,B).
% 1.69/1.90 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 1.69/1.90 0 [] -relation(A)| -reflexive(A)|is_reflexive_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)|reflexive(A)| -is_reflexive_in(A,relation_field(A)).
% 1.69/1.90 0 [] $T.
% 1.69/1.90 0 [] $T.
% 1.69/1.90 0 [] $T.
% 1.69/1.90 0 [] $T.
% 1.69/1.90 0 [] set_union2(A,A)=A.
% 1.69/1.90 0 [] -relation(A)| -well_founded_relation(A)|is_well_founded_in(A,relation_field(A)).
% 1.69/1.90 0 [] -relation(A)|well_founded_relation(A)| -is_well_founded_in(A,relation_field(A)).
% 1.69/1.90 0 [] relation($c1).
% 1.69/1.90 0 [] well_orders($c1,relation_field($c1))|well_ordering($c1).
% 1.69/1.90 0 [] -well_orders($c1,relation_field($c1))| -well_ordering($c1).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.69/1.90
% 1.69/1.90 This ia a non-Horn set with equality. The strategy will be
% 1.69/1.90 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.69/1.90 deletion, with positive clauses in sos and nonpositive
% 1.69/1.90 clauses in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(knuth_bendix).
% 1.69/1.90 dependent: set(anl_eq).
% 1.69/1.90 dependent: set(para_from).
% 1.69/1.90 dependent: set(para_into).
% 1.69/1.90 dependent: clear(para_from_right).
% 1.69/1.90 dependent: clear(para_into_right).
% 1.69/1.91 dependent: set(para_from_vars).
% 1.69/1.91 dependent: set(eq_units_both_ways).
% 1.69/1.91 dependent: set(dynamic_demod_all).
% 1.69/1.91 dependent: set(dynamic_demod).
% 1.69/1.91 dependent: set(order_eq).
% 1.69/1.91 dependent: set(back_demod).
% 1.69/1.91 dependent: set(lrpo).
% 1.69/1.91 dependent: set(hyper_res).
% 1.69/1.91 dependent: set(unit_deletion).
% 1.69/1.91 dependent: set(factor).
% 1.69/1.91
% 1.69/1.91 ------------> process usable:
% 1.69/1.91 ** KEPT (pick-wt=8): 1 [] -relation(A)| -antisymmetric(A)|is_antisymmetric_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 2 [] -relation(A)|antisymmetric(A)| -is_antisymmetric_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 3 [] -relation(A)| -connected(A)|is_connected_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 4 [] -relation(A)|connected(A)| -is_connected_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 5 [] -relation(A)| -transitive(A)|is_transitive_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 6 [] -relation(A)|transitive(A)| -is_transitive_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=6): 7 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 1.69/1.91 ** KEPT (pick-wt=6): 8 [] -relation(A)| -well_ordering(A)|transitive(A).
% 1.69/1.91 ** KEPT (pick-wt=6): 9 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 1.69/1.91 ** KEPT (pick-wt=6): 10 [] -relation(A)| -well_ordering(A)|connected(A).
% 1.69/1.91 ** KEPT (pick-wt=6): 11 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 1.69/1.91 ** KEPT (pick-wt=14): 12 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 1.69/1.91 ** KEPT (pick-wt=8): 13 [] -relation(A)| -well_orders(A,B)|is_reflexive_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=8): 14 [] -relation(A)| -well_orders(A,B)|is_transitive_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=8): 15 [] -relation(A)| -well_orders(A,B)|is_antisymmetric_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=8): 16 [] -relation(A)| -well_orders(A,B)|is_connected_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=8): 17 [] -relation(A)| -well_orders(A,B)|is_well_founded_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=20): 18 [] -relation(A)|well_orders(A,B)| -is_reflexive_in(A,B)| -is_transitive_in(A,B)| -is_antisymmetric_in(A,B)| -is_connected_in(A,B)| -is_well_founded_in(A,B).
% 1.69/1.91 ** KEPT (pick-wt=10): 20 [copy,19,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 1.69/1.91 ** KEPT (pick-wt=8): 21 [] -relation(A)| -reflexive(A)|is_reflexive_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 22 [] -relation(A)|reflexive(A)| -is_reflexive_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 23 [] -relation(A)| -well_founded_relation(A)|is_well_founded_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=8): 24 [] -relation(A)|well_founded_relation(A)| -is_well_founded_in(A,relation_field(A)).
% 1.69/1.91 ** KEPT (pick-wt=6): 25 [] -well_orders($c1,relation_field($c1))| -well_ordering($c1).
% 1.69/1.91
% 1.69/1.91 ------------> process sos:
% 1.69/1.91 ** KEPT (pick-wt=3): 26 [] A=A.
% 1.69/1.91 ** KEPT (pick-wt=7): 27 [] set_union2(A,B)=set_union2(B,A).
% 1.69/1.91 ** KEPT (pick-wt=5): 28 [] set_union2(A,A)=A.
% 1.69/1.91 ---> New Demodulator: 29 [new_demod,28] set_union2(A,A)=A.
% 1.69/1.91 ** KEPT (pick-wt=2): 30 [] relation($c1).
% 1.69/1.91 ** KEPT (pick-wt=6): 31 [] well_orders($c1,relation_field($c1))|well_ordering($c1).
% 1.69/1.91 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] A=A.
% 1.69/1.91 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.69/1.91 >>>> Starting back demodulation with 29.
% 1.69/1.91
% 1.69/1.91 ======= end of input processing =======
% 1.69/1.91
% 1.69/1.91 =========== start of search ===========
% 1.69/1.91
% 1.69/1.91 -------- PROOF --------
% 1.69/1.91
% 1.69/1.91 -----> EMPTY CLAUSE at 0.00 sec ----> 59 [hyper,57,25,58] $F.
% 1.69/1.91
% 1.69/1.91 Length of proof is 22. Level of proof is 5.
% 1.69/1.91
% 1.69/1.91 ---------------- PROOF ----------------
% 1.69/1.91 % SZS status Theorem
% 1.69/1.91 % SZS output start Refutation
% See solution above
% 1.69/1.91 ------------ end of proof -------------
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91 ============ end of search ============
% 1.69/1.91
% 1.69/1.91 -------------- statistics -------------
% 1.69/1.91 clauses given 30
% 1.69/1.91 clauses generated 89
% 1.69/1.91 clauses kept 54
% 1.69/1.91 clauses forward subsumed 65
% 1.69/1.91 clauses back subsumed 11
% 1.69/1.91 Kbytes malloced 976
% 1.69/1.91
% 1.69/1.91 ----------- times (seconds) -----------
% 1.69/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.91
% 1.69/1.91 That finishes the proof of the theorem.
% 1.69/1.91
% 1.69/1.91 Process 3409 finished Wed Jul 27 08:02:25 2022
% 1.69/1.91 Otter interrupted
% 1.69/1.91 PROOF FOUND
%------------------------------------------------------------------------------