0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n017.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 : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 03:16:30 EDT 2022 0.12/0.34 % CPUTime : 0.97/1.30 ============================== Prover9 =============================== 0.97/1.30 Prover9 (32) version 2009-11A, November 2009. 0.97/1.30 Process 19738 was started by sandbox2 on n017.cluster.edu, 0.97/1.30 Tue Aug 9 03:16:31 2022 0.97/1.30 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19348_n017.cluster.edu". 0.97/1.30 ============================== end of head =========================== 0.97/1.30 0.97/1.30 ============================== INPUT ================================= 0.97/1.30 0.97/1.30 % Reading from file /tmp/Prover9_19348_n017.cluster.edu 0.97/1.30 0.97/1.30 set(prolog_style_variables). 0.97/1.30 set(auto2). 0.97/1.30 % set(auto2) -> set(auto). 0.97/1.30 % set(auto) -> set(auto_inference). 0.97/1.30 % set(auto) -> set(auto_setup). 0.97/1.30 % set(auto_setup) -> set(predicate_elim). 0.97/1.30 % set(auto_setup) -> assign(eq_defs, unfold). 0.97/1.30 % set(auto) -> set(auto_limits). 0.97/1.30 % set(auto_limits) -> assign(max_weight, "100.000"). 0.97/1.30 % set(auto_limits) -> assign(sos_limit, 20000). 0.97/1.30 % set(auto) -> set(auto_denials). 0.97/1.30 % set(auto) -> set(auto_process). 0.97/1.30 % set(auto2) -> assign(new_constants, 1). 0.97/1.30 % set(auto2) -> assign(fold_denial_max, 3). 0.97/1.30 % set(auto2) -> assign(max_weight, "200.000"). 0.97/1.30 % set(auto2) -> assign(max_hours, 1). 0.97/1.30 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.97/1.30 % set(auto2) -> assign(max_seconds, 0). 0.97/1.30 % set(auto2) -> assign(max_minutes, 5). 0.97/1.30 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.97/1.30 % set(auto2) -> set(sort_initial_sos). 0.97/1.30 % set(auto2) -> assign(sos_limit, -1). 0.97/1.30 % set(auto2) -> assign(lrs_ticks, 3000). 0.97/1.30 % set(auto2) -> assign(max_megs, 400). 0.97/1.30 % set(auto2) -> assign(stats, some). 0.97/1.30 % set(auto2) -> clear(echo_input). 0.97/1.30 % set(auto2) -> set(quiet). 0.97/1.30 % set(auto2) -> clear(print_initial_clauses). 0.97/1.30 % set(auto2) -> clear(print_given). 0.97/1.30 assign(lrs_ticks,-1). 0.97/1.30 assign(sos_limit,10000). 0.97/1.30 assign(order,kbo). 0.97/1.30 set(lex_order_vars). 0.97/1.30 clear(print_given). 0.97/1.30 0.97/1.30 % formulas(sos). % not echoed (206 formulas) 0.97/1.30 0.97/1.30 ============================== end of input ========================== 0.97/1.30 0.97/1.30 % From the command line: assign(max_seconds, 960). 0.97/1.30 0.97/1.30 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.97/1.30 0.97/1.30 % Formulas that are not ordinary clauses: 0.97/1.30 1 (all X all Y all Z (-s_e(X,Y,Z,Z) | X = Y)) # label(aA3) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 2 (all X all Y all W all V (s_t(X,Y,ext(X,Y,W,V)) & s_e(Y,ext(X,Y,W,V),W,V))) # label(aA4) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 3 (all X all Y (X = Y | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 4 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 5 (all Xa all Xp all Xc all Xb all Xq ((s_t(Xq,ip(Xa,Xp,Xc,Xb,Xq),Xa) | -s_t(Xb,Xq,Xc) | -s_t(Xa,Xp,Xc)) & (-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xp,ip(Xa,Xp,Xc,Xb,Xq),Xb)))) # label(aA7) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 6 (all X all Y all Z all V all Z2 all V2 (s_e(Z,V,Z2,V2) | -s_e(X,Y,Z2,V2) | -s_e(X,Y,Z,V))) # label(aA2) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 7 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(X,Y,X1,Y1) | -s_e(Y,Z,Y1,Z1) | -s_e(Y,V,Y1,V1) | -s_t(X1,Y1,Z1) | s_e(Z,V,Z1,V1) | X = Y | -s_t(X,Y,Z) | -s_e(X,V,X1,V1))) # label(aA5) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 8 (all Xa all Xb all Xc all Xp all Xq (perpAt(Xp,Xq,Xc,Xa,Xb) | -perpAt(Xa,Xb,Xc,Xp,Xq))) # label(aSatz8_12a) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 9 (all Xa all Xb all Xp (Xa = Xb | Xp = reflect(Xa,Xb,reflect(Xa,Xb,Xp)))) # label(aSatz10_5) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 10 (all Xa all Xb all Xc all Xa1 all Xc1 ((-s_e(Xa,Xc,Xa1,Xc1) | s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_t(Xa,Xb,Xc)) & (-s_e(Xa,Xc,Xa1,Xc1) | s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_t(Xa,Xb,Xc)))) # label(aSatz4_5) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 11 (all Xp all Xq all Xr all Xcs all Xa (s_e(Xp,Xq,Xr,Xcs) | -s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)))) # label(aSatz7_16b) # label(axiom) # label(non_clause). [assumption]. 0.97/1.30 12 (all Xa all Xb all Xc all Xd (s_e(Xb,Xa,Xd,Xc) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_14) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 13 (all Xa all Xb all Xp all Xq all Xc ((Xb = Xa | -s_col(Xa,Xb,Xp) | -s_col(Xa,Xb,Xq) | Xq = Xp | -s_col(Xa,Xb,Xc) | -perp(Xa,Xb,Xc,Xp)) & (Xa = Xb | -s_col(Xa,Xb,Xp) | -s_col(Xa,Xb,Xq) | -perp(Xa,Xb,Xc,Xp) | s_r(Xc,Xp,Xq) | Xp = Xq))) # label(aSatz8_16a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 14 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xb,Xd) | -s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xc))) # label(aSatz3_5a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 15 (all Xp all Xq all Xa s_e(Xp,Xq,s(Xa,Xp),s(Xa,Xq))) # label(aSatz7_13) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 16 (all Xa all Xb all Xp all Xq all Xr (-samesideline(Xa,Xb,Xp,Xq) | samesideline(Xr,Xb,Xp,Xq) | -sameside(Xa,Xq,Xr))) # label(aSatz9_16) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 17 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_t(Xa,Xb,Xc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_t(Za,Zb,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xc,Xd,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xc,Xd,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xb,Xc,Zb,Zc) | -s_e(Xa,Xc,Za,Zc) | -s_t(Za,Zb,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xd,Za,Zd)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xc,Za,Zc)))) # label(d_Defn4_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 18 (all Xp all Xq all Xr all Xcs (Xq = Xp | s_col(Xp,Xq,Xr) | samesideline(Xr,Xcs,Xp,Xq) | Xp = foot(Xp,Xq,Xr) | opposite(Xr,Xp,Xq,Xcs) | s_col(Xp,Xq,Xcs))) # label(aLemma9_13f_case2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 19 (all Xa all Xb all Xp all Xq all Xc all Xd (-s_col(Xa,Xb,Xp) | perp(Xa,Xb,Xc,Xd) | -perp(Xp,Xq,Xc,Xd) | Xa = Xb | Xq = Xp | -s_col(Xa,Xb,Xq))) # label(aExtPerp2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 20 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 ((s_t(Xa1,Xc,Xa2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_t(Xb1,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_e(Xc,Xa2,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_m(Xa1,Xm1,Xb1) | -s_m(Xa2,Xm2,Xb2) | s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | -s_e(Xc,Xa2,Xc,Xb2) | -s_e(Xc,Xa1,Xc,Xb1) | -s_t(Xb1,Xc,Xb2) | -s_t(Xa1,Xc,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_m(Xa2,Xm2,Xb2)) & (s_m(Xa1,Xm1,Xb1) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_e(Xc,Xa1,Xc,Xb1)))) # label(d_Defn7_23) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 21 (all Xa all Xp all Xb (s_t(Xa,Xp,Xb) | -s_col(Xa,Xp,Xb) | sameside(Xa,Xp,Xb))) # label(aSatz6_4b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 22 (all Xa all Xp all Xq all Xc all Xcs all Xr all Xm all U (-opposite(Xa,Xp,Xq,Xc) | Xp = Xq | -s_col(Xp,Xq,Xcs) | -sameside(U,Xr,Xa) | sameside(s(Xm,U),Xcs,Xc) | -s_m(Xr,Xm,Xcs) | -perp(Xp,Xq,Xc,Xcs) | -perp(Xp,Xq,Xa,Xr) | -s_col(Xp,Xq,Xr))) # label(aSatz9_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 23 (all Xa all Xp all Xq all Xc all Xb (-opposite(Xa,Xp,Xq,Xc) | -samesideline(Xa,Xb,Xp,Xq) | opposite(Xb,Xp,Xq,Xc))) # label(aSatz9_8) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 24 (all Xa all Xb all Xp all Xq all Xc (-s_col(Xp,Xq,Xc) | perpAt(Xa,Xb,Xc,Xp,Xq) | -s_col(Xa,Xb,Xc) | -perp(Xa,Xb,Xp,Xq))) # label(aSatz8_14b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 25 (all Xa all Xb all Xc ((s_e(Xa,Xc,Xa,s(Xb,Xc)) | -s_r(Xa,Xb,Xc)) & (-s_e(Xa,Xc,Xa,s(Xb,Xc)) | s_r(Xa,Xb,Xc)))) # label(d_Defn8_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 26 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xd) | s_t(Xb,Xc,Xd) | s_t(Xb,Xd,Xc) | -s_t(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz5_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 27 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 28 (all Xa all Xb all Xp all Xq all Xc all Xd (-s_col(Xa,Xb,Xq) | Xp = Xq | perp(Xp,Xq,Xc,Xd) | -perp(Xa,Xb,Xc,Xd) | Xb = Xa | -s_col(Xa,Xb,Xp))) # label(aExtPerp5) # label(axiom) # label(non_clause). [assumption]. 1.03/1.30 29 (all Xa all Xp all Xb (s(Xb,Xp) != s(Xa,Xp) | Xb = Xa)) # label(aSatz7_18) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 30 (all Xa all Xb (Xb = Xa | -s_r(Xa,Xb,Xa))) # label(aSatz8_8) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 31 (all Xa all Xb all Xp ((Xp = reflect(Xa,Xb,Xp) | perp(Xa,Xb,Xp,reflect(Xa,Xb,Xp)) | Xb = Xa) & (Xb = Xa | s_col(Xa,Xb,midpoint(Xp,reflect(Xa,Xb,Xp)))))) # label(aSatz10_2a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 32 (all Xa all Xp all Xr all Xq (s(Xa,Xq) != Xr | Xq = Xp | Xr != s(Xa,Xp))) # label(aSatz7_8) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 33 (all Xa all Xb all Xc all Xp all Xq (s_col(Xa,Xb,Xc) | -s_col(Xa,Xb,Xq) | -perp(Xa,Xb,Xc,Xp) | Xp = Xq | -perp(Xa,Xb,Xc,Xq) | -s_col(Xa,Xb,Xp))) # label(aSatz8_18a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 34 (all Xa all Xp all Xb (sameside(Xb,Xp,Xa) | -sameside(Xa,Xp,Xb))) # label(aSatz6_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 35 (all Xa all Xp all Xq (Xq = Xp | s(Xa,Xq) != s(Xa,Xp))) # label(aSatz7_9) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 36 (all Xp all Xq all Xc all Xa all Xb (Xp = Xq | -perpAt(Xp,Xq,Xc,Xa,Xc) | s_col(Xc,Xa,Xb) | Xc = Xa | -perpAt(Xp,Xq,Xc,Xb,Xc))) # label(aLemma9_13g) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 37 (all Xp all Xq all Xr all Xa (s_t(Xp,Xq,Xr) | -s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr)))) # label(aSatz7_15b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 38 (all Xd all Xe all Xd1 all Xa all Xb (samesideline(Xa,Xb,Xd,Xe) | -samesideline(Xa,Xb,Xd1,Xe) | -s_t(Xe,Xd,Xd1) | Xe = Xd)) # label(aLemma9_13c) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 39 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_t(Xm1,Xc,Xm2))) # label(aSatz7_22b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 40 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 41 (all Xa all Xb all Xc all Xp (s_r(Xb,Xa,Xp) | -s_m(s(Xa,Xc),Xp,s(Xb,Xc)) | -s_r(Xa,Xb,Xc))) # label(aSatz8_20a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 42 (all Xp all Xa all Xb all Xq all Xt all Xr (-perp(Xq,Xb,Xa,Xb) | -s_t(Xp,Xt,Xq) | s_m(Xp,midpoint(Xa,Xb),Xr) | -s_e(Xa,Xp,Xb,Xr) | -s_t(Xb,Xr,Xq) | -s_col(Xa,Xb,Xt) | -perp(Xp,Xa,Xa,Xb))) # label(aSatz8_24) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 43 (all Xa all Xb all Xc ((-s_col(Xa,Xb,Xc) | s_t(Xa,Xb,Xc) | s_t(Xc,Xa,Xb) | s_t(Xb,Xc,Xa)) & (-s_t(Xc,Xa,Xb) | s_col(Xa,Xb,Xc)) & (s_col(Xa,Xb,Xc) | -s_t(Xb,Xc,Xa)) & (-s_t(Xa,Xb,Xc) | s_col(Xa,Xb,Xc)))) # label(d_Defn4_10) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 44 (all Xa all Xb all Xc all Xd (-s_col(Xa,Xb,Xc) | -s_col(Xa,Xb,Xd) | Xb = Xa | s_col(Xa,Xc,Xd))) # label(aext1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 45 (all Xa all Xb all Xc all Xd ((s_t(Xa,Xb,ins(Xc,Xd,Xa,Xb)) | -le(Xa,Xb,Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | s_e(Xa,ins(Xc,Xd,Xa,Xb),Xc,Xd)) & (ext(Xa,Xb,insert(Xa,Xb,Xc,Xd),Xd) = ins(Xc,Xd,Xa,Xb) | -le(Xa,Xb,Xc,Xd)))) # label(aSatz5_5a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 46 (all Xa all Xb all Xp all Xq all Xc (Xp = Xq | perp(Xa,Xb,Xc,Xp) | s_col(Xa,Xb,Xc) | -s_r(Xc,Xp,Xq) | -s_col(Xa,Xb,Xq) | -s_col(Xa,Xb,Xp) | Xa = Xb)) # label(aSatz8_16b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 47 (all Xa all Xb all Xa1 all Xc1 insert(Xa,Xb,Xa1,Xc1) = ext(ext(Xc1,Xa1,alpha,gamma),Xa1,Xa,Xb)) # label(d_insert) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 48 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (s_e(Xc,Xd,Xc1,Xd1) | Xb = Xa | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1))) # label(aSatz4_16) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 49 (all Xa all Xb all Xc all Xd (s_t(Xa,Xd,Xc) | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd) | -s_t(Xa,Xb,Xc) | Xa = Xb)) # label(aSatz5_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 50 (all Xa all Xb all Xp all Xq (Xa = Xb | samesideline(Xp,Xq,Xb,Xa) | -samesideline(Xp,Xq,Xa,Xb))) # label(aExtSameSide2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 51 (all Xa all Xb all Xp all Xq (-perp(Xa,Xb,Xp,Xq) | perp(Xa,Xb,Xq,Xp))) # label(aExtPerp4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 52 (all Xa all Xb all Xc all Xd (Xa = Xc | Xb = Xc | Xd = Xc | Xd = Xa | -s_col(Xa,Xc,Xd) | perp(Xb,Xa,Xa,Xd) | -perp(Xb,Xa,Xa,Xc) | Xa = Xb)) # label(aExtPerp3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 53 (all Xc all Xd all Xp all Xa all Xb (-s_col(Xc,Xd,Xp) | -sameside(Xa,Xp,Xb) | s_col(Xc,Xd,Xa) | samesideline(Xa,Xb,Xc,Xd) | -s_col(Xa,Xb,Xp) | Xc = Xd)) # label(aSatz9_19b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 54 (all Xp all Xa all Xr all Xq (Xq = Xr | -s_m(Xp,Xa,Xq) | -s_m(Xp,Xa,Xr))) # label(aSatz7_4b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 55 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | le(Xa,Xb,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12a1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 56 (all Xp all Xq (s_col(Xp,Xq,Xp) | Xp = Xq)) # label(aSatz6_17a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 57 (all Xp all Xq all Xr all Xa (Xp = Xr | s_col(Xa,Xp,Xq) | -sameside(Xa,Xp,Xr) | -s_t(Xq,Xp,Xr) | Xp = Xq)) # label(aSatz6_15c) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 58 (all Xb all Xc all Xa (Xc = Xb | -s_e(Xb,Xc,Xa,Xa))) # label(aSatz2_13) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 59 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | -le(Xp,Xa,Xp,Xb) | s_t(Xp,Xa,Xb))) # label(aSatz6_13a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 60 (all Xa all Xb all Xp all Xq all Xc all Xd all Xe (Xa = Xb | Xp = Xq | -s_col(Xp,Xq,Xc) | s_col(Xp,Xq,Xe) | -s_col(Xa,Xb,Xe) | Xd = Xc | -s_col(Xp,Xq,Xd) | -s_col(Xa,Xb,Xd) | -s_col(Xa,Xb,Xc))) # label(aSatz6_21) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 61 (all Xa all Xb all Xc all Xc1 (-s_e(Xa,Xc,Xa,Xc1) | -s_e(Xb,Xc,Xb,Xc1) | Xc = Xc1 | -s_col(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz4_18) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 62 (all Xa all Xm all Xb (s_m(Xb,Xm,Xa) | -s_m(Xa,Xm,Xb))) # label(aSatz7_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 63 (all Xa all Xb all Xc all Xd all Xp (Xa = Xb | Xd = Xc | -s_col(Xa,Xb,Xd) | -s_col(Xc,Xd,Xp) | s_col(Xa,Xb,Xp) | -s_col(Xa,Xb,Xc))) # label(aExtCol2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 64 (all Xa all Xb all Xc all Xd all Xe all Xf (-le(Xc,Xd,Xe,Xf) | le(Xa,Xb,Xe,Xf) | -le(Xa,Xb,Xc,Xd))) # label(aSatz5_8) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 65 (all Xp all Xq all Xr all Xa (Xr = Xp | s_col(Xa,Xp,Xq) | Xp != Xa | -s_t(Xq,Xp,Xr) | Xq = Xp)) # label(aSatz6_15d) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 66 (all Xa all Xb all Xp all Xq all Xr (Xa = Xb | Xq = Xp | -s_col(Xp,Xq,Xb) | -s_col(Xp,Xq,Xr) | s_col(Xa,Xb,Xr) | -s_col(Xp,Xq,Xa))) # label(aSatz6_18) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 67 (all Xa all Xp all Xq all Xc all Xm all Xr all Xb (-s_col(Xp,Xq,Xm) | -s_m(Xa,Xm,Xc) | -sameside(Xa,Xr,Xb) | opposite(Xb,Xp,Xq,Xc) | -s_col(Xp,Xq,Xr) | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 68 (all Xa1 all Xc all Xa2 all Xb1 all Xb2 all Xm1 all Xm2 (-s_t(Xb1,Xc,Xb2) | -s_e(Xc,Xa2,Xc,Xb2) | s_t(Xm1,Xc,Xm2) | -s_m(Xa2,Xm2,Xb2) | -s_m(Xa1,Xm1,Xb1) | -s_e(Xc,Xa1,Xc,Xb1) | -s_t(Xa1,Xc,Xa2))) # label(aSatz7_22) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 69 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | -le(Xc,Xa1,Xc,Xa2) | s_t(Xm1,Xc,Xm2))) # label(aSatz7_22a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 70 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 71 (all Xa all Xb all Xc all Xd all Xp (s_col(Xa,Xb,Xc) | -s_e(Xb,Xc,Xd,Xa) | -s_col(Xa,Xp,Xc) | s_m(Xa,Xp,Xc) | -s_col(Xb,Xp,Xd) | -s_e(Xa,Xb,Xc,Xd) | Xd = Xb)) # label(aSatz7_21) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 72 (all Xa all Xb all Xc all Xp all Xq (-s_e(Xa,Xp,Xa,Xq) | -s_e(Xb,Xp,Xb,Xq) | s_e(Xc,Xp,Xc,Xq) | -s_col(Xa,Xb,Xc) | Xa = Xb)) # label(aSatz4_17) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 73 (all Xa all Xb all Xc all Xd all Xe (le(Xa,Xb,Xc,Xd) | -s_e(Xa,Xe,Xc,Xd) | -s_t(Xa,Xb,Xe))) # label(aSatz5_5b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 74 (all Xa all Xb all Xc all Xa1 (-s_r(Xa1,Xb,Xc) | -s_t(Xa,Xc,Xa1) | Xc = Xb | -s_r(Xa,Xb,Xc))) # label(aSatz8_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 75 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_col(Xa1,Xb1,Xc1) | -s_col(Xa,Xb,Xc))) # label(aSatz4_13) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 76 (all Xp all Xa all Xb all Xq all Xt all Xr all Xcx (-perp(Xp,Xa,Xa,Xb) | -s_t(Xb,Xr,Xq) | -s_e(Xa,Xp,Xb,Xr) | ip(Xp,Xt,Xq,Xb,Xr) != Xcx | s_m(Xp,Xcx,Xr) | -s_t(Xp,Xt,Xq) | -s_col(Xa,Xb,Xt) | -perp(Xq,Xb,Xa,Xb))) # label(aSatz8_24b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 77 (all Xa all Xb all Xp all Xp1 ((reflect(Xa,Xb,Xp) = Xp1 | Xp1 != Xp | -s_col(Xa,Xb,midpoint(Xp,Xp1)) | Xa = Xb) & (Xa = Xb | -perp(Xa,Xb,Xp,Xp1) | Xp1 = reflect(Xa,Xb,Xp) | -s_col(Xa,Xb,midpoint(Xp,Xp1))))) # label(aSatz10_2b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 78 (all Xa all Xc all Xb all Xc1 (-s_t(Xa,Xc,Xb) | -s_e(Xa,Xc,Xa,Xc1) | Xc1 = Xc | -s_e(Xb,Xc,Xb,Xc1))) # label(aSatz4_19) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 79 (all Xa all Xb all Xc all Xa1 (s_r(Xa1,Xb,Xc) | -s_col(Xb,Xa,Xa1) | Xb = Xa | -s_r(Xa,Xb,Xc))) # label(aSatz8_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 80 (all Xa all Xp all Xb all Xc (Xp = Xb | Xc = Xp | -s_t(Xb,Xp,Xc) | -s_t(Xa,Xp,Xc) | Xa = Xp | sameside(Xa,Xp,Xb))) # label(aSatz6_3b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 81 (all Y all Z all X all Y1 all Z1 all U all V ((s_col(Y,Z,X) | -perpAt(Y,Z,X,Y1,Z1)) & (Z != Y | -perpAt(Y,Z,X,Y1,Z1)) & (-s_col(Y1,Z1,V) | s_r(U,X,V) | -s_col(Y,Z,U) | -perpAt(Y,Z,X,Y1,Z1)) & (Y = Z | -s_col(Y1,Z1,X) | s_col(Y,Z,f811(Y,Z,Y1,Z1,X)) | -s_col(Y,Z,X) | Y1 = Z1 | perpAt(Y,Z,X,Y1,Z1)) & (Y1 = Z1 | -s_col(Y,Z,X) | -s_col(Y1,Z1,X) | -s_r(f811(Y,Z,Y1,Z1,X),X,g811(Y,Z,Y1,Z1,X)) | Y = Z | perpAt(Y,Z,X,Y1,Z1)) & (perpAt(Y,Z,X,Y1,Z1) | Y = Z | Y1 = Z1 | s_col(Y1,Z1,g811(Y,Z,Y1,Z1,X)) | -s_col(Y1,Z1,X) | -s_col(Y,Z,X)) & (Z1 != Y1 | -perpAt(Y,Z,X,Y1,Z1)) & (-perpAt(Y,Z,X,Y1,Z1) | s_col(Y1,Z1,X)))) # label(d_Defn8_11a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 82 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xb,Xa,Xc,Xd))) # label(aSatz2_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 83 (all Xp all Xq all Xr (Xp = Xq | -s_col(Xp,Xq,Xr) | s_col(Xq,Xp,Xr))) # label(aSatz6_17b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 84 (all Xa all Xb all U all V all W (Xa = Xb | -s_col(Xa,Xb,U) | -s_col(Xa,Xb,W) | s_col(Xa,Xb,V) | -s_m(U,V,W))) # label(aLemma9_13b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 85 (all Xp all Xa all Xb all Xq all Xt all Xr all Xcx (-perp(Xp,Xa,Xa,Xb) | -s_t(Xb,Xr,Xq) | ip(Xp,Xt,Xq,Xb,Xr) != Xcx | s_m(Xa,Xcx,Xb) | -s_e(Xa,Xp,Xb,Xr) | -s_t(Xp,Xt,Xq) | -s_col(Xa,Xb,Xt) | -perp(Xq,Xb,Xa,Xb))) # label(aSatz8_24a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 86 (all Xa all Xb all Xc (s_col(Xb,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11d) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 87 (all Xa all Xb all Xc all Xp all Xq ((s_col(Xp,Xq,Xc) | -perpAt(Xa,Xb,Xc,Xp,Xq)) & (s_col(Xa,Xb,Xc) | -perpAt(Xa,Xb,Xc,Xp,Xq)) & (-perpAt(Xa,Xb,Xc,Xp,Xq) | s_col(Xp,Xq,g813(Xa,Xb,Xp,Xq,Xc))) & (f813(Xa,Xb,Xp,Xq,Xc) != Xc | -perpAt(Xa,Xb,Xc,Xp,Xq)) & (-perpAt(Xa,Xb,Xc,Xp,Xq) | Xc != g813(Xa,Xb,Xp,Xq,Xc)) & (-perpAt(Xa,Xb,Xc,Xp,Xq) | s_r(f813(Xa,Xb,Xp,Xq,Xc),Xc,g813(Xa,Xb,Xp,Xq,Xc))) & (-perpAt(Xa,Xb,Xc,Xp,Xq) | s_col(Xa,Xb,f813(Xa,Xb,Xp,Xq,Xc))) & (Xq != Xp | -perpAt(Xa,Xb,Xc,Xp,Xq)) & (-perpAt(Xa,Xb,Xc,Xp,Xq) | Xb != Xa))) # label(aSatz8_13a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 88 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | Xc = Xb | s_t(Xa,Xc,Xd) | -s_t(Xb,Xc,Xd))) # label(aSatz3_7a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 89 (all Xa all Xb all Xp all Xq all Xr all Xc all Xd (-s_col(Xa,Xb,Xq) | Xq = Xp | perpAt(Xa,Xb,Xr,Xc,Xd) | -perpAt(Xp,Xq,Xr,Xc,Xd) | Xb = Xa | -s_col(Xa,Xb,Xp))) # label(aExtPerp) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 90 (all Xa all Xb all Xd all Xc (-s_t(Xb,Xc,Xd) | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 91 (all Xa all Xb all Xp all Xq all Xu all Xc all Xv ((s_col(Xp,Xq,ss1(Xa,Xb,Xp,Xq)) | -samesideline(Xa,Xb,Xp,Xq)) & (s_t(Xb,ss2(Xa,Xb,Xp,Xq),ss3(Xa,Xb,Xp,Xq)) | -samesideline(Xa,Xb,Xp,Xq)) & (-samesideline(Xa,Xb,Xp,Xq) | Xp != Xq) & (-s_col(Xp,Xq,Xu) | -s_col(Xp,Xq,Xv) | Xq = Xp | Xu = Xc | Xv = Xb | s_col(Xp,Xq,Xa) | s_col(Xp,Xq,Xb) | samesideline(Xa,Xb,Xp,Xq) | Xu = Xa | Xv = Xc | -s_t(Xb,Xv,Xc) | -s_t(Xa,Xu,Xc)) & (-s_col(Xp,Xq,Xb) | -samesideline(Xa,Xb,Xp,Xq)) & (-samesideline(Xa,Xb,Xp,Xq) | -s_col(Xp,Xq,Xa)) & (ss3(Xa,Xb,Xp,Xq) != ss2(Xa,Xb,Xp,Xq) | -samesideline(Xa,Xb,Xp,Xq)) & (ss1(Xa,Xb,Xp,Xq) != ss3(Xa,Xb,Xp,Xq) | -samesideline(Xa,Xb,Xp,Xq)) & (-samesideline(Xa,Xb,Xp,Xq) | ss2(Xa,Xb,Xp,Xq) != Xb) & (Xa != ss1(Xa,Xb,Xp,Xq) | -samesideline(Xa,Xb,Xp,Xq)) & (-samesideline(Xa,Xb,Xp,Xq) | s_t(Xa,ss1(Xa,Xb,Xp,Xq),ss3(Xa,Xb,Xp,Xq))) & (s_col(Xp,Xq,ss2(Xa,Xb,Xp,Xq)) | -samesideline(Xa,Xb,Xp,Xq)))) # label(d_Defn9_7) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 92 (all Xa all Xb all Xp (s(Xb,s(Xa,Xp)) != s(Xa,s(Xb,Xp)) | Xb = Xa)) # label(aSatz7_19) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 93 (all Xa all Xb all Xc ((perp(Xa,Xb,Xc,foot(Xa,Xb,Xc)) | s_col(Xa,Xb,Xc)) & (s_col(Xa,Xb,foot(Xa,Xb,Xc)) | s_col(Xa,Xb,Xc)))) # label(aSatz8_18) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 94 (all Xa all Xp all Xq all Xc all Xcs all Xr all Xm all U all V (-opposite(Xa,Xp,Xq,Xc) | Xp = Xq | -s_col(Xp,Xq,Xr) | -perp(Xp,Xq,Xa,Xr) | -perp(Xp,Xq,Xc,Xcs) | -s_m(Xr,Xm,Xcs) | -sameside(U,Xr,Xa) | -sameside(V,Xcs,Xc) | opposite(U,Xp,Xq,V) | -s_col(Xp,Xq,Xcs))) # label(aSatz9_4c) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 95 (all Xp all Xq all Xa all Xb all Xc (samesideline(Xa,Xc,Xp,Xq) | -samesideline(Xb,Xc,Xp,Xq) | -samesideline(Xa,Xb,Xp,Xq) | Xq = Xp)) # label(aSatz9_13) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 96 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xa,Xb,Xd) | Xb = Xc | -s_t(Xb,Xc,Xd))) # label(aSatz3_7b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 97 (all Xa all Xp all Xq all Xc all Xcs all Xr all Xm all U (Xp = Xq | -s_col(Xp,Xq,Xcs) | -s_col(Xp,Xq,Xr) | -perp(Xp,Xq,Xc,Xcs) | -sameside(U,Xr,Xa) | -le(Xcs,Xc,Xr,Xa) | sameside(s(Xm,U),Xcs,Xc) | Xcs = Xr | -s_m(Xr,Xm,Xcs) | -perp(Xp,Xq,Xa,Xr) | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_4a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 98 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 99 (all Xa all Xb all Xc all Xm (sameside(s(Xm,Xa),s(Xm,Xb),s(Xm,Xc)) | -sameside(Xa,Xb,Xc))) # label(aSideReflect) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 100 (all Xp all Xq all Xr all Xcs (foot(Xp,Xq,Xr) != Xp | opposite(Xr,Xp,Xq,Xcs) | samesideline(Xr,Xcs,Xp,Xq) | s_col(Xp,Xq,Xcs) | s_col(Xp,Xq,Xr) | Xq = Xp)) # label(aLemma9_13f_case1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 101 (all Xp all Xq all Xr all Xcs all Xa (-s_e(Xp,Xq,Xr,Xcs) | s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)))) # label(aSatz7_16a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 102 (all Xa all Xc all Xd le(Xa,Xa,Xc,Xd)) # label(aSatz5_11) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 103 (all Xa all Xb all Xc all Xd all Y ((-s_e(Xa,Xb,Xc,Y) | le(Xa,Xb,Xc,Xd) | -s_t(Xc,Y,Xd)) & (s_e(Xa,Xb,Xc,insert(Xa,Xb,Xc,Xd)) | -le(Xa,Xb,Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | s_t(Xc,insert(Xa,Xb,Xc,Xd),Xd)))) # label(d_Defn5_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 104 (all Xa all Xb all Xc (-s_r(Xa,Xb,Xc) | -s_r(Xa,Xc,Xb) | Xc = Xb)) # label(aSatz8_7) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 105 (all Xa all Xp all Xq all Xc all Xm all Xr all Xb (-s_col(Xp,Xq,Xm) | -sameside(Xa,Xr,Xb) | -s_t(Xr,Xb,Xa) | opposite(Xb,Xp,Xq,Xc) | -s_col(Xp,Xq,Xr) | -s_m(Xa,Xm,Xc) | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_3a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 106 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xc,Xd) | s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_6a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 107 (all Xa all Xb all Xc (s_col(Xc,Xb,Xa) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11c) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 108 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | Xp != Xb) & (s_t(Xa,Xp,c63(Xa,Xp,Xb)) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | s_t(Xb,Xp,c63(Xa,Xp,Xb))) & (-sameside(Xa,Xp,Xb) | Xp != c63(Xa,Xp,Xb)) & (Xa != Xp | -sameside(Xa,Xp,Xb)))) # label(aSatz6_3a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 109 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e(Xb,Xa,Xb1,Xa1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -sameside(Xa1,Xb1,Xc1) | -sameside(Xa,Xb,Xc))) # label(aSatz6_28) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 110 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (s_e(Xb,Xd,Xb1,Xd1) | -s_ifs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1))) # label(aSatz4_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 111 (all Xa all Xp all Xq all Xb all Xc (-opposite(Xa,Xp,Xq,Xb) | -samesideline(Xb,Xc,Xp,Xq) | opposite(Xa,Xp,Xq,Xc))) # label(aLemma9_13e) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 112 (all Xa all Xb all Xc all Xp all Xq (Xa = Xb | Xc = Xa | -samesideline(Xp,Xq,Xa,Xb) | samesideline(Xp,Xq,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aExtSameSide1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 113 (all Xa all Xp all Xq all Xb (-opposite(Xa,Xp,Xq,Xb) | -samesideline(Xa,Xb,Xp,Xq))) # label(aSatz9_9) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 114 (all Xa all Xb all Xc all Xd all Xe all Xf (-s_e(Xc,Xd,Xe,Xf) | s_e(Xa,Xb,Xe,Xf) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 115 (all Xa all Xb all Xc all Xd (le(Xc,Xd,Xa,Xb) | le(Xa,Xb,Xc,Xd))) # label(aSatz5_10) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 116 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xd,Zb,Zd)) & (-s_t(Xa,Xb,Xc) | -s_t(Za,Zb,Zc) | -s_e(Xb,Xc,Zb,Zc) | s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xb,Xd,Zb,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xa,Xb,Za,Zb)) & (s_e(Xa,Xd,Za,Zd) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_e(Xa,Xb,Za,Zb) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_t(Za,Zb,Zc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_t(Xa,Xb,Xc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn2_10) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 117 (all Xa all Xm (Xa = Xm | -s_m(Xa,Xm,Xa))) # label(aSatz7_3a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 118 (all Xa all Xp all Xb all Xc (Xa = Xp | -s_t(Xb,Xp,Xc) | sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xc) | Xc = Xp | Xp = Xb)) # label(aSatz6_2a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 119 (all Xa all Xb all Xc ((Xb = Xa | s_col(Xa,Xb,erectAux(Xa,Xb,Xc))) & (Xb = Xa | s_t(Xc,erectAux(Xa,Xb,Xc),erect(Xa,Xb,Xc))) & (Xb = Xa | perp(Xa,Xb,erect(Xa,Xb,Xc),Xa)))) # label(aSatz8_21) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 120 (all Xp all Xq all Xcs all Xr (Xp = Xq | Xp = Xcs | -s_col(Xp,Xq,Xr) | s_col(Xp,Xcs,Xr) | -s_col(Xp,Xq,Xcs))) # label(aSatz6_16b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 121 (all Xa all Xb all Xc (s_t(Xc,Xb,Xa) | -s_t(Xa,Xb,Xc))) # label(aSatz3_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 122 (all Xa all Xb all Xc all XA all XB all XC (-s_t(Xa,Xb,Xc) | -s_t(XA,XB,XC) | s_e(Xa,Xc,XA,XC) | -s_e(Xb,Xc,XA,XB) | -s_e(Xa,Xb,XB,XC))) # label(aSatz2_15) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 123 (all Xa all Xb all Xc all Xp (-s_m(s(Xa,Xc),Xp,s(Xb,Xc)) | Xb = Xc | Xp != Xa | -s_r(Xa,Xb,Xc))) # label(aSatz8_20b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 124 (all Xp all Xq all Xr all Xa (Xq = Xp | s_col(Xa,Xp,Xq) | -sameside(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xp = Xr)) # label(aSatz6_15b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 125 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_t(Xa1,Xb1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1))) # label(aSatz2_11) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 126 (all Xa all Xb all Xp all Xp1 (Xp = reflect(Xa,Xb,Xp1) | reflect(Xa,Xb,Xp) != Xp1 | Xa = Xb)) # label(aSatz10_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 127 (all Xa all Xb all Xc (s_col(Xc,Xa,Xb) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 128 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | -le(Xa,Xb,Xa,Xc) | -le(Xb,Xc,Xa,Xc) | s_t(Xa,Xb,Xc))) # label(aSatz5_12b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 129 (all Xa all Xb all Xp all Xq (perp(Xp,Xq,Xa,Xb) | -perp(Xa,Xb,Xp,Xq))) # label(aSatz8_12b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 130 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 131 (all Xp all Xq all Xa all Xb (samesideline(Xp,Xq,Xb,Xa) | -samesideline(Xp,Xq,Xa,Xb))) # label(aLemma9_13a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 132 (all Xc all Xa all Xb (-s_e(Xc,Xa,Xc,Xb) | s_m(Xa,isomidpoint(Xa,Xb,Xc),Xb))) # label(aSatz7_25) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 133 (all Xa all Xm (s_m(Xa,Xm,Xa) | Xm != Xa)) # label(aSatz7_3b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 134 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 135 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | le(Xp,Xa,Xp,Xb) | -s_t(Xp,Xa,Xb))) # label(aSatz6_13b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 136 (all Xp all Xq all Xp1 all Xq1 all X ((perpAt(Xp,Xq,il(Xp,Xq,Xp1,Xq1),Xp1,Xq1) | -perp(Xp,Xq,Xp1,Xq1)) & (-perpAt(Xp,Xq,X,Xp1,Xq1) | perp(Xp,Xq,Xp1,Xq1)))) # label(d_Defn8_11b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 137 (all Xa all Xc all Xp all Xb all Xq ((s_t(Xa,op(Xq,Xb,Xp,Xc,Xa),Xb) | -s_t(Xb,Xq,Xc) | -s_t(Xa,Xc,Xp)) & (-s_t(Xb,Xq,Xc) | s_t(Xp,Xq,op(Xq,Xb,Xp,Xc,Xa)) | -s_t(Xa,Xc,Xp)))) # label(aSatz9_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 138 (all Xa all Xb all Xc all Xd (s_t(Xa,Xb,Xd) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_6b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 139 (all Xa all Xb all Xd all Xc (-perp(Xa,Xb,Xc,Xd) | perpAt(Xa,Xb,Xd,Xc,Xd) | -s_col(Xa,Xb,Xd) | Xb = Xa)) # label(aSatz8_15) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 140 (all Xa all Xb all Xc all Xd (s_t(Xd,Xc,Xb) | s_t(Xc,Xd,Xb) | -s_t(Xd,Xa,Xb) | -s_t(Xc,Xa,Xb) | Xa = Xb)) # label(aSatz6_16a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 141 (all Xr all Xa all Xb all Xc ((sameside(insert(Xb,Xc,Xa,Xr),Xa,Xr) | Xc = Xb | Xr = Xa) & (Xb = Xc | s_e(Xa,insert(Xb,Xc,Xa,Xr),Xb,Xc) | Xa = Xr))) # label(aSatz6_11a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 142 (all Xa all Xb s_r(Xa,Xb,Xb)) # label(aSatz8_5) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 143 (all Xa all Xb all Xp all Xq (-s_col(Xa,Xb,Xq) | -s_col(Xa,Xb,Xp) | -perp(Xa,Xb,Xp,Xq))) # label(aSatz8_14a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 144 (all Xa all Xb all Xc (Xc = Xb | Xb = Xa | -s_col(Xa,Xb,Xc) | -s_r(Xa,Xb,Xc))) # label(aSatz8_9) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 145 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 146 (all Xa all Xp all Xq all Xc all Xcs all Xr all Xm all U (-s_col(Xp,Xq,Xr) | -s_m(Xr,Xm,Xcs) | -sameside(U,Xr,Xa) | Xcs != Xr | sameside(s(Xm,U),Xcs,Xc) | -perp(Xp,Xq,Xc,Xcs) | -perp(Xp,Xq,Xa,Xr) | -s_col(Xp,Xq,Xcs) | Xp = Xq | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_4b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 147 (all Xa all Xb all Xc ((s_col(Xa,Xb,Xc) | s_col(Xa,Xb,erectAux21a(Xa,Xb,Xc)) | Xa = Xb) & (s_t(Xc,erectAux21a(Xa,Xb,Xc),erect21a(Xa,Xb,Xc)) | s_col(Xa,Xb,Xc) | Xb = Xa) & (Xb = Xa | perp(Xa,Xb,erect21a(Xa,Xb,Xc),Xa) | s_col(Xa,Xb,Xc)))) # label(aSatz8_21a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 148 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_t(Xa1,Xb1,Xc1))) # label(aSatz4_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 149 (all Xa all Xb all Xc all Xd (-le(Xa,Xb,Xc,Xd) | -le(Xc,Xd,Xa,Xb) | s_e(Xa,Xb,Xc,Xd))) # label(aSatz5_9) # label(axiom) # label(non_clause). [assumption]. 1.03/1.31 150 (all Xa all Xb all Xc all Xa1 all Xb1 (-s_col(Xa,Xb,Xc) | s_e3(Xa,Xb,Xc,Xa1,Xb1,insert5(Xa,Xb,Xc,Xa1,Xb1)) | -s_e(Xa,Xb,Xa1,Xb1))) # label(aSatz4_14) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 151 (all Xa all Xb all Xd all Xc (s_t(Xa,Xc,Xb) | s_t(Xa,Xb,Xc) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz5_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 152 (all Xp all Xq all Xa all Xb all Xt ((-s_col(Xp,Xq,Xa) | -opposite(Xa,Xp,Xq,Xb)) & (-opposite(Xa,Xp,Xq,Xb) | s_t(Xa,il(Xa,Xb,Xp,Xq),Xb)) & (-opposite(Xa,Xp,Xq,Xb) | s_col(Xp,Xq,il(Xa,Xb,Xp,Xq))) & (-s_col(Xp,Xq,Xb) | -opposite(Xa,Xp,Xq,Xb)) & (-s_col(Xp,Xq,Xt) | opposite(Xa,Xp,Xq,Xb) | -s_t(Xa,Xt,Xb) | s_col(Xp,Xq,Xb) | s_col(Xp,Xq,Xa) | Xq = Xp))) # label(d_Defn9_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 153 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((-s_t(Xa,Xb,Xc) | s_t(Xp,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xc) | -s_t(Xa,Xp,Xa1) | -s_t(Xa1,Xb1,Xc)) & (-s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xp,Xa1) | s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1) | -s_t(Xa,Xb,Xc)))) # label(aSatz3_17) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 154 (all Xa all Xp all Xb all Xc (-sameside(Xa,Xp,Xb) | sameside(Xa,Xp,Xc) | -sameside(Xb,Xp,Xc))) # label(aSatz6_7) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 155 (all Xa all Xb (-s_col(Xa,Xb,pointOffLine(Xa,Xb)) | Xb = Xa)) # label(aSatz6_25) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 156 (all Xa1 all Xa2 all Xa3 all Xb1 all Xb2 all Xb3 ((-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa3,Xb1,Xb3)) & (s_e(Xa2,Xa3,Xb2,Xb3) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (-s_e(Xa1,Xa2,Xb1,Xb2) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa2,Xa3,Xb2,Xb3) | -s_e(Xa1,Xa3,Xb1,Xb3)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa2,Xb1,Xb2)))) # label(d_Defn4_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 157 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | Xb = Xa | -s_t(Xb,Xa,Xc))) # label(aSatz3_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 158 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-le(Xa,Xb,Xc,Xd) | -s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xc,Xd,Xc1,Xd1) | le(Xa1,Xb1,Xc1,Xd1))) # label(aSatz5_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 159 (all Xa all Xp all Xq all Xb (-opposite(Xa,Xp,Xq,Xb) | opposite(Xb,Xp,Xq,Xa))) # label(aSatz9_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 160 (all Xa all Xb all Xp all Xp1 (Xb = Xa | Xp1 != reflect(Xa,Xb,Xp) | reflect(Xa,Xb,Xp1) = Xp)) # label(aSatz10_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 161 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | Xa != Xp) & (s_t(Xp,Xa,Xb) | s_t(Xp,Xb,Xa) | -sameside(Xa,Xp,Xb)) & (Xp = Xa | sameside(Xa,Xp,Xb) | Xp = Xb | -s_t(Xp,Xb,Xa)) & (-s_t(Xp,Xa,Xb) | Xp = Xa | xb = Xp | sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | Xp != Xb))) # label(d_Defn6_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 162 (all Xq all Xa all Xd all Xb all Xc (Xa = Xq | -s_t(Xq,Xa,Xd) | ext(Xq,Xa,Xb,Xc) = Xd | -s_e(Xa,Xd,Xb,Xc))) # label(aSatz2_12) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 163 (all Xa all Xb all Xc (s_col(Xb,Xc,Xa) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 164 (all Xp all Xa all Xq (s(Xa,Xp) = Xq | -s_m(Xp,Xa,Xq))) # label(aSatz7_6) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 165 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xa,Xc,Xb))) # label(aSatz4_11e) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 166 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 167 (all Xp all Xq all Xr all Xa (-s_t(Xq,Xp,Xr) | sameside(Xa,Xp,Xr) | sameside(Xa,Xp,Xq) | Xp = Xa | -s_col(Xa,Xp,Xq) | Xr = Xp | Xp = Xq)) # label(aSatz6_15a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 168 (all Xa all Xp all Xb all Xq all Xt (-perp(Xa,Xb,Xa,Xp) | s_m(Xa,midpointAux(Xa,Xb,Xp,Xq,Xt),Xb) | -s_col(Xa,Xb,Xt) | -s_t(Xp,Xt,Xq) | -perp(Xa,Xb,Xb,Xq) | -le(Xa,Xp,Xb,Xq))) # label(aSatz8_22b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 169 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | s_col(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xb)))) # label(aSatz6_4a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 170 (all Xa all Xb all Xc (s_r(Xc,Xb,Xa) | -s_r(Xa,Xb,Xc))) # label(aSatz8_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 171 (all Xa all Xp (sameside(Xa,Xp,Xa) | Xp = Xa)) # label(aSatz6_5) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 172 (all Xp all Xa all Xq all Xb (-s_m(Xp,Xb,Xq) | Xa = Xb | -s_m(Xp,Xa,Xq))) # label(aSatz7_17) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 173 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Xa1,Xc1) | s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_t(Xa1,Xb1,Xc1))) # label(aSatz4_3) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 174 (all Xa all Xp (Xp = Xa | Xp != s(Xa,Xp))) # label(aSatz7_10a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 175 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_r(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_r(Xa1,Xb1,Xc1))) # label(aSatz8_10) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 176 (all Xa all Xp all Xq all Xc all Xr all Xb (-s_col(Xp,Xq,Xr) | -sameside(Xa,Xr,Xb) | opposite(Xb,Xp,Xq,Xc) | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_5) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 177 (all Xp all Xq all Xr all Xa (s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr)) | -s_t(Xp,Xq,Xr))) # label(aSatz7_15a) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 178 (all Xa all Xb s_m(Xa,midpoint(Xa,Xb),Xb)) # label(aSatz8_22) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 179 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Xa,Xb) | Xb = Xc)) # label(aNarbouxLemma1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 180 (all Xa all Xb all Xp all Xq (perp(Xb,Xa,Xp,Xq) | -perp(Xa,Xb,Xp,Xq))) # label(aperp1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 181 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 182 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 ((s_col(Xa,Xb,Xc) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xa,Xd,Xa1,Xd1)) & (s_e(Xb,Xd,Xb1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e(Xb,Xd,Xb1,Xd1) | -s_e(Xa,Xd,Xa1,Xd1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_col(Xa,Xb,Xc)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)))) # label(d_Defn4_15) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 183 (all Xa all Xb all Xc (le(Xb,Xc,Xa,Xc) | -s_t(Xa,Xb,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12a2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 184 (all Xa all Xp all Xq all Xc all Xcs all Xr all Xm all U (Xq = Xp | -s_col(Xp,Xq,Xcs) | -s_m(Xr,Xm,Xcs) | -sameside(s(Xm,U),Xcs,Xc) | Xr = Xcs | -le(Xcs,Xc,Xr,Xa) | sameside(U,Xr,Xa) | -perp(Xp,Xq,Xc,Xcs) | -perp(Xp,Xq,Xa,Xr) | -s_col(Xp,Xq,Xr) | -opposite(Xa,Xp,Xq,Xc))) # label(aSatz9_4a2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 185 (all Xp all Xq all Xr all Xcs (s_col(Xp,Xq,Xcs) | opposite(Xr,Xp,Xq,Xcs) | samesideline(Xr,Xcs,Xp,Xq) | s_col(Xp,Xq,Xr) | Xp = Xq)) # label(aLemma9_13f) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 186 (all Xa all Xb all Xc all Xd (s_e(Xa,Xb,Xd,Xc) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_5) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 187 (all Xa all Xm all Xb ((-s_m(Xa,Xm,Xb) | s_t(Xa,Xm,Xb)) & (s_e(Xm,Xa,Xm,Xb) | -s_m(Xa,Xm,Xb)) & (-s_t(Xa,Xm,Xb) | -s_e(Xm,Xa,Xm,Xb) | s_m(Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 188 (all Xa all Xb all Xp all Xq all Xcx all U all V (Xa = Xb | Xp = Xq | -s_col(Xp,Xq,Xcx) | -s_col(Xa,Xb,Xcx) | -s_col(Xp,Xq,V) | perpAt(Xa,Xb,Xcx,Xp,Xq) | -s_r(U,Xcx,V) | Xcx = V | U = Xcx | -s_col(Xa,Xb,U))) # label(aSatz8_13b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 189 (all Xa all Xb all Xc all Xd (s_e(Xc,Xd,Xa,Xb) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_2) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 190 (all Xa all Xb all Xp all Xq (samesideline(Xq,Xp,Xa,Xb) | -samesideline(Xp,Xq,Xa,Xb) | Xa = Xb)) # label(aLemma9_13d) # label(axiom) # label(non_clause). [assumption]. 1.03/1.32 191 (all Xa all Xp all Xb all Xc (Xa = Xp | -s_t(Xa,Xp,Xc) | s_t(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb) | Xp = Xc | Xb = Xp)) # label(aSatz6_2b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 192 (all Xa all Xp (Xp = s(Xa,Xp) | Xp != Xa)) # label(aSatz7_10b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 193 (all Xr all Xa all Xb all Xc all Xp all Xq (Xc = Xb | -s_e(Xa,Xp,Xb,Xc) | Xq = Xp | -s_e(Xa,Xq,Xb,Xc) | -sameside(Xq,Xa,Xr) | -sameside(Xp,Xa,Xr) | Xa = Xr)) # label(aSatz6_11b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 194 (all Xa all Xb all Xc all Xp all Xq (-perpAt(Xa,Xb,Xc,Xp,Xq) | Xc = il(Xa,Xb,Xp,Xq))) # label(aSatz8_14c) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 195 (all Xa all Xb all Xc (-s_r(Xa,Xb,Xc) | s_r(Xa,Xb,s(Xb,Xc)))) # label(aSatz8_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 196 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 197 (all Xa all Xm all Xb (s_m(Xa,Xm,Xb) | Xa = Xb | -s_e(Xm,Xa,Xm,Xb) | -s_col(Xa,Xm,Xb))) # label(aSatz7_20) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 198 (all Xb all Xa ext(Xa,Xb,alpha,gamma) != Xb) # label(aSatz3_14b) # label(axiom) # label(non_clause). [assumption]. 1.03/1.33 199 -(all Xa all Xb all Xp all Xq (Xp = Xq | reflect(Xa,Xb,Xp) != reflect(Xa,Xb,Xq) | Xb = Xa)) # label(aSatz10_7) # label(negated_conjecture) # label(non_clause). [assumption]. 1.03/1.33 1.03/1.33 ============================== end of process non-clausal formulas === 1.03/1.33 1.03/1.33 ============================== PROCESS INITIAL CLAUSES =============== 1.03/1.33 1.03/1.33 ============================== PREDICATE ELIMINATION ================= 1.03/1.33 200 -s_e3(A,B,C,D,E,F) | s_col(D,E,F) | -s_col(A,B,C) # label(aSatz4_13) # label(axiom). [clausify(75)]. 1.03/1.33 201 -s_e(A,B,C,D) | s_e3(A,E,B,C,insert(A,E,C,D),D) | -s_t(A,E,B) # label(aSatz4_5) # label(axiom). [clausify(10)]. 1.03/1.33 Derived: s_col(A,insert(B,C,A,D),D) | -s_col(B,C,E) | -s_e(B,E,A,D) | -s_t(B,C,E). [resolve(200,a,201,b)]. 1.03/1.33 202 -s_t(A,B,C) | -s_e3(A,B,C,D,E,F) | s_t(D,E,F) # label(aSatz4_6) # label(axiom). [clausify(148)]. 1.03/1.33 Derived: -s_t(A,B,C) | s_t(D,insert(A,B,D,E),E) | -s_e(A,C,D,E) | -s_t(A,B,C). [resolve(202,b,201,b)]. 1.03/1.33 203 -s_col(A,B,C) | s_e3(A,B,C,D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) # label(aSatz4_14) # label(axiom). [clausify(150)]. 1.03/1.33 Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_col(D,E,insert5(A,B,C,D,E)) | -s_col(A,B,C). [resolve(203,b,200,a)]. 1.03/1.33 Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | -s_t(A,B,C) | s_t(D,E,insert5(A,B,C,D,E)). [resolve(203,b,202,b)]. 1.03/1.33 204 -s_e3(A,B,C,D,E,F) | s_e(A,C,D,F) # label(d_Defn4_4) # label(axiom). [clausify(156)]. 1.03/1.33 Derived: s_e(A,B,C,insert5(A,D,B,C,E)) | -s_col(A,D,B) | -s_e(A,D,C,E). [resolve(204,a,203,b)]. 1.03/1.33 205 s_e(A,B,C,D) | -s_e3(E,A,B,F,C,D) # label(d_Defn4_4) # label(axiom). [clausify(156)]. 1.03/1.33 Derived: s_e(A,B,insert(C,A,D,E),E) | -s_e(C,B,D,E) | -s_t(C,A,B). [resolve(205,b,201,b)]. 1.03/1.33 Derived: s_e(A,B,C,insert5(D,A,B,E,C)) | -s_col(D,A,B) | -s_e(D,A,E,C). [resolve(205,b,203,b)]. 1.03/1.33 206 -s_e(A,B,C,D) | s_e3(A,B,E,C,D,F) | -s_e(B,E,D,F) | -s_e(A,E,C,F) # label(d_Defn4_4) # label(axiom). [clausify(156)]. 1.03/1.33 Derived: -s_e(A,B,C,D) | -s_e(B,E,D,F) | -s_e(A,E,C,F) | s_col(C,D,F) | -s_col(A,B,E). [resolve(206,b,200,a)]. 1.03/1.33 Derived: -s_e(A,B,C,D) | -s_e(B,E,D,F) | -s_e(A,E,C,F) | -s_t(A,B,E) | s_t(C,D,F). [resolve(206,b,202,b)]. 1.03/1.33 207 -s_e3(A,B,C,D,E,F) | s_e(A,B,D,E) # label(d_Defn4_4) # label(axiom). [clausify(156)]. 1.03/1.33 Derived: s_e(A,B,C,insert(A,B,C,D)) | -s_e(A,E,C,D) | -s_t(A,B,E). [resolve(207,a,201,b)]. 1.03/1.33 208 -s_r(A,B,C) | -s_e3(A,B,C,D,E,F) | s_r(D,E,F) # label(aSatz8_10) # label(axiom). [clausify(175)]. 1.03/1.33 Derived: -s_r(A,B,C) | s_r(D,insert(A,B,D,E),E) | -s_e(A,C,D,E) | -s_t(A,B,C). [resolve(208,b,201,b)]. 1.03/1.33 Derived: -s_r(A,B,C) | s_r(D,E,insert5(A,B,C,D,E)) | -s_col(A,B,C) | -s_e(A,B,D,E). [resolve(208,b,203,b)]. 1.03/1.33 Derived: -s_r(A,B,C) | s_r(D,E,F) | -s_e(A,B,D,E) | -s_e(B,C,E,F) | -s_e(A,C,D,F). [resolve(208,b,206,b)]. 1.03/1.33 209 s_fs(A,B,C,D,E,F,V6,V7) | -s_e(B,D,F,V7) | -s_e(A,D,E,V7) | -s_e3(A,B,C,E,F,V6) | -s_col(A,B,C) # label(d_Defn4_15) # label(axiom). [clausify(182)]. 1.03/1.33 Derived: s_fs(A,B,C,D,E,insert(A,B,E,F),F,V6) | -s_e(B,D,insert(A,B,E,F),V6) | -s_e(A,D,E,V6) | -s_col(A,B,C) | -s_e(A,C,E,F) | -s_t(A,B,C). [resolve(209,d,201,b)]. 1.03/1.41 Derived: s_fs(A,B,C,D,E,F,insert5(A,B,C,E,F),V6) | -s_e(B,D,F,V6) | -s_e(A,D,E,V6) | -s_col(A,B,C) | -s_col(A,B,C) | -s_e(A,B,E,F). [resolve(209,d,203,b)]. 1.03/1.41 Derived: s_fs(A,B,C,D,E,F,V6,V7) | -s_e(B,D,F,V7) | -s_e(A,D,E,V7) | -s_col(A,B,C) | -s_e(A,B,E,F) | -s_e(B,C,F,V6) | -s_e(A,C,E,V6). [resolve(209,d,206,b)]. 1.03/1.41 210 -s_fs(A,B,C,D,E,F,V6,V7) | s_e3(A,B,C,E,F,V6) # label(d_Defn4_15) # label(axiom). [clausify(182)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_col(E,F,V6) | -s_col(A,B,C). [resolve(210,b,200,a)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | -s_t(A,B,C) | s_t(E,F,V6). [resolve(210,b,202,b)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6). [resolve(210,b,204,a)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6). [resolve(210,b,205,b)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F). [resolve(210,b,207,a)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | -s_r(A,B,C) | s_r(E,F,V6). [resolve(210,b,208,b)]. 1.03/1.41 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_fs(A,B,C,V8,E,F,V6,V9) | -s_e(B,V8,F,V9) | -s_e(A,V8,E,V9) | -s_col(A,B,C). [resolve(210,b,209,d)]. 1.03/1.41 211 -s_t(A,B,C) | s_ifs(A,B,C,D,E,F,V6,V7) | -s_e(C,D,V6,V7) | -s_e(A,D,E,V7) | -s_e(B,C,F,V6) | -s_e(A,C,E,V6) | -s_t(E,F,V6) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 212 s_t(A,B,C) | -s_ifs(A,B,C,D,E,F,V6,V7) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 213 -s_ifs(A,B,C,D,E,F,V6,V7) | s_t(E,F,V6) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 214 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 215 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(C,D,V6,V7) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 216 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 217 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6) # label(d_Defn4_1) # label(axiom). [clausify(17)]. 1.03/1.41 218 s_e(A,B,C,D) | -s_ifs(E,A,F,B,V6,C,V7,D) # label(aSatz4_2) # label(axiom). [clausify(110)]. 1.03/1.41 Derived: s_e(A,B,C,D) | -s_t(E,A,F) | -s_e(F,B,V6,D) | -s_e(E,B,V7,D) | -s_e(A,F,C,V6) | -s_e(E,F,V7,V6) | -s_t(V7,C,V6). [resolve(218,b,211,b)]. 1.03/1.41 219 -s_m(A,B,C) | -s_m(D,E,F) | s_kf(A,B,C,V6,F,E,D) | -s_e(V6,D,V6,F) | -s_e(V6,A,V6,C) | -s_t(C,V6,F) | -s_t(A,V6,D) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 220 s_t(A,B,C) | -s_kf(A,D,E,B,F,V6,C) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 221 s_t(A,B,C) | -s_kf(D,E,A,B,C,F,V6) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 222 s_e(A,B,A,C) | -s_kf(D,E,F,A,C,V6,B) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 223 -s_kf(A,B,C,D,E,F,V6) | s_m(V6,F,E) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 224 s_m(A,B,C) | -s_kf(A,B,C,D,E,F,V6) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 225 -s_kf(A,B,C,D,E,F,V6) | s_e(D,A,D,C) # label(d_Defn7_23) # label(axiom). [clausify(20)]. 1.03/1.41 226 -s_kf(A,B,C,D,E,F,V6) | s_t(B,D,F) # label(aSatz7_22b) # label(axiom). [clausify(39)]. 1.03/1.41 227 -s_kf(A,B,C,D,E,F,V6) | -le(D,A,D,V6) | s_t(B,D,F) # label(aSatz7_22a) # label(axiom). [clausify(69)]. 1.03/1.41 Derived: -le(A,B,A,C) | s_t(D,A,E) | -s_m(B,D,F) | -s_m(C,E,V6) | -s_e(A,C,A,V6) | -s_e(A,B,A,F) | -s_t(F,A,V6) | -s_t(B,A,C). [resolve(227,a,219,c)]. 1.03/1.41 228 -s_t(A,B,C) | -s_t(D,E,F) | -s_e(B,C,E,F) | s_afs(A,B,C,V6,D,E,F,V7) | -s_e(B,V6,E,V7) | -s_e(A,V6,D,V7) | -s_e(A,B,D,E) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 229 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 230 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 231 s_e(A,B,C,D) | -s_afs(A,E,F,B,C,V6,V7,D) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 232 s_e(A,B,C,D) | -s_afs(A,B,E,F,C,D,V6,V7) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 233 s_t(A,B,C) | -s_afs(D,E,F,V6,A,B,C,V7) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 234 s_t(A,B,C) | -s_afs(A,B,C,D,E,F,V6,V7) # label(d_Defn2_10) # label(axiom). [clausify(116)]. 1.03/1.41 1.03/1.41 ============================== end predicate elimination ============= 1.03/1.41 1.03/1.41 Auto_denials: (non-Horn, no changes). 1.03/1.50 1.03/1.50 Term ordering decisions: 1.03/1.50 Function symbol KB weights: xb=1. xa=1. xp=1. xq=1. alpha=1. gamma=1. xc=1. xd=1. beta=1. c1=1. c2=1. c3=1. c4=1. s=1. midpoint=1. pointOffLine=1. reflect=1. foot=1. c63=1. erect=1. erect21a=1. erectAux=1. erectAux21a=1. isomidpoint=1. insert=1. ext=1. il=1. ins=1. ss1=1. ss2=1. ss3=1. insert5=1. ip=1. f811=1. f813=1. g811=1. g813=1. op=1. midpointAux=1. crossbar=1. 1.03/1.50 1.03/1.50 ============================== end of process initial clauses ======== 1.03/1.50 1.03/1.50 ============================== CLAUSES FOR SEARCH ==================== 1.03/1.50 1.03/1.50 ============================== end of clauses for search ============= 1.03/1.50 1.03/1.50 ============================== SEARCH ================================ 1.03/1.50 1.03/1.50 % Starting search at 0.15 seconds. 1.03/1.50 1.03/1.50 ============================== PROOF ================================= 1.03/1.50 % SZS status Theorem 1.03/1.50 % SZS output start Refutation 1.03/1.50 1.03/1.50 % Proof 1 at 0.23 (+ 0.00) seconds. 1.03/1.50 % Length of proof is 8. 1.03/1.50 % Level of proof is 3. 1.03/1.50 % Maximum clause weight is 15.000. 1.03/1.50 % Given clauses 237. 1.03/1.50 1.03/1.50 126 (all Xa all Xb all Xp all Xp1 (Xp = reflect(Xa,Xb,Xp1) | reflect(Xa,Xb,Xp) != Xp1 | Xa = Xb)) # label(aSatz10_4) # label(axiom) # label(non_clause). [assumption]. 1.03/1.50 199 -(all Xa all Xb all Xp all Xq (Xp = Xq | reflect(Xa,Xb,Xp) != reflect(Xa,Xb,Xq) | Xb = Xa)) # label(aSatz10_7) # label(negated_conjecture) # label(non_clause). [assumption]. 1.03/1.50 399 reflect(A,B,C) = D | reflect(A,B,D) != C | B = A # label(aSatz10_4) # label(axiom). [clausify(126)]. 1.03/1.50 485 c4 != c3 # label(aSatz10_7) # label(negated_conjecture). [clausify(199)]. 1.03/1.50 486 reflect(c1,c2,c4) = reflect(c1,c2,c3) # label(aSatz10_7) # label(negated_conjecture). [clausify(199)]. 1.03/1.50 487 c2 != c1 # label(aSatz10_7) # label(negated_conjecture). [clausify(199)]. 1.03/1.50 1297 reflect(c1,c2,reflect(c1,c2,c3)) = c4. [resolve(486,a,399,b),unit_del(b,487)]. 1.03/1.50 1298 $F. [resolve(486,a,399,b(flip)),rewrite([486(6),1297(7)]),unit_del(a,485),unit_del(b,487)]. 1.03/1.50 1.03/1.50 % SZS output end Refutation 1.03/1.50 ============================== end of proof ========================== 1.03/1.50 1.03/1.50 ============================== STATISTICS ============================ 1.03/1.50 1.03/1.50 Given=237. Generated=2334. Kept=1049. proofs=1. 1.03/1.50 Usable=234. Sos=744. Demods=8. Limbo=1, Disabled=392. Hints=0. 1.03/1.50 Megabytes=2.46. 1.03/1.50 User_CPU=0.23, System_CPU=0.00, Wall_clock=0. 1.03/1.50 1.03/1.50 ============================== end of statistics ===================== 1.03/1.50 1.03/1.50 ============================== end of search ========================= 1.03/1.50 1.03/1.50 THEOREM PROVED 1.03/1.50 % SZS status Theorem 1.03/1.50 1.03/1.50 Exiting with 1 proof. 1.03/1.50 1.03/1.50 Process 19738 exit (max_proofs) Tue Aug 9 03:16:31 2022 1.03/1.50 Prover9 interrupted 1.03/1.50 EOF