%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX204-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n028.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:05 PM UTC 2026 % Result : Unsatisfiable 0.43s 1.01s % Output : Refutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX204-1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s % 0.15/0.33 % Computer : n028.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:53:00 EDT 2026 % 0.15/0.34 % CPUTime : % 0.43/1.01 ============================== Prover9 =============================== % 0.43/1.01 Prover9 (32) version 2009-11A, November 2009. % 0.43/1.01 Process 1895 was started by sandbox on n028.cluster.edu, % 0.43/1.01 Wed Apr 29 00:53:00 2026 % 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1733_n028.cluster.edu". % 0.43/1.01 ============================== end of head =========================== % 0.43/1.01 % 0.43/1.01 ============================== INPUT ================================= % 0.43/1.01 % 0.43/1.01 % Reading from file /tmp/Prover9_1733_n028.cluster.edu % 0.43/1.01 % 0.43/1.01 set(prolog_style_variables). % 0.43/1.01 set(auto2). % 0.43/1.01 % set(auto2) -> set(auto). % 0.43/1.01 % set(auto) -> set(auto_inference). % 0.43/1.01 % set(auto) -> set(auto_setup). % 0.43/1.01 % set(auto_setup) -> set(predicate_elim). % 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold). % 0.43/1.01 % set(auto) -> set(auto_limits). % 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000). % 0.43/1.01 % set(auto) -> set(auto_denials). % 0.43/1.01 % set(auto) -> set(auto_process). % 0.43/1.01 % set(auto2) -> assign(new_constants, 1). % 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3). % 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000"). % 0.43/1.01 % set(auto2) -> assign(max_hours, 1). % 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.43/1.01 % set(auto2) -> assign(max_seconds, 0). % 0.43/1.01 % set(auto2) -> assign(max_minutes, 5). % 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.43/1.01 % set(auto2) -> set(sort_initial_sos). % 0.43/1.01 % set(auto2) -> assign(sos_limit, -1). % 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000). % 0.43/1.01 % set(auto2) -> assign(max_megs, 400). % 0.43/1.01 % set(auto2) -> assign(stats, some). % 0.43/1.01 % set(auto2) -> clear(echo_input). % 0.43/1.01 % set(auto2) -> set(quiet). % 0.43/1.01 % set(auto2) -> clear(print_initial_clauses). % 0.43/1.01 % set(auto2) -> clear(print_given). % 0.43/1.01 assign(lrs_ticks,-1). % 0.43/1.01 assign(sos_limit,10000). % 0.43/1.01 assign(order,kbo). % 0.43/1.01 set(lex_order_vars). % 0.43/1.01 clear(print_given). % 0.43/1.01 % 0.43/1.01 % formulas(sos). % not echoed (13 formulas) % 0.43/1.01 % 0.43/1.01 ============================== end of input ========================== % 0.43/1.01 % 0.43/1.01 % From the command line: assign(max_seconds, 300). % 0.43/1.01 % 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.43/1.01 % 0.43/1.01 % Formulas that are not ordinary clauses: % 0.43/1.01 % 0.43/1.01 ============================== end of process non-clausal formulas === % 0.43/1.01 % 0.43/1.01 ============================== PROCESS INITIAL CLAUSES =============== % 0.43/1.01 % 0.43/1.01 ============================== PREDICATE ELIMINATION ================= % 0.43/1.01 % 0.43/1.01 ============================== end predicate elimination ============= % 0.43/1.01 % 0.43/1.01 Auto_denials: % 0.43/1.01 % copying label goal to answer in negative clause % 0.43/1.01 % 0.43/1.01 Term ordering decisions: % 0.43/1.01 Function symbol KB weights: bfalse=1. z=1. btrue=1. eq=1. x2=1. x22=1. eq2=1. s=1. mul_idem=1. % 0.43/1.01 % 0.43/1.01 ============================== end of process initial clauses ======== % 0.43/1.01 % 0.43/1.01 ============================== CLAUSES FOR SEARCH ==================== % 0.43/1.01 % 0.43/1.01 ============================== end of clauses for search ============= % 0.43/1.01 % 0.43/1.01 ============================== SEARCH ================================ % 0.43/1.01 % 0.43/1.01 % Starting search at 0.01 seconds. % 0.43/1.01 % 0.43/1.01 ============================== PROOF ================================= % 0.43/1.01 % SZS status Unsatisfiable % 0.43/1.01 % SZS output start Refutation % 0.43/1.01 % 0.43/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: goal. % 0.43/1.01 % Length of proof is 17. % 0.43/1.01 % Level of proof is 4. % 0.43/1.01 % Maximum clause weight is 11.000. % 0.43/1.01 % Given clauses 29. % 0.43/1.01 % 0.43/1.01 1 x2(z,A) = A # label(axiom) # label(axiom). [assumption]. % 0.43/1.01 2 x22(z,A) = z # label(axiom_002) # label(axiom). [assumption]. % 0.43/1.01 6 eq2(A,A) = btrue # label(axiom_011) # label(axiom). [assumption]. % 0.43/1.01 8 eq(s(A),z) = bfalse # label(axiom_009) # label(axiom). [assumption]. % 0.43/1.01 9 mul_idem(A) = eq(x22(A,A),A) # label(axiom_004) # label(axiom). [assumption]. % 0.43/1.01 10 x2(s(A),B) = s(x2(A,B)) # label(axiom_001) # label(axiom). [assumption]. % 0.43/1.01 11 s(x2(A,B)) = x2(s(A),B). [copy(10),flip(a)]. % 0.43/1.01 12 eq(s(A),s(B)) = eq(A,B) # label(axiom_007) # label(axiom). [assumption]. % 0.43/1.01 13 x22(s(A),B) = x2(B,x22(A,B)) # label(axiom_003) # label(axiom). [assumption]. % 0.43/1.01 14 x2(A,x22(B,A)) = x22(s(B),A). [copy(13),flip(a)]. % 0.43/1.01 15 eq2(mul_idem(A),bfalse) != btrue # label(goal) # label(negated_conjecture) # answer(goal). [assumption]. % 0.43/1.01 16 eq2(eq(x22(A,A),A),bfalse) != btrue # answer(goal). [copy(15),rewrite([9(1)])]. % 0.43/1.01 17 x2(s(z),A) = s(A). [para(1(a,1),11(a,1,1)),flip(a)]. % 0.43/1.01 23 x22(s(z),A) = x2(A,z). [para(2(a,1),14(a,1,2)),flip(a)]. % 0.43/1.01 26 x2(s(s(z)),A) = s(s(A)). [para(17(a,1),11(a,1,1)),flip(a)]. % 0.43/1.01 33 x22(s(s(z)),A) = x2(A,x2(A,z)). [para(23(a,1),14(a,1,2)),flip(a)]. % 0.43/1.01 68 $F # answer(goal). [para(33(a,1),16(a,1,1,1)),rewrite([26(8),26(7),12(9),12(7),8(5),6(3)]),xx(a)]. % 0.43/1.01 % 0.43/1.01 % SZS output end Refutation % 0.43/1.01 ============================== end of proof ========================== % 0.43/1.01 % 0.43/1.01 ============================== STATISTICS ============================ % 0.43/1.01 % 0.43/1.01 Given=29. Generated=184. Kept=64. proofs=1. % 0.43/1.01 Usable=29. Sos=31. Demods=58. Limbo=3, Disabled=14. Hints=0. % 0.43/1.01 Megabytes=0.09. % 0.43/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.43/1.01 % 0.43/1.01 ============================== end of statistics ===================== % 0.43/1.01 % 0.43/1.01 ============================== end of search ========================= % 0.43/1.01 % 0.43/1.01 THEOREM PROVED % 0.43/1.01 % SZS status Unsatisfiable % 0.43/1.01 % 0.43/1.01 Exiting with 1 proof. % 0.43/1.01 % 0.43/1.01 Process 1895 exit (max_proofs) Wed Apr 29 00:53:00 2026 % 0.43/1.01 Prover9 interrupted %------------------------------------------------------------------------------