TSTP Solution File: GEO148-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO148-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:32 EDT 2022
% Result : Unsatisfiable 5.83s 6.01s
% Output : Refutation 5.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 19 ( 1 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(82,axiom,
( ~ connect(A,B,C)
| once(at_the_same_time(at(A,C),at(B,C))) ),
file('GEO148-1.p',unknown),
[] ).
cnf(92,axiom,
( ~ once(at_the_same_time(at(A,B),at(C,D)))
| ~ once(at_the_same_time(at(A,E),at(C,F)))
| ~ ordered_by(trajectory_of(A),B,E)
| ~ ordered_by(trajectory_of(C),F,D) ),
file('GEO148-1.p',unknown),
[] ).
cnf(130,axiom,
trajectory_of(A) = ax3_sk1(A),
file('GEO148-1.p',unknown),
[] ).
cnf(131,axiom,
connect(sk28,sk29,sk27),
file('GEO148-1.p',unknown),
[] ).
cnf(132,axiom,
ordered_by(trajectory_of(sk29),sk31,sk27),
file('GEO148-1.p',unknown),
[] ).
cnf(133,plain,
ordered_by(ax3_sk1(sk29),sk31,sk27),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[132]),130]),
[iquote('copy,132,demod,130')] ).
cnf(134,axiom,
ordered_by(trajectory_of(sk28),sk27,sk30),
file('GEO148-1.p',unknown),
[] ).
cnf(135,plain,
ordered_by(ax3_sk1(sk28),sk27,sk30),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[134]),130]),
[iquote('copy,134,demod,130')] ).
cnf(136,axiom,
once(at_the_same_time(at(sk28,sk30),at(sk29,sk31))),
file('GEO148-1.p',unknown),
[] ).
cnf(143,plain,
( ~ once(at_the_same_time(at(A,B),at(C,D)))
| ~ once(at_the_same_time(at(A,E),at(C,F)))
| ~ ordered_by(ax3_sk1(A),B,E)
| ~ ordered_by(ax3_sk1(C),F,D) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[92]),130,130]),
[iquote('back_demod,92,demod,130,130')] ).
cnf(209,plain,
once(at_the_same_time(at(sk28,sk27),at(sk29,sk27))),
inference(hyper,[status(thm)],[131,82]),
[iquote('hyper,131,82')] ).
cnf(2192,plain,
$false,
inference(hyper,[status(thm)],[209,143,136,135,133]),
[iquote('hyper,209,143,136,135,133')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO148-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n004.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:52:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.41/4.00 ----- Otter 3.3f, August 2004 -----
% 3.41/4.00 The process was started by sandbox2 on n004.cluster.edu,
% 3.41/4.00 Wed Jul 27 06:52:21 2022
% 3.41/4.00 The command was "./otter". The process ID is 10234.
% 3.41/4.00
% 3.41/4.00 set(prolog_style_variables).
% 3.41/4.00 set(auto).
% 3.41/4.00 dependent: set(auto1).
% 3.41/4.00 dependent: set(process_input).
% 3.41/4.00 dependent: clear(print_kept).
% 3.41/4.00 dependent: clear(print_new_demod).
% 3.41/4.00 dependent: clear(print_back_demod).
% 3.41/4.00 dependent: clear(print_back_sub).
% 3.41/4.00 dependent: set(control_memory).
% 3.41/4.00 dependent: assign(max_mem, 12000).
% 3.41/4.00 dependent: assign(pick_given_ratio, 4).
% 3.41/4.00 dependent: assign(stats_level, 1).
% 3.41/4.00 dependent: assign(max_seconds, 10800).
% 3.41/4.00 clear(print_given).
% 3.41/4.00
% 3.41/4.00 list(usable).
% 3.41/4.00 0 [] A=A.
% 3.41/4.00 0 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 3.41/4.00 0 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 3.41/4.00 0 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 3.41/4.00 0 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 3.41/4.00 0 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 3.41/4.00 0 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 3.41/4.00 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.41/4.00 0 [] incident_c(ax0_sk2(A,B,C),C)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.41/4.00 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.41/4.00 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.41/4.00 0 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.41/4.00 0 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 3.41/4.00 0 [] -end_point(A,B)|incident_c(A,B).
% 3.41/4.00 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.41/4.00 0 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 3.41/4.00 0 [] -inner_point(A,B)|incident_c(A,B).
% 3.41/4.00 0 [] -inner_point(A,B)| -end_point(A,B).
% 3.41/4.00 0 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 3.41/4.00 0 [] -meet(A,B,C)|incident_c(A,B).
% 3.41/4.00 0 [] -meet(A,B,C)|incident_c(A,C).
% 3.41/4.00 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 3.41/4.00 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 3.41/4.00 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 3.41/4.00 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 3.41/4.00 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.41/4.00 0 [] -closed(A)| -end_point(B,A).
% 3.41/4.00 0 [] end_point(ax0_sk6(A),A)|closed(A).
% 3.41/4.00 0 [] -open(A)|end_point(ax0_sk7(A),A).
% 3.41/4.00 0 [] -end_point(A,B)|open(B).
% 3.41/4.00 0 [] -part_of(A,B)|A=B|open(A).
% 3.41/4.00 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.41/4.00 0 [] inner_point(ax0_sk8(A),A).
% 3.41/4.00 0 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.41/4.00 0 [] -inner_point(A,B)|B=sum(ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.41/4.00 0 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 3.41/4.00 0 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 3.41/4.00 0 [] -end_point(A,B)|A!=ax0_sk11(A,B).
% 3.41/4.00 0 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 3.41/4.00 0 [] -meet(A,B,C)|ax0_sk12(C,B)=sum(B,C).
% 3.41/4.00 0 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 3.41/4.00 0 [] incident_c(ax0_sk13(A,B),B)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.41/4.00 0 [] -incident_c(ax0_sk13(A,B),A)|incident_c(ax0_sk13(A,B),A)|B=A.
% 3.41/4.00 0 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.41/4.00 0 [] -between_c(A,B,C,D)|B!=D.
% 3.41/4.00 0 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 3.41/4.00 0 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 3.41/4.00 0 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 3.41/4.00 0 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 3.41/4.00 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.41/4.00 0 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,D,C).
% 3.41/4.00 0 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,C,B).
% 3.41/4.00 0 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,D,C).
% 3.41/4.00 0 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,C,B).
% 3.41/4.00 0 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,B,C,D).
% 3.41/4.00 0 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,D,C,B).
% 3.41/4.00 0 [] -start_point(A,B)|incident_o(A,B).
% 3.41/4.00 0 [] -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 3.41/4.00 0 [] -incident_o(A,B)|A!=ax2_sk1(B,A)|start_point(A,B).
% 3.41/4.00 0 [] -incident_o(A,B)|incident_o(ax2_sk1(B,A),B)|start_point(A,B).
% 3.41/4.00 0 [] -incident_o(A,B)| -ordered_by(B,A,ax2_sk1(B,A))|start_point(A,B).
% 3.41/4.00 0 [] -finish_point(A,B)|incident_o(A,B).
% 3.41/4.00 0 [] -finish_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,C,A).
% 3.41/4.00 0 [] -incident_o(A,B)|A!=ax2_sk2(B,A)|finish_point(A,B).
% 3.41/4.00 0 [] -incident_o(A,B)|incident_o(ax2_sk2(B,A),B)|finish_point(A,B).
% 3.41/4.00 0 [] -incident_o(A,B)| -ordered_by(B,ax2_sk2(B,A),A)|finish_point(A,B).
% 3.41/4.00 0 [] -ordered_by(A,B,C)|incident_o(B,A).
% 3.41/4.00 0 [] -ordered_by(A,B,C)|incident_o(C,A).
% 3.41/4.00 0 [] open(ax2_sk3(A)).
% 3.41/4.00 0 [] -incident_o(A,B)|incident_c(A,ax2_sk3(B)).
% 3.41/4.00 0 [] -incident_c(A,ax2_sk3(B))|incident_o(A,B).
% 3.41/4.00 0 [] -between_o(A,B,C,D)| -incident_o(E,A)|incident_c(E,ax2_sk4(A,D,C,B)).
% 3.41/4.00 0 [] -between_o(A,B,C,D)| -incident_c(E,ax2_sk4(A,D,C,B))|incident_o(E,A).
% 3.41/4.00 0 [] -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 3.41/4.00 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.41/4.00 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.41/4.00 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.41/4.00 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.41/4.00 0 [] start_point(ax2_sk6(A),A).
% 3.41/4.00 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.41/4.00 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.41/4.00 0 [] -open(A)|B=C| -incident_c(B,A)| -incident_c(C,A)|ordered_by(ax2_sk7(A,C,B),B,C).
% 3.41/4.00 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.41/4.00 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.41/4.00 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.41/4.00 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.41/4.00 0 [] A!=underlying_curve(B)| -incident_o(C,B)|incident_c(C,A).
% 3.41/4.00 0 [] A!=underlying_curve(B)| -incident_c(C,A)|incident_o(C,B).
% 3.41/4.00 0 [] incident_o(ax2_sk10(A,B),A)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 3.41/4.00 0 [] incident_o(ax2_sk10(A,B),A)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 3.41/4.00 0 [] -incident_c(ax2_sk10(A,B),B)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 3.41/4.00 0 [] -incident_c(ax2_sk10(A,B),B)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 3.41/4.00 0 [] -connect(A,B,C)|once(at_the_same_time(at(A,C),at(B,C))).
% 3.41/4.00 0 [] -once(at_the_same_time(at(A,B),at(C,B)))|connect(A,C,B).
% 3.41/4.00 0 [] -once(at_the_same_time(A,B))|once(at_the_same_time(B,A)).
% 3.41/4.00 0 [] -once(at_the_same_time(A,B))|once(at_the_same_time(B,A)).
% 3.41/4.00 0 [] -once(at_the_same_time(at_the_same_time(A,B),C))|once(at_the_same_time(A,at_the_same_time(B,C))).
% 3.41/4.00 0 [] -once(at_the_same_time(A,at_the_same_time(B,C)))|once(at_the_same_time(at_the_same_time(A,B),C)).
% 3.41/4.00 0 [] -once(A)|once(at_the_same_time(A,A)).
% 3.41/4.00 0 [] -once(at_the_same_time(A,B))|once(A).
% 3.41/4.00 0 [] -once(at_the_same_time(A,B))|once(B).
% 3.41/4.00 0 [] -once(at(A,B))|incident_o(B,trajectory_of(A)).
% 3.41/4.00 0 [] -incident_o(A,trajectory_of(B))|once(at(B,A)).
% 3.41/4.00 0 [] trajectory_of(A)=ax3_sk1(A).
% 3.41/4.00 0 [] -once(at_the_same_time(at(A,B),at(C,D)))| -once(at_the_same_time(at(A,E),at(C,F)))| -ordered_by(trajectory_of(A),B,E)| -ordered_by(trajectory_of(C),F,D).
% 3.41/4.00 0 [] -once(A)|once(at_the_same_time(A,at(B,ax3_sk2(B,A)))).
% 3.41/4.00 0 [] connect(sk28,sk29,sk27).
% 3.41/4.00 0 [] ordered_by(trajectory_of(sk29),sk31,sk27).
% 3.41/4.00 0 [] ordered_by(trajectory_of(sk28),sk27,sk30).
% 3.41/4.00 0 [] once(at_the_same_time(at(sk28,sk30),at(sk29,sk31))).
% 3.41/4.00 end_of_list.
% 3.41/4.00
% 3.41/4.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 3.41/4.00
% 3.41/4.00 This ia a non-Horn set with equality. The strategy will be
% 3.41/4.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 3.41/4.00 deletion, with positive clauses in sos and nonpositive
% 3.41/4.00 clauses in usable.
% 3.41/4.00
% 3.41/4.00 dependent: set(knuth_bendix).
% 3.41/4.00 dependent: set(anl_eq).
% 3.41/4.00 dependent: set(para_from).
% 3.41/4.00 dependent: set(para_into).
% 3.41/4.00 dependent: clear(para_from_right).
% 3.41/4.00 dependent: clear(para_into_right).
% 3.41/4.00 dependent: set(para_from_vars).
% 3.41/4.00 dependent: set(eq_units_both_ways).
% 3.41/4.00 dependent: set(dynamic_demod_all).
% 3.41/4.00 dependent: set(dynamic_demod).
% 3.41/4.00 dependent: set(order_eq).
% 3.41/4.00 dependent: set(back_demod).
% 3.41/4.00 dependent: set(lrpo).
% 3.41/4.00 dependent: set(hyper_res).
% 3.41/4.00 dependent: set(unit_deletion).
% 3.41/4.00 dependent: set(factor).
% 3.41/4.00
% 3.41/4.00 ------------> process usable:
% 3.41/4.00 ** KEPT (pick-wt=9): 1 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 3.41/4.00 ** KEPT (pick-wt=8): 2 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 3.41/4.00 ** KEPT (pick-wt=14): 3 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 3.41/4.00 ** KEPT (pick-wt=11): 4 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 3.41/4.00 ** KEPT (pick-wt=11): 5 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 3.41/4.00 ** 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.41/4.00 ** 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.41/4.00 ** KEPT (pick-wt=6): 8 [] -end_point(A,B)|incident_c(A,B).
% 3.41/4.00 ** 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.41/4.00 ** KEPT (pick-wt=11): 10 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=11): 11 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=11): 12 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=11): 13 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=13): 14 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=13): 15 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=6): 16 [] -inner_point(A,B)|incident_c(A,B).
% 3.41/4.00 ** KEPT (pick-wt=6): 17 [] -inner_point(A,B)| -end_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=9): 18 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 3.41/4.00 ** KEPT (pick-wt=7): 19 [] -meet(A,B,C)|incident_c(A,B).
% 3.41/4.00 ** KEPT (pick-wt=7): 20 [] -meet(A,B,C)|incident_c(A,C).
% 3.41/4.00 ** KEPT (pick-wt=13): 21 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 3.41/4.00 ** KEPT (pick-wt=13): 22 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 3.41/4.00 ** 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.41/4.00 ** 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.41/4.00 ** 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.41/4.00 ** KEPT (pick-wt=5): 26 [] -closed(A)| -end_point(B,A).
% 3.41/4.00 ** KEPT (pick-wt=6): 27 [] -open(A)|end_point(ax0_sk7(A),A).
% 3.41/4.00 ** KEPT (pick-wt=5): 28 [] -end_point(A,B)|open(B).
% 3.41/4.00 ** KEPT (pick-wt=8): 29 [] -part_of(A,B)|A=B|open(A).
% 3.41/4.00 ** 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.41/4.00 ** KEPT (pick-wt=11): 31 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 3.41/4.00 ** KEPT (pick-wt=12): 33 [copy,32,flip.2] -inner_point(A,B)|sum(ax0_sk9(A,B),ax0_sk10(A,B))=B.
% 3.41/4.00 ** KEPT (pick-wt=18): 34 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 3.41/4.00 ** KEPT (pick-wt=8): 35 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 3.41/4.00 ** KEPT (pick-wt=8): 37 [copy,36,flip.2] -end_point(A,B)|ax0_sk11(A,B)!=A.
% 3.41/4.00 ** KEPT (pick-wt=18): 38 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 3.41/4.00 ** KEPT (pick-wt=11): 40 [copy,39,flip.2] -meet(A,B,C)|sum(B,C)=ax0_sk12(C,B).
% 3.41/4.00 ** KEPT (pick-wt=13): 41 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 3.41/4.01 ** KEPT (pick-wt=8): 42 [] -between_c(A,B,C,D)|B!=D.
% 3.41/4.01 ** KEPT (pick-wt=12): 43 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 3.41/4.01 ** KEPT (pick-wt=12): 44 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 3.41/4.01 ** KEPT (pick-wt=12): 45 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 3.41/4.01 ** KEPT (pick-wt=12): 46 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 3.41/4.01 ** 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.41/4.01 ** KEPT (pick-wt=13): 48 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,D,C).
% 3.41/4.01 ** KEPT (pick-wt=13): 49 [] -between_o(A,B,C,D)|ordered_by(A,B,C)|ordered_by(A,C,B).
% 3.41/4.01 ** KEPT (pick-wt=13): 50 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,D,C).
% 3.41/4.01 ** KEPT (pick-wt=13): 51 [] -between_o(A,B,C,D)|ordered_by(A,C,D)|ordered_by(A,C,B).
% 3.41/4.01 ** KEPT (pick-wt=13): 52 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,B,C,D).
% 3.41/4.01 ** KEPT (pick-wt=13): 53 [] -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,D,C,B).
% 3.41/4.01 ** KEPT (pick-wt=6): 54 [] -start_point(A,B)|incident_o(A,B).
% 3.41/4.01 ** KEPT (pick-wt=13): 55 [] -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 3.41/4.01 ** KEPT (pick-wt=11): 57 [copy,56,flip.2] -incident_o(A,B)|ax2_sk1(B,A)!=A|start_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=11): 58 [] -incident_o(A,B)|incident_o(ax2_sk1(B,A),B)|start_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=12): 59 [] -incident_o(A,B)| -ordered_by(B,A,ax2_sk1(B,A))|start_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=6): 60 [] -finish_point(A,B)|incident_o(A,B).
% 3.41/4.01 ** KEPT (pick-wt=13): 61 [] -finish_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,C,A).
% 3.41/4.01 ** KEPT (pick-wt=11): 63 [copy,62,flip.2] -incident_o(A,B)|ax2_sk2(B,A)!=A|finish_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=11): 64 [] -incident_o(A,B)|incident_o(ax2_sk2(B,A),B)|finish_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=12): 65 [] -incident_o(A,B)| -ordered_by(B,ax2_sk2(B,A),A)|finish_point(A,B).
% 3.41/4.01 ** KEPT (pick-wt=7): 66 [] -ordered_by(A,B,C)|incident_o(B,A).
% 3.41/4.01 ** KEPT (pick-wt=7): 67 [] -ordered_by(A,B,C)|incident_o(C,A).
% 3.41/4.01 ** KEPT (pick-wt=7): 68 [] -incident_o(A,B)|incident_c(A,ax2_sk3(B)).
% 3.41/4.01 ** KEPT (pick-wt=7): 69 [] -incident_c(A,ax2_sk3(B))|incident_o(A,B).
% 3.41/4.01 ** KEPT (pick-wt=15): 70 [] -between_o(A,B,C,D)| -incident_o(E,A)|incident_c(E,ax2_sk4(A,D,C,B)).
% 3.41/4.01 ** KEPT (pick-wt=15): 71 [] -between_o(A,B,C,D)| -incident_c(E,ax2_sk4(A,D,C,B))|incident_o(E,A).
% 3.41/4.01 ** KEPT (pick-wt=14): 72 [] -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 3.41/4.01 ** 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).
% 3.41/4.01 ** 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).
% 3.41/4.01 ** 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).
% 3.41/4.01 ** 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)).
% 3.41/4.01 ** 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).
% 3.41/4.01 ** 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.
% 3.41/4.01 ** KEPT (pick-wt=10): 79 [] A!=underlying_curve(B)| -incident_o(C,B)|incident_c(C,A).
% 3.41/4.01 ** KEPT (pick-wt=10): 80 [] A!=underlying_curve(B)| -incident_c(C,A)|incident_o(C,B).
% 3.41/4.01 ** KEPT (pick-wt=14): 81 [] -incident_c(ax2_sk10(A,B),B)| -incident_o(ax2_sk10(A,B),A)|B=underlying_curve(A).
% 3.41/4.01 ** KEPT (pick-wt=12): 82 [] -connect(A,B,C)|once(at_the_same_time(at(A,C),at(B,C))).
% 3.41/4.01 ** KEPT (pick-wt=12): 83 [] -once(at_the_same_time(at(A,B),at(C,B)))|connect(A,C,B).
% 3.41/4.01 ** KEPT (pick-wt=8): 84 [] -once(at_the_same_time(A,B))|once(at_the_same_time(B,A)).
% 3.41/4.01 Following clause subsumed by 84 during input processing: 0 [] -once(at_the_same_time(A,B))|once(at_the_same_time(B,A)).
% 3.41/4.01 ** KEPT (pick-wt=12): 85 [] -once(at_the_same_time(at_the_same_time(A,B),C))|once(at_the_same_time(A,at_the_same_time(B,C))).
% 3.41/4.01 ** KEPT (pick-wt=12): 86 [] -once(at_the_same_time(A,at_the_same_time(B,C)))|once(at_the_same_time(at_the_same_time(A,B),C)).
% 3.41/4.01 ** KEPT (pick-wt=6): 87 [] -once(A)|once(at_the_same_time(A,A)).
% 5.83/6.01 ** KEPT (pick-wt=6): 88 [] -once(at_the_same_time(A,B))|once(A).
% 5.83/6.01 ** KEPT (pick-wt=6): 89 [] -once(at_the_same_time(A,B))|once(B).
% 5.83/6.01 ** KEPT (pick-wt=8): 90 [] -once(at(A,B))|incident_o(B,trajectory_of(A)).
% 5.83/6.01 ** KEPT (pick-wt=8): 91 [] -incident_o(A,trajectory_of(B))|once(at(B,A)).
% 5.83/6.01 ** KEPT (pick-wt=26): 92 [] -once(at_the_same_time(at(A,B),at(C,D)))| -once(at_the_same_time(at(A,E),at(C,F)))| -ordered_by(trajectory_of(A),B,E)| -ordered_by(trajectory_of(C),F,D).
% 5.83/6.01 ** KEPT (pick-wt=10): 93 [] -once(A)|once(at_the_same_time(A,at(B,ax3_sk2(B,A)))).
% 5.83/6.01
% 5.83/6.01 ------------> process sos:
% 5.83/6.01 ** KEPT (pick-wt=3): 119 [] A=A.
% 5.83/6.01 ** KEPT (pick-wt=8): 120 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 5.83/6.01 ** KEPT (pick-wt=23): 121 [] 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).
% 5.83/6.01 ** KEPT (pick-wt=6): 122 [] end_point(ax0_sk6(A),A)|closed(A).
% 5.83/6.01 ** KEPT (pick-wt=4): 123 [] inner_point(ax0_sk8(A),A).
% 5.83/6.01 ** KEPT (pick-wt=13): 124 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 5.83/6.01 ** KEPT (pick-wt=3): 125 [] open(ax2_sk3(A)).
% 5.83/6.01 ** KEPT (pick-wt=4): 126 [] start_point(ax2_sk6(A),A).
% 5.83/6.01 ** KEPT (pick-wt=19): 127 [] ordered_by(A,ax2_sk8(B,A),ax2_sk9(B,A))|ordered_by(B,ax2_sk8(B,A),ax2_sk9(B,A))|A=B.
% 5.83/6.01 ** KEPT (pick-wt=14): 128 [] incident_o(ax2_sk10(A,B),A)|incident_c(ax2_sk10(A,B),B)|B=underlying_curve(A).
% 5.83/6.01 ** KEPT (pick-wt=5): 129 [] trajectory_of(A)=ax3_sk1(A).
% 5.83/6.01 ---> New Demodulator: 130 [new_demod,129] trajectory_of(A)=ax3_sk1(A).
% 5.83/6.01 ** KEPT (pick-wt=4): 131 [] connect(sk28,sk29,sk27).
% 5.83/6.01 ** KEPT (pick-wt=5): 133 [copy,132,demod,130] ordered_by(ax3_sk1(sk29),sk31,sk27).
% 5.83/6.01 ** KEPT (pick-wt=5): 135 [copy,134,demod,130] ordered_by(ax3_sk1(sk28),sk27,sk30).
% 5.83/6.01 ** KEPT (pick-wt=8): 136 [] once(at_the_same_time(at(sk28,sk30),at(sk29,sk31))).
% 5.83/6.01 Following clause subsumed by 119 during input processing: 0 [copy,119,flip.1] A=A.
% 5.83/6.01 119 back subsumes 117.
% 5.83/6.01 119 back subsumes 114.
% 5.83/6.01 119 back subsumes 113.
% 5.83/6.01 119 back subsumes 110.
% 5.83/6.01 119 back subsumes 109.
% 5.83/6.01 119 back subsumes 103.
% 5.83/6.01 119 back subsumes 102.
% 5.83/6.01 >>>> Starting back demodulation with 130.
% 5.83/6.01 >> back demodulating 118 with 130.
% 5.83/6.01 >> back demodulating 116 with 130.
% 5.83/6.01 >> back demodulating 115 with 130.
% 5.83/6.01 >> back demodulating 92 with 130.
% 5.83/6.01 >> back demodulating 91 with 130.
% 5.83/6.01 >> back demodulating 90 with 130.
% 5.83/6.01
% 5.83/6.01 ======= end of input processing =======
% 5.83/6.01
% 5.83/6.01 =========== start of search ===========
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 15.
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 15.
% 5.83/6.01
% 5.83/6.01 sos_size=1622
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 11.
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 11.
% 5.83/6.01
% 5.83/6.01 sos_size=1923
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 10.
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Resetting weight limit to 10.
% 5.83/6.01
% 5.83/6.01 sos_size=1963
% 5.83/6.01
% 5.83/6.01 -------- PROOF --------
% 5.83/6.01
% 5.83/6.01 -----> EMPTY CLAUSE at 2.01 sec ----> 2192 [hyper,209,143,136,135,133] $F.
% 5.83/6.01
% 5.83/6.01 Length of proof is 4. Level of proof is 1.
% 5.83/6.01
% 5.83/6.01 ---------------- PROOF ----------------
% 5.83/6.01 % SZS status Unsatisfiable
% 5.83/6.01 % SZS output start Refutation
% See solution above
% 5.83/6.01 ------------ end of proof -------------
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Search stopped by max_proofs option.
% 5.83/6.01
% 5.83/6.01
% 5.83/6.01 Search stopped by max_proofs option.
% 5.83/6.01
% 5.83/6.01 ============ end of search ============
% 5.83/6.01
% 5.83/6.01 -------------- statistics -------------
% 5.83/6.01 clauses given 85
% 5.83/6.01 clauses generated 25362
% 5.83/6.01 clauses kept 2182
% 5.83/6.01 clauses forward subsumed 4510
% 5.83/6.01 clauses back subsumed 10
% 5.83/6.01 Kbytes malloced 9765
% 5.83/6.01
% 5.83/6.01 ----------- times (seconds) -----------
% 5.83/6.01 user CPU time 2.01 (0 hr, 0 min, 2 sec)
% 5.83/6.01 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 5.83/6.01 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 5.83/6.01
% 5.83/6.01 That finishes the proof of the theorem.
% 5.83/6.01
% 5.83/6.01 Process 10234 finished Wed Jul 27 06:52:27 2022
% 5.83/6.01 Otter interrupted
% 5.83/6.01 PROOF FOUND
%------------------------------------------------------------------------------