TSTP Solution File: GEO124-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 12:54:28 EDT 2022
% Result : Unsatisfiable 14.21s 14.42s
% Output : Refutation 14.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 12 unt; 1 nHn; 16 RR)
% Number of literals : 25 ( 5 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(42,axiom,
( ~ between_c(A,B,C,D)
| B != D ),
file('GEO124-1.p',unknown),
[] ).
cnf(53,axiom,
( ~ ordered_by(A,B,C)
| ~ ordered_by(A,C,D)
| between_o(A,D,C,B) ),
file('GEO124-1.p',unknown),
[] ).
cnf(54,axiom,
( ~ start_point(A,B)
| incident_o(A,B) ),
file('GEO124-1.p',unknown),
[] ).
cnf(55,axiom,
( ~ start_point(A,B)
| A = C
| ~ incident_o(C,B)
| ordered_by(B,A,C) ),
file('GEO124-1.p',unknown),
[] ).
cnf(72,axiom,
( ~ between_o(A,B,C,D)
| between_c(ax2_sk4(A,D,C,B),B,C,D) ),
file('GEO124-1.p',unknown),
[] ).
cnf(82,axiom,
sk26 != sk27,
file('GEO124-1.p',unknown),
[] ).
cnf(83,plain,
sk27 != sk26,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[82])]),
[iquote('copy,82,flip.1')] ).
cnf(106,axiom,
A = A,
file('GEO124-1.p',unknown),
[] ).
cnf(116,axiom,
start_point(sk26,sk25),
file('GEO124-1.p',unknown),
[] ).
cnf(117,axiom,
start_point(sk27,sk25),
file('GEO124-1.p',unknown),
[] ).
cnf(141,plain,
incident_o(sk26,sk25),
inference(hyper,[status(thm)],[116,54]),
[iquote('hyper,116,54')] ).
cnf(180,plain,
incident_o(sk27,sk25),
inference(hyper,[status(thm)],[117,54]),
[iquote('hyper,117,54')] ).
cnf(222,plain,
ordered_by(sk25,sk27,sk26),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[141,55,117]),83]),
[iquote('hyper,141,55,117,unit_del,83')] ).
cnf(284,plain,
ordered_by(sk25,sk26,sk27),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[180,55,116]),83]),
[iquote('hyper,180,55,116,unit_del,83')] ).
cnf(1507,plain,
between_o(sk25,sk27,sk26,sk27),
inference(hyper,[status(thm)],[284,53,222]),
[iquote('hyper,284,53,222')] ).
cnf(1535,plain,
between_c(ax2_sk4(sk25,sk27,sk26,sk27),sk27,sk26,sk27),
inference(hyper,[status(thm)],[1507,72]),
[iquote('hyper,1507,72')] ).
cnf(1692,plain,
$false,
inference(hyper,[status(thm)],[1535,42,106]),
[iquote('hyper,1535,42,106')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 06:59:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.23/3.42 ----- Otter 3.3f, August 2004 -----
% 3.23/3.42 The process was started by sandbox on n010.cluster.edu,
% 3.23/3.42 Wed Jul 27 06:59:25 2022
% 3.23/3.42 The command was "./otter". The process ID is 24405.
% 3.23/3.42
% 3.23/3.42 set(prolog_style_variables).
% 3.23/3.42 set(auto).
% 3.23/3.42 dependent: set(auto1).
% 3.23/3.42 dependent: set(process_input).
% 3.23/3.42 dependent: clear(print_kept).
% 3.23/3.42 dependent: clear(print_new_demod).
% 3.23/3.42 dependent: clear(print_back_demod).
% 3.23/3.42 dependent: clear(print_back_sub).
% 3.23/3.42 dependent: set(control_memory).
% 3.23/3.42 dependent: assign(max_mem, 12000).
% 3.23/3.42 dependent: assign(pick_given_ratio, 4).
% 3.23/3.42 dependent: assign(stats_level, 1).
% 3.23/3.42 dependent: assign(max_seconds, 10800).
% 3.23/3.42 clear(print_given).
% 3.23/3.42
% 3.23/3.42 list(usable).
% 3.23/3.42 0 [] A=A.
% 3.23/3.42 0 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 3.23/3.42 0 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 3.23/3.42 0 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 3.23/3.42 0 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 3.23/3.42 0 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 3.23/3.42 0 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 3.23/3.42 0 [] incident_c(ax0_sk2(A,B,C),C)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 3.23/3.42 0 [] incident_c(ax0_sk2(A,B,C),C)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.23/3.42 0 [] -incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 3.23/3.42 0 [] -incident_c(ax0_sk2(A,B,C),A)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 3.23/3.42 0 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.23/3.42 0 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.23/3.42 0 [] -end_point(A,B)|incident_c(A,B).
% 3.23/3.42 0 [] -end_point(A,B)| -part_of(C,B)| -part_of(D,B)| -incident_c(A,C)| -incident_c(A,D)|part_of(C,D)|part_of(D,C).
% 3.23/3.42 0 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 3.23/3.42 0 [] -inner_point(A,B)|incident_c(A,B).
% 3.23/3.42 0 [] -inner_point(A,B)| -end_point(A,B).
% 3.23/3.42 0 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 3.23/3.42 0 [] -meet(A,B,C)|incident_c(A,B).
% 3.23/3.42 0 [] -meet(A,B,C)|incident_c(A,C).
% 3.23/3.42 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 3.23/3.42 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 3.23/3.42 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 3.23/3.42 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 3.23/3.42 0 [] -incident_c(A,B)| -incident_c(A,C)| -end_point(ax0_sk5(C,B,A),B)| -end_point(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 3.23/3.42 0 [] -closed(A)| -end_point(B,A).
% 3.23/3.42 0 [] end_point(ax0_sk6(A),A)|closed(A).
% 3.23/3.42 0 [] -open(A)|end_point(ax0_sk7(A),A).
% 3.23/3.42 0 [] -end_point(A,B)|open(B).
% 3.23/3.42 0 [] -part_of(A,B)|A=B|open(A).
% 3.23/3.42 0 [] -part_of(A,B)| -part_of(C,B)| -part_of(D,B)| -end_point(E,A)| -end_point(E,C)| -end_point(E,D)|part_of(C,D)|part_of(D,C)|part_of(A,C)|part_of(C,A)|part_of(A,D)|part_of(D,A).
% 3.23/3.42 0 [] inner_point(ax0_sk8(A),A).
% 3.23/3.42 0 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.23/3.42 0 [] -inner_point(A,B)|B=sum(ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.23/3.42 0 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 3.23/3.42 0 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 3.23/3.42 0 [] -end_point(A,B)|A!=ax0_sk11(A,B).
% 3.23/3.42 0 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 3.23/3.42 0 [] -meet(A,B,C)|ax0_sk12(C,B)=sum(B,C).
% 3.23/3.42 0 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 3.23/3.42 0 [] incident_c(ax0_sk13(A,B),B)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.23/3.42 0 [] -incident_c(ax0_sk13(A,B),A)|incident_c(ax0_sk13(A,B),A)|B=A.
% 3.23/3.42 0 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.23/3.42 0 [] -between_c(A,B,C,D)|B!=D.
% 3.23/3.42 0 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 3.23/3.42 0 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 3.23/3.42 0 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 3.23/3.42 0 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 3.23/3.42 0 [] A=B| -part_of(C,D)| -end_point(A,C)| -end_point(B,C)| -inner_point(E,C)|between_c(D,A,E,B).
% 3.23/3.43 0 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,D,C).
% 3.23/3.43 0 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,C,B).
% 3.23/3.43 0 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,D,C).
% 3.23/3.43 0 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,C,B).
% 3.23/3.43 0 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,B,C,D).
% 3.23/3.43 0 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,D,C,B).
% 3.23/3.43 0 [] -start_point(A,B)|incident_o(A,B).
% 3.23/3.43 0 [] -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 3.23/3.43 0 [] -incident_o(A,B)|A!=ax2_sk1(B,A)|start_point(A,B).
% 3.23/3.43 0 [] -incident_o(A,B)|incident_o(ax2_sk1(B,A),B)|start_point(A,B).
% 3.23/3.43 0 [] -incident_o(A,B)| -ordered_by(B,A,ax2_sk1(B,A))|start_point(A,B).
% 3.23/3.43 0 [] -finish_point(A,B)|incident_o(A,B).
% 3.23/3.43 0 [] -finish_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,C,A).
% 3.23/3.43 0 [] -incident_o(A,B)|A!=ax2_sk2(B,A)|finish_point(A,B).
% 3.23/3.43 0 [] -incident_o(A,B)|incident_o(ax2_sk2(B,A),B)|finish_point(A,B).
% 3.23/3.43 0 [] -incident_o(A,B)| -ordered_by(B,ax2_sk2(B,A),A)|finish_point(A,B).
% 3.23/3.43 0 [] -ordered_by(A,B,C)|incident_o(B,A).
% 3.23/3.43 0 [] -ordered_by(A,B,C)|incident_o(C,A).
% 3.23/3.43 0 [] open(ax2_sk3(A)).
% 3.23/3.43 0 [] -incident_o(A,B)|incident_c(A,ax2_sk3(B)).
% 3.23/3.43 0 [] -incident_c(A,ax2_sk3(B))|incident_o(A,B).
% 3.23/3.43 0 [] -between_o(A,B,C,D)| -incident_o(E,A)|incident_c(E,ax2_sk4(A,D,C,B)).
% 3.23/3.43 0 [] -between_o(A,B,C,D)| -incident_c(E,ax2_sk4(A,D,C,B))|incident_o(E,A).
% 3.23/3.43 0 [] -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 3.23/3.43 0 [] incident_o(ax2_sk5(A,B,C,D,E),B)|incident_c(ax2_sk5(A,B,C,D,E),A)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 3.23/3.43 0 [] incident_o(ax2_sk5(A,B,C,D,E),B)| -incident_o(ax2_sk5(A,B,C,D,E),B)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 3.23/3.43 0 [] -incident_c(ax2_sk5(A,B,C,D,E),A)|incident_c(ax2_sk5(A,B,C,D,E),A)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 3.23/3.43 0 [] -incident_c(ax2_sk5(A,B,C,D,E),A)| -incident_o(ax2_sk5(A,B,C,D,E),B)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 3.23/3.43 0 [] start_point(ax2_sk6(A),A).
% 3.23/3.43 0 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)| -incident_o(D,ax2_sk7(A,C,B))|incident_c(D,A).
% 3.23/3.43 0 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)| -incident_c(D,A)|incident_o(D,ax2_sk7(A,C,B)).
% 3.23/3.43 0 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)|ordered_by(ax2_sk7(A,C,B),B,C).
% 3.23/3.43 0 [] ordered_by(A,ax2_sk8(B,A),ax2_sk9(B,A))|ordered_by(B,ax2_sk8(B,A),ax2_sk9(B,A))|A=B.
% 3.23/3.43 0 [] ordered_by(A,ax2_sk8(B,A),ax2_sk9(B,A))| -ordered_by(A,ax2_sk8(B,A),ax2_sk9(B,A))|A=B.
% 3.23/3.43 0 [] -ordered_by(A,ax2_sk8(A,B),ax2_sk9(A,B))|ordered_by(A,ax2_sk8(A,B),ax2_sk9(A,B))|B=A.
% 3.23/3.43 0 [] -ordered_by(A,ax2_sk8(A,B),ax2_sk9(A,B))| -ordered_by(B,ax2_sk8(A,B),ax2_sk9(A,B))|B=A.
% 3.23/3.43 0 [] A!=underlying_curve(B)| -incident_o(C,B)|incident_c(C,A).
% 3.23/3.43 0 [] A!=underlying_curve(B)| -incident_c(C,A)|incident_o(C,B).
% 3.23/3.43 0 [] incident_o(ax2_sk10(A,B),A)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 3.23/3.43 0 [] incident_o(ax2_sk10(A,B),A)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 3.23/3.43 0 [] -incident_c(ax2_sk10(A,B),B)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 3.23/3.43 0 [] -incident_c(ax2_sk10(A,B),B)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 3.23/3.43 0 [] start_point(sk26,sk25).
% 3.23/3.43 0 [] start_point(sk27,sk25).
% 3.23/3.43 0 [] sk26!=sk27.
% 3.23/3.43 end_of_list.
% 3.23/3.43
% 3.23/3.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 3.23/3.43
% 3.23/3.43 This ia a non-Horn set with equality. The strategy will be
% 3.23/3.43 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 3.23/3.43 deletion, with positive clauses in sos and nonpositive
% 3.23/3.43 clauses in usable.
% 3.23/3.43
% 3.23/3.43 dependent: set(knuth_bendix).
% 3.23/3.43 dependent: set(anl_eq).
% 3.23/3.43 dependent: set(para_from).
% 3.23/3.43 dependent: set(para_into).
% 3.23/3.43 dependent: clear(para_from_right).
% 3.23/3.43 dependent: clear(para_into_right).
% 3.23/3.43 dependent: set(para_from_vars).
% 3.23/3.43 dependent: set(eq_units_both_ways).
% 3.23/3.43 dependent: set(dynamic_demod_all).
% 3.23/3.43 dependent: set(dynamic_demod).
% 3.23/3.43 dependent: set(order_eq).
% 3.23/3.43 dependent: set(back_demod).
% 3.23/3.43 dependent: set(lrpo).
% 3.23/3.43 dependent: set(hyper_res).
% 3.23/3.43 dependent: set(unit_deletion).
% 3.23/3.43 dependent: set(factor).
% 3.23/3.43
% 3.23/3.43 ------------> process usable:
% 3.23/3.43 ** KEPT (pick-wt=9): 1 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 3.23/3.43 ** KEPT (pick-wt=8): 2 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 3.23/3.43 ** KEPT (pick-wt=14): 3 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 3.23/3.43 ** KEPT (pick-wt=11): 4 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 3.23/3.43 ** KEPT (pick-wt=11): 5 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 3.23/3.43 ** KEPT (pick-wt=17): 6 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.23/3.43 ** KEPT (pick-wt=17): 7 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.23/3.43 ** KEPT (pick-wt=6): 8 [] -end_point(A,B)|incident_c(A,B).
% 3.23/3.43 ** KEPT (pick-wt=21): 9 [] -end_point(A,B)| -part_of(C,B)| -part_of(D,B)| -incident_c(A,C)| -incident_c(A,D)|part_of(C,D)|part_of(D,C).
% 3.23/3.43 ** KEPT (pick-wt=11): 10 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=11): 11 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=11): 12 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=11): 13 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 14 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 15 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=6): 16 [] -inner_point(A,B)|incident_c(A,B).
% 3.23/3.43 ** KEPT (pick-wt=6): 17 [] -inner_point(A,B)| -end_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=9): 18 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 3.23/3.43 ** KEPT (pick-wt=7): 19 [] -meet(A,B,C)|incident_c(A,B).
% 3.23/3.43 ** KEPT (pick-wt=7): 20 [] -meet(A,B,C)|incident_c(A,C).
% 3.23/3.43 ** KEPT (pick-wt=13): 21 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 22 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 3.23/3.43 ** KEPT (pick-wt=16): 23 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 3.23/3.43 ** KEPT (pick-wt=16): 24 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 3.23/3.43 ** KEPT (pick-wt=22): 25 [] -incident_c(A,B)| -incident_c(A,C)| -end_point(ax0_sk5(C,B,A),B)| -end_point(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 3.23/3.43 ** KEPT (pick-wt=5): 26 [] -closed(A)| -end_point(B,A).
% 3.23/3.43 ** KEPT (pick-wt=6): 27 [] -open(A)|end_point(ax0_sk7(A),A).
% 3.23/3.43 ** KEPT (pick-wt=5): 28 [] -end_point(A,B)|open(B).
% 3.23/3.43 ** KEPT (pick-wt=8): 29 [] -part_of(A,B)|A=B|open(A).
% 3.23/3.43 ** KEPT (pick-wt=36): 30 [] -part_of(A,B)| -part_of(C,B)| -part_of(D,B)| -end_point(E,A)| -end_point(E,C)| -end_point(E,D)|part_of(C,D)|part_of(D,C)|part_of(A,C)|part_of(C,A)|part_of(A,D)|part_of(D,A).
% 3.23/3.43 ** KEPT (pick-wt=11): 31 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.23/3.43 ** KEPT (pick-wt=12): 33 [copy,32,flip.2] -inner_point(A,B)|sum(ax0_sk9(A,B),ax0_sk10(A,B))=B.
% 3.23/3.43 ** KEPT (pick-wt=18): 34 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 3.23/3.43 ** KEPT (pick-wt=8): 35 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 3.23/3.43 ** KEPT (pick-wt=8): 37 [copy,36,flip.2] -end_point(A,B)|ax0_sk11(A,B)!=A.
% 3.23/3.43 ** KEPT (pick-wt=18): 38 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 3.23/3.43 ** KEPT (pick-wt=11): 40 [copy,39,flip.2] -meet(A,B,C)|sum(B,C)=ax0_sk12(C,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 41 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.23/3.43 ** KEPT (pick-wt=8): 42 [] -between_c(A,B,C,D)|B!=D.
% 3.23/3.43 ** KEPT (pick-wt=12): 43 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 3.23/3.43 ** KEPT (pick-wt=12): 44 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 3.23/3.43 ** KEPT (pick-wt=12): 45 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 3.23/3.43 ** KEPT (pick-wt=12): 46 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 3.23/3.43 ** KEPT (pick-wt=20): 47 [] A=B| -part_of(C,D)| -end_point(A,C)| -end_point(B,C)| -inner_point(E,C)|between_c(D,A,E,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 48 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,D,C).
% 3.23/3.43 ** KEPT (pick-wt=13): 49 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,C,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 50 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,D,C).
% 3.23/3.43 ** KEPT (pick-wt=13): 51 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,C,B).
% 3.23/3.43 ** KEPT (pick-wt=13): 52 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,B,C,D).
% 3.23/3.43 ** KEPT (pick-wt=13): 53 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,D,C,B).
% 3.23/3.43 ** KEPT (pick-wt=6): 54 [] -start_point(A,B)|incident_o(A,B).
% 14.21/14.42 ** KEPT (pick-wt=13): 55 [] -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 14.21/14.42 ** KEPT (pick-wt=11): 57 [copy,56,flip.2] -incident_o(A,B)|ax2_sk1(B,A)!=A|start_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=11): 58 [] -incident_o(A,B)|incident_o(ax2_sk1(B,A),B)|start_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=12): 59 [] -incident_o(A,B)| -ordered_by(B,A,ax2_sk1(B,A))|start_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=6): 60 [] -finish_point(A,B)|incident_o(A,B).
% 14.21/14.42 ** KEPT (pick-wt=13): 61 [] -finish_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,C,A).
% 14.21/14.42 ** KEPT (pick-wt=11): 63 [copy,62,flip.2] -incident_o(A,B)|ax2_sk2(B,A)!=A|finish_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=11): 64 [] -incident_o(A,B)|incident_o(ax2_sk2(B,A),B)|finish_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=12): 65 [] -incident_o(A,B)| -ordered_by(B,ax2_sk2(B,A),A)|finish_point(A,B).
% 14.21/14.42 ** KEPT (pick-wt=7): 66 [] -ordered_by(A,B,C)|incident_o(B,A).
% 14.21/14.42 ** KEPT (pick-wt=7): 67 [] -ordered_by(A,B,C)|incident_o(C,A).
% 14.21/14.42 ** KEPT (pick-wt=7): 68 [] -incident_o(A,B)|incident_c(A,ax2_sk3(B)).
% 14.21/14.42 ** KEPT (pick-wt=7): 69 [] -incident_c(A,ax2_sk3(B))|incident_o(A,B).
% 14.21/14.42 ** KEPT (pick-wt=15): 70 [] -between_o(A,B,C,D)| -incident_o(E,A)|incident_c(E,ax2_sk4(A,D,C,B)).
% 14.21/14.42 ** KEPT (pick-wt=15): 71 [] -between_o(A,B,C,D)| -incident_c(E,ax2_sk4(A,D,C,B))|incident_o(E,A).
% 14.21/14.42 ** KEPT (pick-wt=14): 72 [] -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 14.21/14.42 ** KEPT (pick-wt=26): 73 [] incident_o(ax2_sk5(A,B,C,D,E),B)|incident_c(ax2_sk5(A,B,C,D,E),A)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 14.21/14.42 ** KEPT (pick-wt=26): 74 [] -incident_c(ax2_sk5(A,B,C,D,E),A)| -incident_o(ax2_sk5(A,B,C,D,E),B)| -between_c(A,E,D,C)|between_o(B,E,D,C).
% 14.21/14.42 ** KEPT (pick-wt=20): 75 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)| -incident_o(D,ax2_sk7(A,C,B))|incident_c(D,A).
% 14.21/14.42 ** KEPT (pick-wt=20): 76 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)| -incident_c(D,A)|incident_o(D,ax2_sk7(A,C,B)).
% 14.21/14.42 ** KEPT (pick-wt=18): 77 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)|ordered_by(ax2_sk7(A,C,B),B,C).
% 14.21/14.42 ** KEPT (pick-wt=19): 78 [] -ordered_by(A,ax2_sk8(A,B),ax2_sk9(A,B))| -ordered_by(B,ax2_sk8(A,B),ax2_sk9(A,B))|B=A.
% 14.21/14.42 ** KEPT (pick-wt=10): 79 [] A!=underlying_curve(B)| -incident_o(C,B)|incident_c(C,A).
% 14.21/14.42 ** KEPT (pick-wt=10): 80 [] A!=underlying_curve(B)| -incident_c(C,A)|incident_o(C,B).
% 14.21/14.42 ** KEPT (pick-wt=14): 81 [] -incident_c(ax2_sk10(A,B),B)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 14.21/14.42 ** KEPT (pick-wt=3): 83 [copy,82,flip.1] sk27!=sk26.
% 14.21/14.42
% 14.21/14.42 ------------> process sos:
% 14.21/14.42 ** KEPT (pick-wt=3): 106 [] A=A.
% 14.21/14.42 ** KEPT (pick-wt=8): 107 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 14.21/14.42 ** KEPT (pick-wt=23): 108 [] incident_c(ax0_sk2(A,B,C),C)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 14.21/14.42 ** KEPT (pick-wt=6): 109 [] end_point(ax0_sk6(A),A)|closed(A).
% 14.21/14.42 ** KEPT (pick-wt=4): 110 [] inner_point(ax0_sk8(A),A).
% 14.21/14.42 ** KEPT (pick-wt=13): 111 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 14.21/14.42 ** KEPT (pick-wt=3): 112 [] open(ax2_sk3(A)).
% 14.21/14.42 ** KEPT (pick-wt=4): 113 [] start_point(ax2_sk6(A),A).
% 14.21/14.42 ** KEPT (pick-wt=19): 114 [] ordered_by(A,ax2_sk8(B,A),ax2_sk9(B,A))|ordered_by(B,ax2_sk8(B,A),ax2_sk9(B,A))|A=B.
% 14.21/14.42 ** KEPT (pick-wt=14): 115 [] incident_o(ax2_sk10(A,B),A)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 14.21/14.42 ** KEPT (pick-wt=3): 116 [] start_point(sk26,sk25).
% 14.21/14.42 ** KEPT (pick-wt=3): 117 [] start_point(sk27,sk25).
% 14.21/14.42 Following clause subsumed by 106 during input processing: 0 [copy,106,flip.1] A=A.
% 14.21/14.42 106 back subsumes 105.
% 14.21/14.42 106 back subsumes 104.
% 14.21/14.42 106 back subsumes 103.
% 14.21/14.42 106 back subsumes 100.
% 14.21/14.42 106 back subsumes 99.
% 14.21/14.42 106 back subsumes 93.
% 14.21/14.42 106 back subsumes 92.
% 14.21/14.42
% 14.21/14.42 ======= end of input processing =======
% 14.21/14.42
% 14.21/14.42 =========== start of search ===========
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 12.
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 12.
% 14.21/14.42
% 14.21/14.42 sos_size=1347
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 9.
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 9.
% 14.21/14.42
% 14.21/14.42 sos_size=1476
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 8.
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Resetting weight limit to 8.
% 14.21/14.42
% 14.21/14.42 sos_size=1147
% 14.21/14.42
% 14.21/14.42 -- HEY sandbox, WE HAVE A PROOF!! --
% 14.21/14.42
% 14.21/14.42 -----> EMPTY CLAUSE at 11.00 sec ----> 1692 [hyper,1535,42,106] $F.
% 14.21/14.42
% 14.21/14.42 Length of proof is 7. Level of proof is 4.
% 14.21/14.42
% 14.21/14.42 ---------------- PROOF ----------------
% 14.21/14.42 % SZS status Unsatisfiable
% 14.21/14.42 % SZS output start Refutation
% See solution above
% 14.21/14.42 ------------ end of proof -------------
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Search stopped by max_proofs option.
% 14.21/14.42
% 14.21/14.42
% 14.21/14.42 Search stopped by max_proofs option.
% 14.21/14.42
% 14.21/14.42 ============ end of search ============
% 14.21/14.42
% 14.21/14.42 -------------- statistics -------------
% 14.21/14.42 clauses given 195
% 14.21/14.42 clauses generated 245721
% 14.21/14.42 clauses kept 1683
% 14.21/14.42 clauses forward subsumed 4032
% 14.21/14.42 clauses back subsumed 7
% 14.21/14.42 Kbytes malloced 7812
% 14.21/14.42
% 14.21/14.42 ----------- times (seconds) -----------
% 14.21/14.42 user CPU time 11.00 (0 hr, 0 min, 10 sec)
% 14.21/14.42 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 14.21/14.42 wall-clock time 14 (0 hr, 0 min, 14 sec)
% 14.21/14.42
% 14.21/14.42 That finishes the proof of the theorem.
% 14.21/14.42
% 14.21/14.42 Process 24405 finished Wed Jul 27 06:59:39 2022
% 14.21/14.42 Otter interrupted
% 14.21/14.42 PROOF FOUND
%------------------------------------------------------------------------------