%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX190-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n022.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 : Unsatisfiable 0.77s 1.14s % Output : Refutation 0.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX190-1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s % 0.17/0.34 % Computer : n022.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Apr 28 23:50:06 EDT 2026 % 0.17/0.34 % CPUTime : % 0.77/1.14 ============================== Prover9 =============================== % 0.77/1.14 Prover9 (32) version 2009-11A, November 2009. % 0.77/1.14 Process 18732 was started by sandbox2 on n022.cluster.edu, % 0.77/1.14 Tue Apr 28 23:50:06 2026 % 0.77/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18579_n022.cluster.edu". % 0.77/1.14 ============================== end of head =========================== % 0.77/1.14 % 0.77/1.14 ============================== INPUT ================================= % 0.77/1.14 % 0.77/1.14 % Reading from file /tmp/Prover9_18579_n022.cluster.edu % 0.77/1.14 % 0.77/1.14 set(prolog_style_variables). % 0.77/1.14 set(auto2). % 0.77/1.14 % set(auto2) -> set(auto). % 0.77/1.14 % set(auto) -> set(auto_inference). % 0.77/1.14 % set(auto) -> set(auto_setup). % 0.77/1.14 % set(auto_setup) -> set(predicate_elim). % 0.77/1.14 % set(auto_setup) -> assign(eq_defs, unfold). % 0.77/1.14 % set(auto) -> set(auto_limits). % 0.77/1.14 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.77/1.14 % set(auto_limits) -> assign(sos_limit, 20000). % 0.77/1.14 % set(auto) -> set(auto_denials). % 0.77/1.14 % set(auto) -> set(auto_process). % 0.77/1.14 % set(auto2) -> assign(new_constants, 1). % 0.77/1.14 % set(auto2) -> assign(fold_denial_max, 3). % 0.77/1.14 % set(auto2) -> assign(max_weight, "200.000"). % 0.77/1.14 % set(auto2) -> assign(max_hours, 1). % 0.77/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.77/1.14 % set(auto2) -> assign(max_seconds, 0). % 0.77/1.14 % set(auto2) -> assign(max_minutes, 5). % 0.77/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.77/1.14 % set(auto2) -> set(sort_initial_sos). % 0.77/1.14 % set(auto2) -> assign(sos_limit, -1). % 0.77/1.14 % set(auto2) -> assign(lrs_ticks, 3000). % 0.77/1.14 % set(auto2) -> assign(max_megs, 400). % 0.77/1.14 % set(auto2) -> assign(stats, some). % 0.77/1.14 % set(auto2) -> clear(echo_input). % 0.77/1.14 % set(auto2) -> set(quiet). % 0.77/1.14 % set(auto2) -> clear(print_initial_clauses). % 0.77/1.14 % set(auto2) -> clear(print_given). % 0.77/1.14 assign(lrs_ticks,-1). % 0.77/1.14 assign(sos_limit,10000). % 0.77/1.14 assign(order,kbo). % 0.77/1.14 set(lex_order_vars). % 0.77/1.14 clear(print_given). % 0.77/1.14 % 0.77/1.14 % formulas(sos). % not echoed (90 formulas) % 0.77/1.14 % 0.77/1.14 ============================== end of input ========================== % 0.77/1.14 % 0.77/1.14 % From the command line: assign(max_seconds, 300). % 0.77/1.14 % 0.77/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.77/1.14 % 0.77/1.14 % Formulas that are not ordinary clauses: % 0.77/1.14 % 0.77/1.14 ============================== end of process non-clausal formulas === % 0.77/1.14 % 0.77/1.14 ============================== PROCESS INITIAL CLAUSES =============== % 0.77/1.14 % 0.77/1.14 ============================== PREDICATE ELIMINATION ================= % 0.77/1.14 % 0.77/1.14 ============================== end predicate elimination ============= % 0.77/1.14 % 0.77/1.14 Auto_denials: % 0.77/1.14 % copying label goal to answer in negative clause % 0.77/1.14 % 0.77/1.14 Term ordering decisions: % 0.77/1.14 Function symbol KB weights: x2=1. bfalse=1. z=1. btrue=1. x=1. y=1. eq2=1. fail32=1. fail1=1. fail22=1. fail12=1. fail=1. fail3=1. fail2=1. eq=1. fail4=1. addNat=1. mulNat=1. eq3=1. n=1. s=1. opt=1. d=1. prop4=1. aux=1. % 0.77/1.14 % 0.77/1.14 ============================== end of process initial clauses ======== % 0.77/1.14 % 0.77/1.14 ============================== CLAUSES FOR SEARCH ==================== % 0.77/1.14 % 0.77/1.14 ============================== end of clauses for search ============= % 0.77/1.14 % 0.77/1.14 ============================== SEARCH ================================ % 0.77/1.14 % 0.77/1.14 % Starting search at 0.02 seconds. % 0.77/1.14 % 0.77/1.14 ============================== PROOF ================================= % 0.77/1.14 % SZS status Unsatisfiable % 0.77/1.14 % SZS output start Refutation % 0.77/1.14 % 0.77/1.14 % Proof 1 at 0.10 (+ 0.01) seconds: goal. % 0.77/1.14 % Length of proof is 14. % 0.77/1.14 % Level of proof is 5. % 0.77/1.14 % Maximum clause weight is 12.000. % 0.77/1.14 % Given clauses 181. % 0.77/1.14 % 0.77/1.14 8 eq3(A,A) = btrue # label(axiom_088) # label(axiom). [assumption]. % 0.77/1.14 10 d(n(A)) = n(z) # label(axiom_043) # label(axiom). [assumption]. % 0.77/1.14 31 opt(x(n(z),A)) = A # label(axiom_052) # label(axiom). [assumption]. % 0.77/1.14 41 eq2(x(A,B),n(C)) = bfalse # label(axiom_074) # label(axiom). [assumption]. % 0.77/1.14 63 d(x(A,B)) = x(d(A),d(B)) # label(axiom_044) # label(axiom). [assumption]. % 0.77/1.14 64 x(d(A),d(B)) = d(x(A,B)). [copy(63),flip(a)]. % 0.77/1.14 83 prop4(A) = eq2(opt(d(A)),opt(d(opt(A)))) # label(axiom_063) # label(axiom). [assumption]. % 0.77/1.14 111 eq3(prop4(A),bfalse) != btrue # label(goal) # label(negated_conjecture) # answer(goal). [assumption]. % 0.77/1.14 112 eq3(eq2(opt(d(A)),opt(d(opt(A)))),bfalse) != btrue # answer(goal). [copy(111),rewrite([83(1)])]. % 0.77/1.14 140 d(x(n(A),B)) = x(n(z),d(B)). [para(10(a,1),64(a,1,1)),flip(a)]. % 0.77/1.14 437 eq3(eq2(d(A),opt(d(A))),bfalse) != btrue # answer(goal). [para(31(a,1),112(a,1,1,2,1,1)),rewrite([140(4),31(5)])]. % 0.77/1.14 865 opt(d(x(n(A),B))) = d(B). [para(140(a,2),31(a,1,1))]. % 0.77/1.14 886 eq3(eq2(x(n(z),d(A)),d(A)),bfalse) != btrue # answer(goal). [para(140(a,1),437(a,1,1,1)),rewrite([865(8)])]. % 0.77/1.14 900 $F # answer(goal). [para(10(a,1),886(a,1,1,1,2)),rewrite([10(7),41(8),8(3)]),xx(a)]. % 0.77/1.14 % 0.77/1.14 % SZS output end Refutation % 0.77/1.14 ============================== end of proof ========================== % 0.77/1.14 % 0.77/1.14 ============================== STATISTICS ============================ % 0.77/1.14 % 0.77/1.14 Given=181. Generated=1842. Kept=873. proofs=1. % 0.77/1.14 Usable=177. Sos=675. Demods=648. Limbo=0, Disabled=111. Hints=0. % 0.77/1.14 Megabytes=1.25. % 0.77/1.14 User_CPU=0.10, System_CPU=0.01, Wall_clock=0. % 0.77/1.14 % 0.77/1.14 ============================== end of statistics ===================== % 0.77/1.14 % 0.77/1.14 ============================== end of search ========================= % 0.77/1.14 % 0.77/1.14 THEOREM PROVED % 0.77/1.14 % SZS status Unsatisfiable % 0.77/1.14 % 0.77/1.14 Exiting with 1 proof. % 0.77/1.14 % 0.77/1.14 Process 18732 exit (max_proofs) Tue Apr 28 23:50:06 2026 % 0.77/1.14 Prover9 interrupted %------------------------------------------------------------------------------