0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n025.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Mon Jul 3 10:23:38 EDT 2023 0.12/0.33 % CPUTime : 0.83/1.12 ============================== Prover9 =============================== 0.83/1.12 Prover9 (32) version 2009-11A, November 2009. 0.83/1.12 Process 970 was started by sandbox2 on n025.cluster.edu, 0.83/1.12 Mon Jul 3 10:23:39 2023 0.83/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_803_n025.cluster.edu". 0.83/1.12 ============================== end of head =========================== 0.83/1.12 0.83/1.12 ============================== INPUT ================================= 0.83/1.12 0.83/1.12 % Reading from file /tmp/Prover9_803_n025.cluster.edu 0.83/1.12 0.83/1.12 set(prolog_style_variables). 0.83/1.12 set(auto2). 0.83/1.12 % set(auto2) -> set(auto). 0.83/1.12 % set(auto) -> set(auto_inference). 0.83/1.12 % set(auto) -> set(auto_setup). 0.83/1.12 % set(auto_setup) -> set(predicate_elim). 0.83/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.83/1.12 % set(auto) -> set(auto_limits). 0.83/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.83/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.83/1.12 % set(auto) -> set(auto_denials). 0.83/1.12 % set(auto) -> set(auto_process). 0.83/1.12 % set(auto2) -> assign(new_constants, 1). 0.83/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.83/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.83/1.12 % set(auto2) -> assign(max_hours, 1). 0.83/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.83/1.12 % set(auto2) -> assign(max_seconds, 0). 0.83/1.12 % set(auto2) -> assign(max_minutes, 5). 0.83/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.83/1.12 % set(auto2) -> set(sort_initial_sos). 0.83/1.12 % set(auto2) -> assign(sos_limit, -1). 0.83/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.83/1.12 % set(auto2) -> assign(max_megs, 400). 0.83/1.12 % set(auto2) -> assign(stats, some). 0.83/1.12 % set(auto2) -> clear(echo_input). 0.83/1.12 % set(auto2) -> set(quiet). 0.83/1.12 % set(auto2) -> clear(print_initial_clauses). 0.83/1.12 % set(auto2) -> clear(print_given). 0.83/1.12 assign(lrs_ticks,-1). 0.83/1.12 assign(sos_limit,10000). 0.83/1.12 assign(order,kbo). 0.83/1.12 set(lex_order_vars). 0.83/1.12 clear(print_given). 0.83/1.12 0.83/1.12 % formulas(sos). % not echoed (70 formulas) 0.83/1.12 0.83/1.12 ============================== end of input ========================== 0.83/1.12 0.83/1.12 % From the command line: assign(max_seconds, 1440). 0.83/1.12 0.83/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.83/1.12 0.83/1.12 % Formulas that are not ordinary clauses: 0.83/1.12 1 (all X all Y (Y = X | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 2 (all X all Y all W all V (s_e(Y,ext(X,Y,W,V),W,V) & s_t(X,Y,ext(X,Y,W,V)))) # label(aA4) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 3 (all X all Y all Z all V all Z2 all V2 (-s_e(X,Y,Z,V) | -s_e(X,Y,Z2,V2) | s_e(Z,V,Z2,V2))) # label(aA2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 4 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(X,V,X1,V1) | -s_e(Y,V,Y1,V1) | s_e(Z,V,Z1,V1) | X = Y | -s_t(X1,Y1,Z1) | -s_t(X,Y,Z) | -s_e(Y,Z,Y1,Z1) | -s_e(X,Y,X1,Y1))) # label(aA5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 5 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 6 (all Xa all Xp all Xc all Xb all Xq ((-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xq,ip(Xa,Xp,Xc,Xb,Xq),Xa)) & (-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.83/1.12 7 (all X all Y all Z (Y = X | -s_e(X,Y,Z,Z))) # label(aA3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.12 8 (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_t(Za,Zb,Zc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xb,Za,Zb)) & (-s_t(Za,Zb,Zc) | -s_e(Xa,Xb,Za,Zb) | -s_e(Xa,Xd,Za,Zd) | s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xb,Xd,Zb,Zd) | -s_e(Xb,Xc,Zb,Zc) | -s_t(Xa,Xb,Xc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xd,Zb,Zd)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xd,Za,Zd)) & (s_e(Xb,Xc,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]. 0.83/1.12 9 (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]. 0.83/1.12 10 (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]. 0.83/1.13 11 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xb,Xa,Xc))) # label(aSatz4_11d) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 12 (all Xq all Xa all Xd all Xb all Xc (Xq = Xa | ext(Xq,Xa,Xb,Xc) = Xd | -s_e(Xa,Xd,Xb,Xc) | -s_t(Xq,Xa,Xd))) # label(aSatz2_12) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 13 (all Xa all Xb all Xc (-s_t(Xb,Xa,Xc) | Xb = Xa | -s_t(Xa,Xb,Xc))) # label(aSatz3_4) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 14 (all Xa all Xb all Xc all XA all XB all XC (-s_t(Xa,Xb,Xc) | s_e(Xa,Xc,XA,XC) | -s_e(Xb,Xc,XA,XB) | -s_e(Xa,Xb,XB,XC) | -s_t(XA,XB,XC))) # label(aSatz2_15) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 15 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 16 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 17 (all Xa all Xb all Xd all Xc (-s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xc) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 18 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 19 (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,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xb,Xa1,Xb1))) # label(aSatz4_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 20 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xb,Xc,Xd) | s_t(Xb,Xd,Xc) | -s_t(Xa,Xb,Xd) | Xa = Xb)) # label(aSatz5_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 21 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 22 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xb,Xc,Xd) | Xc = Xb | s_t(Xa,Xc,Xd))) # label(aSatz3_7a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 23 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xc,Xb,Xa))) # label(aSatz4_11c) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 24 (all Xa all Xb all Xc all Xa1 all 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) | -s_e(Xa,Xc,Xa1,Xc1) | s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1)))) # label(aSatz4_5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 25 (all Xb all Xc all Xa (-s_e(Xb,Xc,Xa,Xa) | Xb = Xc)) # label(aSatz2_13) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 26 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xb,Xd) | s_t(Xa,Xc,Xd) | -s_t(Xb,Xc,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 27 (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]. 0.83/1.13 28 (all Xa all Xc all Xb all Xc1 (-s_e(Xa,Xc,Xa,Xc1) | Xc1 = Xc | -s_e(Xb,Xc,Xb,Xc1) | -s_t(Xa,Xc,Xb))) # label(aSatz4_19) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 29 (all Xa all Xb all Xc all 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)) & (s_t(Xa,Xb,ins(Xc,Xd,Xa,Xb)) | -le(Xa,Xb,Xc,Xd)))) # label(aSatz5_5a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 30 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xd,Xc))) # label(aSatz2_5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 31 (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]. 0.83/1.13 32 (all Xb all Xa ext(Xa,Xb,alpha,gamma) != Xb) # label(aSatz3_14b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 33 (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]. 0.83/1.13 34 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 35 (all Xa all Xb all Xc all Xd all Xe (le(Xa,Xb,Xc,Xd) | -s_t(Xa,Xb,Xe) | -s_e(Xa,Xe,Xc,Xd))) # label(aSatz5_5b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 36 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | Xa = Xb | s_e(Xc,Xd,Xc1,Xd1))) # label(aSatz4_16) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 37 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1) | -s_t(Xa,Xp,Xa1) | -s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xb,Xc)) & (-s_t(Xa,Xp,Xa1) | s_t(Xp,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xc) | -s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xb,Xc)))) # label(aSatz3_17) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 38 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 ((-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)) & (-s_col(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_e(Xa,Xd,Xa1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e(Xb,Xd,Xb1,Xd1)) & (s_e(Xb,Xd,Xb1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (s_e(Xa,Xd,Xa1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (s_col(Xa,Xb,Xc) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)))) # label(d_Defn4_15) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 39 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xb,Xc,Xa))) # label(aSatz4_11a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 40 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xb,Xa,Xd,Xc))) # label(aSatz2_14) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 41 (all Xa all Xb all Xc all Xd all Y ((-le(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xc,insert(Xa,Xb,Xc,Xd))) & (le(Xa,Xb,Xc,Xd) | -s_e(Xa,Xb,Xc,Y) | -s_t(Xc,Y,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]. 0.83/1.13 42 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xc,Xa,Xb))) # label(aSatz4_11b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 43 (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]. 0.83/1.13 44 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xb,Xc,Xd) | -s_t(Xa,Xc,Xd))) # label(aSatz3_6a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 45 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xa,Xc,Xd) | s_t(Xa,Xd,Xc) | -s_t(Xa,Xb,Xd) | Xb = Xa)) # label(aSatz5_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 46 (all Xa all Xb all Xc all Xc1 (Xa = Xb | -s_col(Xa,Xb,Xc) | Xc1 = Xc | -s_e(Xb,Xc,Xb,Xc1) | -s_e(Xa,Xc,Xa,Xc1))) # label(aSatz4_18) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 47 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (s_e(Xc,Xd,Zc,Zd) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xc,Xd,Zc,Zd) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,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)) & (-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_t(Xa,Xb,Xc)))) # label(d_Defn4_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 48 (all Xa all Xb all Xd all Xc (s_t(Xa,Xb,Xc) | s_t(Xa,Xc,Xb) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz5_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 49 (all Xa all Xb all Xc all Xd all Xe all Xf (s_e(Xa,Xb,Xe,Xf) | -s_e(Xc,Xd,Xe,Xf) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 50 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 51 (all Xa all Xb all Xc all Xa1 all Xb1 (s_e3(Xa,Xb,Xc,Xa1,Xb1,insert5(Xa,Xb,Xc,Xa1,Xb1)) | -s_e(Xa,Xb,Xa1,Xb1) | -s_col(Xa,Xb,Xc))) # label(aSatz4_14) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 52 (all Xa all Xb all Xc all Xd all Xe all Xf (-le(Xa,Xb,Xc,Xd) | le(Xa,Xb,Xe,Xf) | -le(Xc,Xd,Xe,Xf))) # label(aSatz5_8) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 53 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (s_t(Xa1,Xb1,Xc1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_t(Xa,Xb,Xc))) # label(aSatz4_6) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 54 (all Xa1 all Xa2 all Xa3 all Xb1 all Xb2 all Xb3 ((s_e(Xa1,Xa2,Xb1,Xb2) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (s_e(Xa2,Xa3,Xb2,Xb3) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (-s_e(Xa1,Xa2,Xb1,Xb2) | -s_e(Xa1,Xa3,Xb1,Xb3) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa2,Xa3,Xb2,Xb3)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa3,Xb1,Xb3)))) # label(d_Defn4_4) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 55 (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) | le(Xa1,Xb1,Xc1,Xd1) | -s_e(Xc,Xd,Xc1,Xd1))) # label(aSatz5_6) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 56 (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,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1))) # label(aSatz2_11) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 57 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_ifs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xb,Xd,Xb1,Xd1))) # label(aSatz4_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 58 (all Xa all Xb all Xc all Xd (-s_t(Xb,Xc,Xd) | Xb = Xc | s_t(Xa,Xb,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 59 (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]. 0.83/1.13 60 (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]. 0.83/1.13 61 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 62 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause). [assumption]. 0.83/1.13 63 (all Xa all Xb all Xc ((s_col(Xa,Xb,Xc) | -s_t(Xc,Xa,Xb)) & (-s_t(Xb,Xc,Xa) | s_col(Xa,Xb,Xc)) & (s_col(Xa,Xb,Xc) | -s_t(Xa,Xb,Xc)) & (s_t(Xc,Xa,Xb) | 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]. 0.83/1.13 64 -(all Xa all Xb all Xc all Xd (-le(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xc,Xd) | -le(Xc,Xd,Xa,Xb))) # label(aSatz5_9) # label(negated_conjecture) # label(non_clause). [assumption]. 0.83/1.13 0.83/1.13 ============================== end of process non-clausal formulas === 0.83/1.13 0.83/1.13 ============================== PROCESS INITIAL CLAUSES =============== 0.83/1.13 0.83/1.13 ============================== PREDICATE ELIMINATION ================= 0.83/1.13 65 -s_t(A,B,C) | -s_e(D,E,A,B) | -s_e(D,F,A,V6) | s_afs(D,E,V7,F,A,B,C,V6) | -s_e(E,F,B,V6) | -s_e(E,V7,B,C) | -s_t(D,E,V7) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 66 -s_afs(A,B,C,D,E,F,V6,V7) | s_t(E,F,V6) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 67 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 68 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 69 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 70 s_e(A,B,C,D) | -s_afs(E,A,B,F,V6,C,D,V7) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 71 s_t(A,B,C) | -s_afs(A,B,C,D,E,F,V6,V7) # label(d_Defn2_10) # label(axiom). [clausify(8)]. 0.83/1.13 72 -s_t(A,B,C) | -s_e(A,C,D,E) | s_e3(A,B,C,D,insert(A,B,D,E),E) # label(aSatz4_5) # label(axiom). [clausify(24)]. 0.83/1.13 73 -s_e3(A,B,C,D,E,F) | s_col(D,E,F) | -s_col(A,B,C) # label(aSatz4_13) # label(axiom). [clausify(9)]. 0.83/1.13 Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_col(D,insert(A,B,D,E),E) | -s_col(A,B,C). [resolve(72,c,73,a)]. 0.83/1.13 74 -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(38)]. 0.83/1.13 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_col(E,F,V6) | -s_col(A,B,C). [resolve(74,b,73,a)]. 0.83/1.13 75 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | -s_e(A,V6,D,V7) | s_fs(A,B,C,V6,D,E,F,V7) | -s_e(B,V6,E,V7) # label(d_Defn4_15) # label(axiom). [clausify(38)]. 0.83/1.13 Derived: -s_col(A,B,C) | -s_e(A,D,E,F) | s_fs(A,B,C,D,E,insert(A,B,E,V6),V6,F) | -s_e(B,D,insert(A,B,E,V6),F) | -s_t(A,B,C) | -s_e(A,C,E,V6). [resolve(75,b,72,c)]. 0.83/1.13 Derived: -s_col(A,B,C) | -s_e(A,D,E,F) | s_fs(A,B,C,D,E,V6,V7,F) | -s_e(B,D,V6,F) | -s_fs(A,B,C,V8,E,V6,V7,V9). [resolve(75,b,74,b)]. 0.83/1.13 76 s_e3(A,B,C,D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) | -s_col(A,B,C) # label(aSatz4_14) # label(axiom). [clausify(51)]. 0.83/1.13 Derived: -s_e(A,B,C,D) | -s_col(A,B,E) | s_col(C,D,insert5(A,B,E,C,D)) | -s_col(A,B,E). [resolve(76,a,73,a)]. 22.58/22.89 Derived: -s_e(A,B,C,D) | -s_col(A,B,E) | -s_col(A,B,E) | -s_e(A,F,C,V6) | s_fs(A,B,E,F,C,D,insert5(A,B,E,C,D),V6) | -s_e(B,F,D,V6). [resolve(76,a,75,b)]. 22.58/22.89 77 s_t(A,B,C) | -s_e3(D,E,F,A,B,C) | -s_t(D,E,F) # label(aSatz4_6) # label(axiom). [clausify(53)]. 22.58/22.89 Derived: s_t(A,insert(B,C,A,D),D) | -s_t(B,C,E) | -s_t(B,C,E) | -s_e(B,E,A,D). [resolve(77,b,72,c)]. 22.58/22.89 Derived: s_t(A,B,C) | -s_t(D,E,F) | -s_fs(D,E,F,V6,A,B,C,V7). [resolve(77,b,74,b)]. 22.58/22.89 Derived: s_t(A,B,insert5(C,D,E,A,B)) | -s_t(C,D,E) | -s_e(C,D,A,B) | -s_col(C,D,E). [resolve(77,b,76,a)]. 22.58/22.89 78 s_e(A,B,C,D) | -s_e3(A,B,E,C,D,F) # label(d_Defn4_4) # label(axiom). [clausify(54)]. 22.58/22.89 Derived: s_e(A,B,C,insert(A,B,C,D)) | -s_t(A,B,E) | -s_e(A,E,C,D). [resolve(78,b,72,c)]. 22.58/22.89 Derived: s_e(A,B,C,D) | -s_fs(A,B,E,F,C,D,V6,V7). [resolve(78,b,74,b)]. 22.58/22.89 79 s_e(A,B,C,D) | -s_e3(E,A,B,F,C,D) # label(d_Defn4_4) # label(axiom). [clausify(54)]. 22.58/22.89 Derived: s_e(A,B,insert(C,A,D,E),E) | -s_t(C,A,B) | -s_e(C,B,D,E). [resolve(79,b,72,c)]. 22.58/22.89 Derived: s_e(A,B,C,D) | -s_fs(E,A,B,F,V6,C,D,V7). [resolve(79,b,74,b)]. 22.58/22.89 Derived: s_e(A,B,C,insert5(D,A,B,E,C)) | -s_e(D,A,E,C) | -s_col(D,A,B). [resolve(79,b,76,a)]. 22.58/22.89 80 -s_e(A,B,C,D) | -s_e(A,E,C,F) | s_e3(A,B,E,C,D,F) | -s_e(B,E,D,F) # label(d_Defn4_4) # label(axiom). [clausify(54)]. 22.58/22.89 Derived: -s_e(A,B,C,D) | -s_e(A,E,C,F) | -s_e(B,E,D,F) | s_col(C,D,F) | -s_col(A,B,E). [resolve(80,c,73,a)]. 22.58/22.89 Derived: -s_e(A,B,C,D) | -s_e(A,E,C,F) | -s_e(B,E,D,F) | -s_col(A,B,E) | -s_e(A,V6,C,V7) | s_fs(A,B,E,V6,C,D,F,V7) | -s_e(B,V6,D,V7). [resolve(80,c,75,b)]. 22.58/22.89 Derived: -s_e(A,B,C,D) | -s_e(A,E,C,F) | -s_e(B,E,D,F) | s_t(C,D,F) | -s_t(A,B,E). [resolve(80,c,77,b)]. 22.58/22.89 81 -s_e3(A,B,C,D,E,F) | s_e(A,C,D,F) # label(d_Defn4_4) # label(axiom). [clausify(54)]. 22.58/22.89 Derived: s_e(A,B,C,D) | -s_fs(A,E,B,F,C,V6,D,V7). [resolve(81,a,74,b)]. 22.58/22.89 Derived: s_e(A,B,C,insert5(A,D,B,C,E)) | -s_e(A,D,C,E) | -s_col(A,D,B). [resolve(81,a,76,a)]. 22.58/22.89 82 -s_t(A,B,C) | -s_e(C,D,E,F) | s_ifs(A,B,C,D,V6,V7,E,F) | -s_e(A,D,V6,F) | -s_e(B,C,V7,E) | -s_e(A,C,V6,E) | -s_t(V6,V7,E) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 83 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 84 s_e(A,B,C,D) | -s_ifs(E,F,A,B,V6,V7,C,D) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 85 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 86 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 87 -s_ifs(A,B,C,D,E,F,V6,V7) | s_t(E,F,V6) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 88 -s_ifs(A,B,C,D,E,F,V6,V7) | s_t(A,B,C) # label(d_Defn4_1) # label(axiom). [clausify(47)]. 22.58/22.89 89 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(aSatz4_2) # label(axiom). [clausify(57)]. 22.58/22.89 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(89,a,82,c)]. 22.58/22.89 22.58/22.89 ============================== end predicate elimination ============= 22.58/22.89 22.58/22.89 Auto_denials: (non-Horn, no changes). 22.58/22.89 22.58/22.89 Term ordering decisions: 22.58/22.89 Function symbol KB weights: alpha=1. gamma=1. beta=1. c1=1. c2=1. c3=1. c4=1. insert=1. ext=1. ins=1. insert5=1. ip=1. crossbar=1. 22.58/22.89 22.58/22.89 ============================== end of process initial clauses ======== 22.58/22.89 22.58/22.89 ============================== CLAUSES FOR SEARCH ==================== 22.58/22.89 22.58/22.89 ============================== end of clauses for search ============= 22.58/22.89 22.58/22.89 ============================== SEARCH ================================ 22.58/22.89 22.58/22.89 % Starting search at 0.04 seconds. 22.58/22.89 22.58/22.89 Low Water (keep): wt=29.000, iters=3339 22.58/22.89 22.58/22.89 Low Water (keep): wt=25.000, iters=3393 22.58/22.89 22.58/22.89 Low Water (keep): wt=21.000, iters=3343 22.58/22.89 22.58/22.89 Low Water (keep): wt=20.000, iters=3377 22.58/22.89 22.58/22.89 Low Water (keep): wt=17.000, iters=3345 22.58/22.89 22.58/22.89 Low Water (keep): wt=16.000, iters=3359 22.58/22.89 22.58/22.89 Low Water (keep): wt=13.000, iters=3335 22.58/22.89 22.58/22.89 Low Water (displace): id=4150, wt=37.000 22.58/22.89 22.58/22.89 Low Water (displace): id=4430, wt=29.000 22.58/22.89 22.58/22.89 Low Water (displace): id=4654, wt=25.000 22.58/22.89 22.58/22.89 Low Water (displace): id=4982, wt=21.000 22.58/22.89 22.58/22.89 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 53 (0.00 of 21.76Alarm clock 179.72/180.03 Prover9 interrupted 179.72/180.03 EOF