%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX211+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n017.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:06 PM UTC 2026 % Result : Timeout 299.76s 300.03s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWX211+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 : n017.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 01:16:12 EDT 2026 % 0.15/0.33 % CPUTime : % 0.41/0.98 ============================== Prover9 =============================== % 0.41/0.98 Prover9 (32) version 2009-11A, November 2009. % 0.41/0.98 Process 4054 was started by sandbox on n017.cluster.edu, % 0.41/0.98 Wed Apr 29 01:16:13 2026 % 0.41/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3899_n017.cluster.edu". % 0.41/0.98 ============================== end of head =========================== % 0.41/0.98 % 0.41/0.98 ============================== INPUT ================================= % 0.41/0.98 % 0.41/0.98 % Reading from file /tmp/Prover9_3899_n017.cluster.edu % 0.41/0.98 % 0.41/0.98 set(prolog_style_variables). % 0.41/0.98 set(auto2). % 0.41/0.98 % set(auto2) -> set(auto). % 0.41/0.98 % set(auto) -> set(auto_inference). % 0.41/0.98 % set(auto) -> set(auto_setup). % 0.41/0.98 % set(auto_setup) -> set(predicate_elim). % 0.41/0.98 % set(auto_setup) -> assign(eq_defs, unfold). % 0.41/0.98 % set(auto) -> set(auto_limits). % 0.41/0.98 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.41/0.98 % set(auto_limits) -> assign(sos_limit, 20000). % 0.41/0.98 % set(auto) -> set(auto_denials). % 0.41/0.98 % set(auto) -> set(auto_process). % 0.41/0.98 % set(auto2) -> assign(new_constants, 1). % 0.41/0.98 % set(auto2) -> assign(fold_denial_max, 3). % 0.41/0.98 % set(auto2) -> assign(max_weight, "200.000"). % 0.41/0.98 % set(auto2) -> assign(max_hours, 1). % 0.41/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.41/0.98 % set(auto2) -> assign(max_seconds, 0). % 0.41/0.98 % set(auto2) -> assign(max_minutes, 5). % 0.41/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.41/0.98 % set(auto2) -> set(sort_initial_sos). % 0.41/0.98 % set(auto2) -> assign(sos_limit, -1). % 0.41/0.98 % set(auto2) -> assign(lrs_ticks, 3000). % 0.41/0.98 % set(auto2) -> assign(max_megs, 400). % 0.41/0.98 % set(auto2) -> assign(stats, some). % 0.41/0.98 % set(auto2) -> clear(echo_input). % 0.41/0.98 % set(auto2) -> set(quiet). % 0.41/0.98 % set(auto2) -> clear(print_initial_clauses). % 0.41/0.98 % set(auto2) -> clear(print_given). % 0.41/0.98 assign(lrs_ticks,-1). % 0.41/0.98 assign(sos_limit,10000). % 0.41/0.98 assign(order,kbo). % 0.41/0.98 set(lex_order_vars). % 0.41/0.98 clear(print_given). % 0.41/0.98 % 0.41/0.98 % formulas(sos). % not echoed (50 formulas) % 0.41/0.98 % 0.41/0.98 ============================== end of input ========================== % 0.41/0.98 % 0.41/0.98 % From the command line: assign(max_seconds, 300). % 0.41/0.98 % 0.41/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.41/0.98 % 0.41/0.98 % Formulas that are not ordinary clauses: % 0.41/0.98 1 (all X all X2 head(cons(X,X2)) = X) # label(axiom_001) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 2 (all X all X2 tail(cons(X,X2)) = X2) # label(axiom_002) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 3 (all X all X2 nil != cons(X,X2)) # label(axiom_003) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 4 (all X proj1Atom(atom(X)) = X) # label(axiom_007) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 5 (all X all X2 proj1(x(X,X2)) = X) # label(axiom_008) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 6 (all X all X2 proj2(x(X,X2)) = X2) # label(axiom_009) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 7 (all X all X2 proj12(y(X,X2)) = X) # label(axiom_010) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 8 (all X all X2 proj22(y(X,X2)) = X2) # label(axiom_011) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 9 (all X proj1Star(star(X)) = X) # label(axiom_012) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 10 (all X nil2 != atom(X)) # label(axiom_014) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 11 (all X all X2 nil2 != x(X,X2)) # label(axiom_015) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 12 (all X all X2 nil2 != y(X,X2)) # label(axiom_016) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 13 (all X nil2 != star(X)) # label(axiom_017) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 14 (all X eps != atom(X)) # label(axiom_018) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 15 (all X all X2 eps != x(X,X2)) # label(axiom_019) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 16 (all X all X2 eps != y(X,X2)) # label(axiom_020) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 17 (all X eps != star(X)) # label(axiom_021) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 18 (all X all X2 all X3 atom(X) != x(X2,X3)) # label(axiom_022) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.98 19 (all X all X2 all X3 atom(X) != y(X2,X3)) # label(axiom_023) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 20 (all X all X2 atom(X) != star(X2)) # label(axiom_024) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 21 (all X all X2 all X3 all X4 x(X,X2) != y(X3,X4)) # label(axiom_025) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 22 (all X all X2 all X3 x(X,X2) != star(X3)) # label(axiom_026) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 23 (all X all X2 all X3 y(X,X2) != star(X3)) # label(axiom_027) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 24 (all X all Y (X != nil2 -> (Y != nil2 -> (X != eps -> (Y != eps -> z(X,Y) = y(X,Y)))))) # label(axiom_028) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 25 (all X (X != nil2 -> (X != eps -> z(X,eps) = X))) # label(axiom_029) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 26 (all Y (Y != nil2 -> z(eps,Y) = Y)) # label(axiom_030) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 27 (all X (X != nil2 -> z(X,nil2) = nil2)) # label(axiom_031) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 28 (all Y z(nil2,Y) = nil2) # label(axiom_032) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 29 (all X all Y (X != nil2 -> (Y != nil2 -> x2(X,Y) = x(X,Y)))) # label(axiom_033) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 30 (all X (X != nil2 -> x2(X,nil2) = X)) # label(axiom_034) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 31 (all Y x2(nil2,Y) = Y) # label(axiom_035) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 32 (all X (X != eps -> (X != x(proj1(X),proj2(X)) -> (X != y(proj12(X),proj22(X)) -> (X != star(proj1Star(X)) -> -eps2(X)))))) # label(axiom_036) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 33 (all P all Q (eps2(x(P,Q)) <-> eps2(P) | eps2(Q))) # label(axiom_038) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 34 (all R all Q2 (eps2(y(R,Q2)) <-> eps2(R) & eps2(Q2))) # label(axiom_039) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 35 (all Y eps2(star(Y))) # label(axiom_040) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 36 (all X all Y (X != atom(proj1Atom(X)) -> (X != x(proj1(X),proj2(X)) -> (X != y(proj12(X),proj22(X)) -> (X != star(proj1Star(X)) -> step(X,Y) = nil2))))) # label(axiom_041) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 37 (all Y all B (B = Y -> step(atom(B),Y) = eps)) # label(axiom_042) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 38 (all Y all B (B != Y -> step(atom(B),Y) = nil2)) # label(axiom_043) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 39 (all Y all P all Q step(x(P,Q),Y) = x(step(P,Y),step(Q,Y))) # label(axiom_044) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 40 (all Y all R all Q2 (eps2(R) -> step(y(R,Q2),Y) = x(y(step(R,Y),Q2),step(Q2,Y)))) # label(axiom_045) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 41 (all Y all R all Q2 (-eps2(R) -> step(y(R,Q2),Y) = x(y(step(R,Y),Q2),nil2))) # label(axiom_046) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 42 (all Y all P2 step(star(P2),Y) = y(step(P2,Y),star(P2))) # label(axiom_047) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 43 (all X (rec(X,nil) <-> eps2(X))) # label(axiom_048) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 44 (all X all Z all Xs (rec(X,cons(Z,Xs)) <-> rec(step(X,Z),Xs))) # label(axiom_049) # label(axiom) # label(non_clause). [assumption]. % 0.41/0.99 45 -(exists P rec(P,cons(a,cons(b,cons(a,cons(b,cons(b,nil))))))) # label(goal_050) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.41/0.99 % 0.41/0.99 ============================== end of process non-clausal formulas === % 0.41/0.99 % 0.41/0.99 ============================== PROCESS INITIAL CLAUSES =============== % 0.41/0.99 % 0.41/0.99 ============================== PREDICATE ELIMINATION ================= % 0.41/0.99 % 0.41/0.99 ============================== end predicate elimination ============= % 0.41/0.99 % 0.41/0.99 Auto_denials: (non-Horn, no changes). % 0.41/0.99 % 0.41/0.99 Term ordering decisions: % 0.41/0.99 Function symbol KB weights: nil2=1. eps=1. nil=1. a=1. b=1. c=1. step=1. y=1. x=1. z=1. cons=1. x2=1. star=1. atom=1. proj1=1. proj12=1. proj1Star=1. proj2=1. proj22=1. proj1Atom=1. head=1. tail=1. % 0.41/0.99 % 0.41/0.99 ============================== end of process initial clauses ======== % 0.41/0.99 % 0.41/0.99 ============================== CLAUSES FOR SEARCH ==================== % 0.41/0.99 % 0.41/0.99 ===Terminated % 299.76/300.03 Prover9 interrupted %------------------------------------------------------------------------------