TSTP Solution File: GEO082-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO082-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:21 EDT 2022
% Result : Unsatisfiable 2.13s 2.37s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 8 unt; 3 nHn; 10 RR)
% Number of literals : 23 ( 7 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ part_of(A,B)
| ~ incident_c(C,A)
| incident_c(C,B) ),
file('GEO082-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ incident_c(ax0_sk13(A,B),A)
| ~ incident_c(ax0_sk13(A,B),B)
| B = A ),
file('GEO082-1.p',unknown),
[] ).
cnf(42,axiom,
sk14 != sk15,
file('GEO082-1.p',unknown),
[] ).
cnf(43,plain,
sk15 != sk14,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[42])]),
[iquote('copy,42,flip.1')] ).
cnf(59,axiom,
( incident_c(ax0_sk13(A,B),B)
| incident_c(ax0_sk13(A,B),A)
| B = A ),
file('GEO082-1.p',unknown),
[] ).
cnf(60,axiom,
part_of(sk14,sk15),
file('GEO082-1.p',unknown),
[] ).
cnf(61,axiom,
part_of(sk15,sk14),
file('GEO082-1.p',unknown),
[] ).
cnf(1098,plain,
( incident_c(ax0_sk13(A,sk14),A)
| sk14 = A
| incident_c(ax0_sk13(A,sk14),sk15) ),
inference(hyper,[status(thm)],[59,1,60]),
[iquote('hyper,59,1,60')] ).
cnf(1112,plain,
( incident_c(ax0_sk13(sk15,A),A)
| A = sk15
| incident_c(ax0_sk13(sk15,A),sk14) ),
inference(hyper,[status(thm)],[59,1,61]),
[iquote('hyper,59,1,61')] ).
cnf(1121,plain,
incident_c(ax0_sk13(sk15,sk14),sk15),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[1098]),43]),
[iquote('factor,1098.1.3,unit_del,43')] ).
cnf(1128,plain,
incident_c(ax0_sk13(sk15,sk14),sk14),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[1112]),43]),
[iquote('factor,1112.1.3,unit_del,43')] ).
cnf(1366,plain,
sk15 = sk14,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1128,41,1121])]),
[iquote('hyper,1128,41,1121,flip.1')] ).
cnf(1368,plain,
$false,
inference(binary,[status(thm)],[1366,43]),
[iquote('binary,1366.1,43.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO082-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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:58:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.63/2.15 ----- Otter 3.3f, August 2004 -----
% 1.63/2.15 The process was started by sandbox on n004.cluster.edu,
% 1.63/2.15 Wed Jul 27 06:58:51 2022
% 1.63/2.15 The command was "./otter". The process ID is 19265.
% 1.63/2.15
% 1.63/2.15 set(prolog_style_variables).
% 1.63/2.15 set(auto).
% 1.63/2.15 dependent: set(auto1).
% 1.63/2.15 dependent: set(process_input).
% 1.63/2.15 dependent: clear(print_kept).
% 1.63/2.15 dependent: clear(print_new_demod).
% 1.63/2.15 dependent: clear(print_back_demod).
% 1.63/2.15 dependent: clear(print_back_sub).
% 1.63/2.15 dependent: set(control_memory).
% 1.63/2.15 dependent: assign(max_mem, 12000).
% 1.63/2.15 dependent: assign(pick_given_ratio, 4).
% 1.63/2.15 dependent: assign(stats_level, 1).
% 1.63/2.15 dependent: assign(max_seconds, 10800).
% 1.63/2.15 clear(print_given).
% 1.63/2.15
% 1.63/2.15 list(usable).
% 1.63/2.15 0 [] A=A.
% 1.63/2.15 0 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 1.63/2.15 0 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 1.63/2.15 0 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 1.63/2.15 0 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 1.63/2.15 0 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 1.63/2.15 0 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 1.63/2.15 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).
% 1.63/2.15 0 [] incident_c(ax0_sk2(A,B,C),C)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 1.63/2.15 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).
% 1.63/2.15 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).
% 1.63/2.15 0 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 1.63/2.15 0 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 1.63/2.15 0 [] -end_point(A,B)|incident_c(A,B).
% 1.63/2.15 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).
% 1.63/2.15 0 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 1.63/2.15 0 [] -inner_point(A,B)|incident_c(A,B).
% 1.63/2.15 0 [] -inner_point(A,B)| -end_point(A,B).
% 1.63/2.15 0 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 1.63/2.15 0 [] -meet(A,B,C)|incident_c(A,B).
% 1.63/2.15 0 [] -meet(A,B,C)|incident_c(A,C).
% 1.63/2.15 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 1.63/2.15 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 1.63/2.15 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 1.63/2.15 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 1.63/2.15 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).
% 1.63/2.15 0 [] -closed(A)| -end_point(B,A).
% 1.63/2.15 0 [] end_point(ax0_sk6(A),A)|closed(A).
% 1.63/2.15 0 [] -open(A)|end_point(ax0_sk7(A),A).
% 1.63/2.15 0 [] -end_point(A,B)|open(B).
% 1.63/2.15 0 [] -part_of(A,B)|A=B|open(A).
% 1.63/2.15 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).
% 1.63/2.15 0 [] inner_point(ax0_sk8(A),A).
% 1.63/2.15 0 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 1.63/2.15 0 [] -inner_point(A,B)|B=sum(ax0_sk9(A,B),ax0_sk10(A,B)).
% 1.63/2.15 0 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 1.63/2.15 0 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 1.63/2.15 0 [] -end_point(A,B)|A!=ax0_sk11(A,B).
% 1.63/2.15 0 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 1.63/2.15 0 [] -meet(A,B,C)|ax0_sk12(C,B)=sum(B,C).
% 1.63/2.15 0 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 1.63/2.15 0 [] incident_c(ax0_sk13(A,B),B)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 1.63/2.15 0 [] -incident_c(ax0_sk13(A,B),A)|incident_c(ax0_sk13(A,B),A)|B=A.
% 1.63/2.15 0 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 1.63/2.15 0 [] part_of(sk14,sk15).
% 1.63/2.15 0 [] part_of(sk15,sk14).
% 1.63/2.15 0 [] sk14!=sk15.
% 1.63/2.15 end_of_list.
% 1.63/2.15
% 1.63/2.15 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 1.63/2.15
% 1.63/2.15 This ia a non-Horn set with equality. The strategy will be
% 1.63/2.15 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.63/2.15 deletion, with positive clauses in sos and nonpositive
% 1.63/2.15 clauses in usable.
% 1.63/2.15
% 1.63/2.15 dependent: set(knuth_bendix).
% 1.63/2.15 dependent: set(anl_eq).
% 1.63/2.15 dependent: set(para_from).
% 1.63/2.15 dependent: set(para_into).
% 1.63/2.15 dependent: clear(para_from_right).
% 1.63/2.15 dependent: clear(para_into_right).
% 1.63/2.15 dependent: set(para_from_vars).
% 1.63/2.15 dependent: set(eq_units_both_ways).
% 1.63/2.15 dependent: set(dynamic_demod_all).
% 1.63/2.15 dependent: set(dynamic_demod).
% 1.63/2.15 dependent: set(order_eq).
% 1.63/2.15 dependent: set(back_demod).
% 1.63/2.15 dependent: set(lrpo).
% 1.63/2.15 dependent: set(hyper_res).
% 1.63/2.15 dependent: set(unit_deletion).
% 1.63/2.15 dependent: set(factor).
% 1.63/2.15
% 1.63/2.15 ------------> process usable:
% 1.63/2.15 ** KEPT (pick-wt=9): 1 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 1.63/2.15 ** KEPT (pick-wt=8): 2 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 1.63/2.15 ** KEPT (pick-wt=14): 3 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 1.63/2.15 ** KEPT (pick-wt=11): 4 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 1.63/2.15 ** KEPT (pick-wt=11): 5 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** KEPT (pick-wt=6): 8 [] -end_point(A,B)|incident_c(A,B).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** KEPT (pick-wt=11): 10 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=11): 11 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=11): 12 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=11): 13 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=13): 14 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=13): 15 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=6): 16 [] -inner_point(A,B)|incident_c(A,B).
% 1.63/2.15 ** KEPT (pick-wt=6): 17 [] -inner_point(A,B)| -end_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=9): 18 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 1.63/2.15 ** KEPT (pick-wt=7): 19 [] -meet(A,B,C)|incident_c(A,B).
% 1.63/2.15 ** KEPT (pick-wt=7): 20 [] -meet(A,B,C)|incident_c(A,C).
% 1.63/2.15 ** KEPT (pick-wt=13): 21 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 1.63/2.15 ** KEPT (pick-wt=13): 22 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** KEPT (pick-wt=5): 26 [] -closed(A)| -end_point(B,A).
% 1.63/2.15 ** KEPT (pick-wt=6): 27 [] -open(A)|end_point(ax0_sk7(A),A).
% 1.63/2.15 ** KEPT (pick-wt=5): 28 [] -end_point(A,B)|open(B).
% 1.63/2.15 ** KEPT (pick-wt=8): 29 [] -part_of(A,B)|A=B|open(A).
% 1.63/2.15 ** 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).
% 1.63/2.15 ** KEPT (pick-wt=11): 31 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 1.63/2.15 ** KEPT (pick-wt=12): 33 [copy,32,flip.2] -inner_point(A,B)|sum(ax0_sk9(A,B),ax0_sk10(A,B))=B.
% 1.63/2.15 ** KEPT (pick-wt=18): 34 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 1.63/2.15 ** KEPT (pick-wt=8): 35 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 1.63/2.15 ** KEPT (pick-wt=8): 37 [copy,36,flip.2] -end_point(A,B)|ax0_sk11(A,B)!=A.
% 1.63/2.15 ** KEPT (pick-wt=18): 38 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 1.63/2.15 ** KEPT (pick-wt=11): 40 [copy,39,flip.2] -meet(A,B,C)|sum(B,C)=ax0_sk12(C,B).
% 1.63/2.15 ** KEPT (pick-wt=13): 41 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 1.63/2.15 ** KEPT (pick-wt=3): 43 [copy,42,flip.1] sk15!=sk14.
% 1.63/2.15
% 1.63/2.15 ------------> process sos:
% 1.63/2.15 ** KEPT (pick-wt=3): 54 [] A=A.
% 1.63/2.15 ** KEPT (pick-wt=8): 55 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 1.63/2.15 ** KEPT (pick-wt=23): 56 [] 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).
% 2.13/2.37 ** KEPT (pick-wt=6): 57 [] end_point(ax0_sk6(A),A)|closed(A).
% 2.13/2.37 ** KEPT (pick-wt=4): 58 [] inner_point(ax0_sk8(A),A).
% 2.13/2.37 ** KEPT (pick-wt=13): 59 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 2.13/2.37 ** KEPT (pick-wt=3): 60 [] part_of(sk14,sk15).
% 2.13/2.37 ** KEPT (pick-wt=3): 61 [] part_of(sk15,sk14).
% 2.13/2.37 Following clause subsumed by 54 during input processing: 0 [copy,54,flip.1] A=A.
% 2.13/2.37 54 back subsumes 53.
% 2.13/2.37 54 back subsumes 52.
% 2.13/2.37
% 2.13/2.37 ======= end of input processing =======
% 2.13/2.37
% 2.13/2.37 =========== start of search ===========
% 2.13/2.37
% 2.13/2.37
% 2.13/2.37 Resetting weight limit to 10.
% 2.13/2.37
% 2.13/2.37
% 2.13/2.37 Resetting weight limit to 10.
% 2.13/2.37
% 2.13/2.37 sos_size=1254
% 2.13/2.37
% 2.13/2.37 -------- PROOF --------
% 2.13/2.37
% 2.13/2.37 ----> UNIT CONFLICT at 0.22 sec ----> 1368 [binary,1366.1,43.1] $F.
% 2.13/2.37
% 2.13/2.37 Length of proof is 6. Level of proof is 3.
% 2.13/2.37
% 2.13/2.37 ---------------- PROOF ----------------
% 2.13/2.37 % SZS status Unsatisfiable
% 2.13/2.37 % SZS output start Refutation
% See solution above
% 2.13/2.37 ------------ end of proof -------------
% 2.13/2.37
% 2.13/2.37
% 2.13/2.37 Search stopped by max_proofs option.
% 2.13/2.37
% 2.13/2.37
% 2.13/2.37 Search stopped by max_proofs option.
% 2.13/2.37
% 2.13/2.37 ============ end of search ============
% 2.13/2.37
% 2.13/2.37 -------------- statistics -------------
% 2.13/2.37 clauses given 32
% 2.13/2.37 clauses generated 3684
% 2.13/2.37 clauses kept 1361
% 2.13/2.37 clauses forward subsumed 1768
% 2.13/2.37 clauses back subsumed 3
% 2.13/2.37 Kbytes malloced 4882
% 2.13/2.37
% 2.13/2.37 ----------- times (seconds) -----------
% 2.13/2.37 user CPU time 0.22 (0 hr, 0 min, 0 sec)
% 2.13/2.37 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.13/2.37 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.37
% 2.13/2.37 That finishes the proof of the theorem.
% 2.13/2.37
% 2.13/2.37 Process 19265 finished Wed Jul 27 06:58:53 2022
% 2.13/2.37 Otter interrupted
% 2.13/2.37 PROOF FOUND
%------------------------------------------------------------------------------