0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n013.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % DateTime : Thu Jul 2 15:01:18 EDT 2020 0.13/0.34 % CPUTime : 0.79/1.33 ============================== Prover9 =============================== 0.79/1.33 Prover9 (32) version 2009-11A, November 2009. 0.79/1.33 Process 29818 was started by sandbox2 on n013.cluster.edu, 0.79/1.33 Thu Jul 2 15:01:19 2020 0.79/1.33 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_29653_n013.cluster.edu". 0.79/1.33 ============================== end of head =========================== 0.79/1.33 0.79/1.33 ============================== INPUT ================================= 0.79/1.33 0.79/1.33 % Reading from file /tmp/Prover9_29653_n013.cluster.edu 0.79/1.33 0.79/1.33 set(prolog_style_variables). 0.79/1.33 set(auto2). 0.79/1.33 % set(auto2) -> set(auto). 0.79/1.33 % set(auto) -> set(auto_inference). 0.79/1.33 % set(auto) -> set(auto_setup). 0.79/1.33 % set(auto_setup) -> set(predicate_elim). 0.79/1.33 % set(auto_setup) -> assign(eq_defs, unfold). 0.79/1.33 % set(auto) -> set(auto_limits). 0.79/1.33 % set(auto_limits) -> assign(max_weight, "100.000"). 0.79/1.33 % set(auto_limits) -> assign(sos_limit, 20000). 0.79/1.33 % set(auto) -> set(auto_denials). 0.79/1.33 % set(auto) -> set(auto_process). 0.79/1.33 % set(auto2) -> assign(new_constants, 1). 0.79/1.33 % set(auto2) -> assign(fold_denial_max, 3). 0.79/1.33 % set(auto2) -> assign(max_weight, "200.000"). 0.79/1.33 % set(auto2) -> assign(max_hours, 1). 0.79/1.33 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.79/1.33 % set(auto2) -> assign(max_seconds, 0). 0.79/1.33 % set(auto2) -> assign(max_minutes, 5). 0.79/1.33 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.79/1.33 % set(auto2) -> set(sort_initial_sos). 0.79/1.33 % set(auto2) -> assign(sos_limit, -1). 0.79/1.33 % set(auto2) -> assign(lrs_ticks, 3000). 0.79/1.33 % set(auto2) -> assign(max_megs, 400). 0.79/1.33 % set(auto2) -> assign(stats, some). 0.79/1.33 % set(auto2) -> clear(echo_input). 0.79/1.33 % set(auto2) -> set(quiet). 0.79/1.33 % set(auto2) -> clear(print_initial_clauses). 0.79/1.33 % set(auto2) -> clear(print_given). 0.79/1.33 assign(lrs_ticks,-1). 0.79/1.33 assign(sos_limit,10000). 0.79/1.33 assign(order,kbo). 0.79/1.33 set(lex_order_vars). 0.79/1.33 clear(print_given). 0.79/1.33 0.79/1.33 % formulas(sos). % not echoed (47 formulas) 0.79/1.33 0.79/1.33 ============================== end of input ========================== 0.79/1.33 0.79/1.33 % From the command line: assign(max_seconds, 960). 0.79/1.33 0.79/1.33 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.79/1.33 0.79/1.33 % Formulas that are not ordinary clauses: 0.79/1.33 1 (all X all Y (X = Y | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 2 (all X all Y all Z (X = Y | -s_e(X,Y,Z,Z))) # label(aA3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 3 (all Xa all Xp all Xc all Xb all Xq ((s_t(Xp,ip(Xa,Xp,Xc,Xb,Xq),Xb) | -s_t(Xb,Xq,Xc) | -s_t(Xa,Xp,Xc)) & (-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xq,ip(Xa,Xp,Xc,Xb,Xq),Xa)))) # label(aA7) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 4 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(X,Y,X1,Y1) | -s_t(X1,Y1,Z1) | s_e(Z,V,Z1,V1) | X = Y | -s_e(Y,V,Y1,V1) | -s_e(X,V,X1,V1) | -s_e(Y,Z,Y1,Z1) | -s_t(X,Y,Z))) # label(aA5) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 5 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 6 (all X all Y all Z all V all Z2 all V2 (-s_e(X,Y,Z2,V2) | s_e(Z,V,Z2,V2) | -s_e(X,Y,Z,V))) # label(aA2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 7 (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.79/1.33 8 (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.79/1.33 9 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 10 (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]. 0.79/1.33 11 (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.79/1.33 12 (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.79/1.33 13 (all Xq all Xa all Xd all Xb all Xc (Xa = Xq | -s_t(Xq,Xa,Xd) | -s_e(Xa,Xd,Xb,Xc) | ext(Xq,Xa,Xb,Xc) = Xd)) # label(aSatz2_12) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 14 (all Xb all Xa ext(Xa,Xb,alpha,gamma) != Xb) # label(aSatz3_14b) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 15 (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_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)) & (s_e(Xa,Xd,Xa1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (-s_col(Xa,Xb,Xc) | -s_e(Xa,Xd,Xa1,Xd1) | -s_e(Xb,Xd,Xb1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xb,Xd,Xb1,Xd1)))) # label(d_Defn4_15) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 16 (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]. 0.79/1.33 17 (all Xa all Xb all Xc ((s_t(Xa,Xb,Xc) | 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(Xc,Xa,Xb) | s_col(Xa,Xb,Xc)) & (s_col(Xa,Xb,Xc) | -s_t(Xa,Xb,Xc)))) # label(d_Defn4_10) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 18 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa1,Xb1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xa,Xc,Xa1,Xc1) | -s_t(Xa,Xb,Xc))) # label(aSatz4_3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 19 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 20 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 21 (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]. 0.79/1.33 22 (all Xa all Xb all Xc all Xa1 all Xc1 ((s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1) | -s_t(Xa,Xb,Xc)) & (-s_e(Xa,Xc,Xa1,Xc1) | s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_t(Xa,Xb,Xc)))) # label(aSatz4_5) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 23 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | s_t(Xc,Xb,Xa))) # label(aSatz3_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 24 (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]. 0.79/1.33 25 (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,Xa3,Xb1,Xb3) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa2,Xa3,Xb2,Xb3) | -s_e(Xa1,Xa2,Xb1,Xb2)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa2,Xb1,Xb2)))) # label(d_Defn4_4) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 26 (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]. 0.79/1.33 27 (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(Xa,Xb,Xc) | -s_t(Xa1,Xb1,Xc) | s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1) | -s_t(Xa,Xp,Xa1)))) # label(aSatz3_17) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 28 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xc,Xd,Xa,Xb))) # label(aSatz2_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 29 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xd) | Xc = Xb)) # label(aSatz3_7b) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 30 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xb,Xd) | -s_t(Xb,Xc,Xd) | s_t(Xa,Xc,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 31 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xa,Xc,Xd) | s_t(Xb,Xc,Xd))) # label(aSatz3_6a) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 32 (all Xa all Xb all Xc (-s_t(Xb,Xa,Xc) | Xa = Xb | -s_t(Xa,Xb,Xc))) # label(aSatz3_4) # label(axiom) # label(non_clause). [assumption]. 0.79/1.33 33 (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]. 0.83/1.33 34 (all Xa all Xb all Xc all Xd (s_e(Xb,Xa,Xc,Xd) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_4) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 35 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all 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(Xb,Xd,Zb,Zd) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,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_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xb,Za,Zb)) & (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]. 0.83/1.33 36 (all Xa all Xb all Xc all Xd (s_t(Xa,Xc,Xd) | Xc = Xb | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7a) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 37 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 38 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 39 (all Xb all Xc all Xa (Xc = Xb | -s_e(Xb,Xc,Xa,Xa))) # label(aSatz2_13) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 40 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_e(Xa,Xc,Za,Zc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-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(Xc,Xd,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Za,Zc) | -s_e(Xb,Xc,Zb,Zc) | -s_e(Xc,Xd,Zc,Zd) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_t(Za,Zb,Zc)) & (s_e(Xb,Xc,Zb,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) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn4_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.33 41 -(all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | s_t(Xa1,Xb1,Xc1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1))) # label(aSatz4_6) # label(negated_conjecture) # label(non_clause). [assumption]. 0.83/1.33 0.83/1.33 ============================== end of process non-clausal formulas === 0.83/1.33 0.83/1.33 ============================== PROCESS INITIAL CLAUSES =============== 0.83/1.33 0.83/1.33 ============================== PREDICATE ELIMINATION ================= 0.83/1.33 42 -s_e3(A,B,C,D,E,F) | s_e(A,C,D,F) # label(d_Defn4_4) # label(axiom). [clausify(25)]. 0.83/1.33 43 s_e3(c1,c2,c3,c4,c5,c6) # label(aSatz4_6) # label(negated_conjecture). [clausify(41)]. 0.83/1.33 Derived: s_e(c1,c3,c4,c6). [resolve(42,a,43,a)]. 0.83/1.33 44 s_e(A,B,C,D) | -s_e3(E,A,B,F,C,D) # label(d_Defn4_4) # label(axiom). [clausify(25)]. 0.83/1.33 Derived: s_e(c2,c3,c5,c6). [resolve(44,b,43,a)]. 0.83/1.33 45 -s_e3(A,B,C,D,E,F) | s_e(A,B,D,E) # label(d_Defn4_4) # label(axiom). [clausify(25)]. 0.83/1.33 Derived: s_e(c1,c2,c4,c5). [resolve(45,a,43,a)]. 0.83/1.33 46 -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(15)]. 0.83/1.33 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6). [resolve(46,b,42,a)]. 0.83/1.33 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6). [resolve(46,b,44,b)]. 0.83/1.33 Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F). [resolve(46,b,45,a)]. 0.83/1.33 47 -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(22)]. 0.83/1.33 Derived: -s_e(A,B,C,D) | -s_t(A,E,B) | s_e(E,B,insert(A,E,C,D),D). [resolve(47,b,44,b)]. 0.83/1.33 Derived: -s_e(A,B,C,D) | -s_t(A,E,B) | s_e(A,E,C,insert(A,E,C,D)). [resolve(47,b,45,a)]. 0.83/1.33 48 -s_e(A,B,C,D) | s_e3(A,E,B,C,F,D) | -s_e(E,B,F,D) | -s_e(A,E,C,F) # label(d_Defn4_4) # label(axiom). [clausify(25)]. 0.83/1.33 49 -s_col(A,B,C) | -s_e(A,D,E,F) | -s_e(B,D,V6,F) | s_fs(A,B,C,D,E,V6,V7,F) | -s_e3(A,B,C,E,V6,V7) # label(d_Defn4_15) # label(axiom). [clausify(15)]. 0.83/1.33 Derived: -s_col(c1,c2,c3) | -s_e(c1,A,c4,B) | -s_e(c2,A,c5,B) | s_fs(c1,c2,c3,A,c4,c5,c6,B). [resolve(49,e,43,a)]. 0.83/1.33 Derived: -s_col(A,B,C) | -s_e(A,D,E,F) | -s_e(B,D,V6,F) | s_fs(A,B,C,D,E,V6,V7,F) | -s_fs(A,B,C,V8,E,V6,V7,V9). [resolve(49,e,46,b)]. 0.83/1.33 Derived: -s_col(A,B,C) | -s_e(A,D,E,F) | -s_e(B,D,insert(A,B,E,V6),F) | sAlarm clock 119.53/120.03 Prover9 interrupted 119.53/120.03 EOF