%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX194+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n019.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Apr 29 02:38:03 PM UTC 2026 % Result : Timeout 299.75s 300.03s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWX194+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s % 0.15/0.33 % Computer : n019.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Wed Apr 29 00:06:58 EDT 2026 % 0.15/0.33 % CPUTime : % 0.41/1.02 ============================== Prover9 =============================== % 0.41/1.02 Prover9 (32) version 2009-11A, November 2009. % 0.41/1.02 Process 15786 was started by sandbox on n019.cluster.edu, % 0.41/1.02 Wed Apr 29 00:06:59 2026 % 0.41/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15633_n019.cluster.edu". % 0.41/1.02 ============================== end of head =========================== % 0.41/1.02 % 0.41/1.02 ============================== INPUT ================================= % 0.41/1.02 % 0.41/1.02 % Reading from file /tmp/Prover9_15633_n019.cluster.edu % 0.41/1.02 % 0.41/1.02 set(prolog_style_variables). % 0.41/1.02 set(auto2). % 0.41/1.02 % set(auto2) -> set(auto). % 0.41/1.02 % set(auto) -> set(auto_inference). % 0.41/1.02 % set(auto) -> set(auto_setup). % 0.41/1.02 % set(auto_setup) -> set(predicate_elim). % 0.41/1.02 % set(auto_setup) -> assign(eq_defs, unfold). % 0.41/1.02 % set(auto) -> set(auto_limits). % 0.41/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.41/1.02 % set(auto_limits) -> assign(sos_limit, 20000). % 0.41/1.02 % set(auto) -> set(auto_denials). % 0.41/1.02 % set(auto) -> set(auto_process). % 0.41/1.02 % set(auto2) -> assign(new_constants, 1). % 0.41/1.02 % set(auto2) -> assign(fold_denial_max, 3). % 0.41/1.02 % set(auto2) -> assign(max_weight, "200.000"). % 0.41/1.02 % set(auto2) -> assign(max_hours, 1). % 0.41/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.41/1.02 % set(auto2) -> assign(max_seconds, 0). % 0.41/1.02 % set(auto2) -> assign(max_minutes, 5). % 0.41/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.41/1.02 % set(auto2) -> set(sort_initial_sos). % 0.41/1.02 % set(auto2) -> assign(sos_limit, -1). % 0.41/1.02 % set(auto2) -> assign(lrs_ticks, 3000). % 0.41/1.02 % set(auto2) -> assign(max_megs, 400). % 0.41/1.02 % set(auto2) -> assign(stats, some). % 0.41/1.02 % set(auto2) -> clear(echo_input). % 0.41/1.02 % set(auto2) -> set(quiet). % 0.41/1.02 % set(auto2) -> clear(print_initial_clauses). % 0.41/1.02 % set(auto2) -> clear(print_given). % 0.41/1.02 assign(lrs_ticks,-1). % 0.41/1.02 assign(sos_limit,10000). % 0.41/1.02 assign(order,kbo). % 0.41/1.02 set(lex_order_vars). % 0.41/1.02 clear(print_given). % 0.41/1.02 % 0.41/1.02 % formulas(sos). % not echoed (72 formulas) % 0.41/1.02 % 0.41/1.02 ============================== end of input ========================== % 0.41/1.02 % 0.41/1.02 % From the command line: assign(max_seconds, 300). % 0.41/1.02 % 0.41/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.41/1.02 % 0.41/1.02 % Formulas that are not ordinary clauses: % 0.41/1.02 1 (all X all X2 head(cons(X,X2)) = X) # label(axiom_001) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 2 (all X all X2 tail(cons(X,X2)) = X2) # label(axiom_002) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 3 (all X all X2 nil != cons(X,X2)) # label(axiom_003) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 4 (all X proj1Suc(suc(X)) = X) # label(axiom_004) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 5 (all X zero != suc(X)) # label(axiom_005) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 6 (all X proj1N(n(X)) = X) # label(axiom_006) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 7 (all X all X2 proj1Add(add(X,X2)) = X) # label(axiom_007) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 8 (all X all X2 proj2Add(add(X,X2)) = X2) # label(axiom_008) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 9 (all X all X2 proj1Mul(mul(X,X2)) = X) # label(axiom_009) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 10 (all X all X2 proj2Mul(mul(X,X2)) = X2) # label(axiom_010) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 11 (all X all X2 proj1Eq(eq(X,X2)) = X) # label(axiom_011) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 12 (all X all X2 proj2Eq(eq(X,X2)) = X2) # label(axiom_012) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 13 (all X proj1V(v(X)) = X) # label(axiom_013) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 14 (all X all X2 all X3 n(X) != add(X2,X3)) # label(axiom_014) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 15 (all X all X2 all X3 n(X) != mul(X2,X3)) # label(axiom_015) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 16 (all X all X2 all X3 n(X) != eq(X2,X3)) # label(axiom_016) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 17 (all X all X2 n(X) != v(X2)) # label(axiom_017) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 18 (all X all X2 all X3 all X4 add(X,X2) != mul(X3,X4)) # label(axiom_018) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 19 (all X all X2 all X3 all X4 add(X,X2) != eq(X3,X4)) # label(axiom_019) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 20 (all X all X2 all X3 add(X,X2) != v(X3)) # label(axiom_020) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 21 (all X all X2 all X3 all X4 mul(X,X2) != eq(X3,X4)) # label(axiom_021) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 22 (all X all X2 all X3 mul(X,X2) != v(X3)) # label(axiom_022) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 23 (all X all X2 all X3 eq(X,X2) != v(X3)) # label(axiom_023) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 24 (all Y all B (Y = B -> fail1(Y,B) = mul(n(suc(suc(zero))),Y))) # label(axiom_024) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 25 (all Y all B (Y != B -> (Y != add(proj1Add(Y),proj2Add(Y)) -> (Y != v(proj1V(Y)) -> fail1(Y,B) = add(Y,B))))) # label(axiom_025) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 26 (all B all A all B1 (add(A,B1) != B -> fail1(add(A,B1),B) = add(A,add(B1,B)))) # label(axiom_026) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 27 (all B all Z (v(Z) != B -> (B != v(proj1V(B)) -> fail1(v(Z),B) = add(v(Z),B)))) # label(axiom_027) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 28 (all Z all Y2 (Z != Y2 -> (Z = Z -> fail1(v(Z),v(Y2)) = mul(n(suc(suc(zero))),v(Z))))) # label(axiom_028) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 29 (all Z all Y2 (Z != Y2 -> (Z != Z -> fail1(v(Z),v(Y2)) = add(v(Z),v(Y2))))) # label(axiom_029) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 30 (all Y all B (B != n(proj1N(B)) -> fail(Y,B) = fail1(Y,B))) # label(axiom_030) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 31 (all Y fail(Y,n(zero)) = Y) # label(axiom_031) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 32 (all Y all X3 fail(Y,n(suc(X3))) = fail1(Y,n(suc(X3)))) # label(axiom_032) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 33 (all X6 all C (X6 != mul(proj1Mul(X6),proj2Mul(X6)) -> fail3(X6,C) = mul(X6,C))) # label(axiom_033) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 34 (all C all A2 all B12 fail3(mul(A2,B12),C) = mul(A2,mul(B12,C))) # label(axiom_034) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 35 (all X6 all C (C != n(proj1N(C)) -> fail22(X6,C) = fail3(X6,C))) # label(axiom_035) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 36 (all X6 fail22(X6,n(zero)) = fail3(X6,n(zero))) # label(axiom_036) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 37 (all X6 fail22(X6,n(suc(zero))) = X6) # label(axiom_037) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 38 (all X6 all X9 fail22(X6,n(suc(suc(X9)))) = fail3(X6,n(suc(suc(X9))))) # label(axiom_038) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 39 (all X6 all C (X6 != n(proj1N(X6)) -> fail12(X6,C) = fail22(X6,C))) # label(axiom_039) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 40 (all C fail12(n(zero),C) = fail22(n(zero),C)) # label(axiom_040) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 41 (all C fail12(n(suc(zero)),C) = C) # label(axiom_041) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 42 (all C all X12 fail12(n(suc(suc(X12))),C) = fail22(n(suc(suc(X12))),C)) # label(axiom_042) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 43 (all X6 all C (C != n(proj1N(C)) -> fail2(X6,C) = fail12(X6,C))) # label(axiom_043) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 44 (all X6 fail2(X6,n(zero)) = n(zero)) # label(axiom_044) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 45 (all X6 all X14 fail2(X6,n(suc(X14))) = fail12(X6,n(suc(X14)))) # label(axiom_045) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 46 (all X (X != add(proj1Add(X),proj2Add(X)) -> (X != mul(proj1Mul(X),proj2Mul(X)) -> (X != eq(proj1Eq(X),proj2Eq(X)) -> step1(X) = X)))) # label(axiom_046) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 47 (all Y all B (Y != n(proj1N(Y)) -> step1(add(Y,B)) = fail(Y,B))) # label(axiom_047) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 48 (all B step1(add(n(zero),B)) = B) # label(axiom_048) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 49 (all B all X5 step1(add(n(suc(X5)),B)) = fail(n(suc(X5)),B)) # label(axiom_049) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 50 (all X6 all C (X6 != n(proj1N(X6)) -> step1(mul(X6,C)) = fail2(X6,C))) # label(axiom_050) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 51 (all C step1(mul(n(zero),C)) = n(zero)) # label(axiom_051) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 52 (all C all X16 step1(mul(n(suc(X16)),C)) = fail2(n(suc(X16)),C)) # label(axiom_052) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 53 (all A3 all B2 (A3 = B2 -> step1(eq(A3,B2)) = n(suc(zero)))) # label(axiom_053) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 54 (all A3 all B2 (A3 != B2 -> step1(eq(A3,B2)) = eq(A3,B2))) # label(axiom_054) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 55 (all X (X != add(proj1Add(X),proj2Add(X)) -> (X != mul(proj1Mul(X),proj2Mul(X)) -> (X != eq(proj1Eq(X),proj2Eq(X)) -> simp1(X) = step1(X))))) # label(axiom_055) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 56 (all A all B simp1(add(A,B)) = step1(add(simp1(A),simp1(B)))) # label(axiom_056) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 57 (all C all B2 simp1(mul(C,B2)) = step1(mul(simp1(C),simp1(B2)))) # label(axiom_057) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 58 (all A2 all B3 simp1(eq(A2,B3)) = step1(eq(simp1(A2),simp1(B3)))) # label(axiom_058) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 59 (all Y fetch(nil,Y) = zero) # label(axiom_059) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 60 (all N all St fetch(cons(N,St),zero) = N) # label(axiom_060) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 61 (all N all St all Z fetch(cons(N,St),suc(Z)) = fetch(St,Z)) # label(axiom_061) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 62 (all Y addNat(zero,Y) = Y) # label(axiom_062) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 63 (all Y all Z addNat(suc(Z),Y) = suc(addNat(Z,Y))) # label(axiom_063) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 64 (all Y mulNat(zero,Y) = zero) # label(axiom_064) # label(axiom) # label(non_clause). [assumption]. % 0.41/1.02 65 (all Y all Z mulNat(suc(Z),Y) = addNat(Y,mulNat(Z,Y))) # label(axiom_065) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 66 (all X all N eval(X,n(N)) = N) # label(axiom_066) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 67 (all X all A all B eval(X,add(A,B)) = addNat(eval(X,A),eval(X,B))) # label(axiom_067) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 68 (all X all C all B2 eval(X,mul(C,B2)) = mulNat(eval(X,C),eval(X,B2))) # label(axiom_068) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 69 (all X all A2 all B3 (eval(X,A2) = eval(X,B3) -> eval(X,eq(A2,B3)) = suc(zero))) # label(axiom_069) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 70 (all X all A2 all B3 (eval(X,A2) != eval(X,B3) -> eval(X,eq(A2,B3)) = zero)) # label(axiom_070) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 71 (all X all Z eval(X,v(Z)) = fetch(X,Z)) # label(axiom_071) # label(axiom) # label(non_clause). [assumption]. % 0.75/1.02 72 -(exists St exists A eval(St,A) != eval(St,simp1(A))) # label(goal_072) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.75/1.02 % 0.75/1.02 ============================== end of process non-clausal formulas === % 0.75/1.02 % 0.75/1.02 ============================== PROCESS INITIAL CLAUSES =============== % 0.75/1.02 % 0.75/1.02 ============================== PREDICATE ELIMINATION ================= % 0.75/1.02 % 0.75/1.02 ============================== end predicate elimination ============= % 0.75/1.02 % 0.75/1.02 Auto_denials: (non-Horn, no changes). % 0.75/1.02 % 0.75/1.02 Term ordering decisions: % 0.75/1.02 Function symbol KB weights: zero=1. nil=1. add=1. mul=1. eval=1. eq=1. fail1=1. fail22=1. fail12=1. addNat=1. fail=1. fail2=1. fail3=1. fetch=1. cons=1. mulNat=1. n=1. suc=1. v=1. step1=1. simp1=1. proj1N=1. proj1Add=1. proj1Mul=1. proj2Add=1. proj2Mul=1. proj1Eq=1. proj1V=1. proj2Eq=1. head=1. proj1Suc=1. tail=1. % 0.75/1.02 % 0.75/1.02 ============================== end of process initial clauses ======== % 0.75/1.02 % 0.75/1.02 ============================== CLAUSES FOR SEARCH ==================== % 0.75/1.02 % 0.75/1.02 ============================== end of clauses for search ============= % 0.75/1.02 % 0.75/1.02 ============================== SEARCH ================================ % 0.75/1.02 % 0.75/1.02 % Starting search at 0.01 secondTerminated % 299.75/300.03 Prover9 interrupted %------------------------------------------------------------------------------