%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX206-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n018.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.77s 1.04s % Output : Refutation 0.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX206-1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s % 0.14/0.33 % Computer : n018.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.33 % CPULimit : 300 % 0.14/0.33 % WCLimit : 300 % 0.14/0.33 % DateTime : Wed Apr 29 00:58:16 EDT 2026 % 0.14/0.33 % CPUTime : % 0.77/1.04 ============================== Prover9 =============================== % 0.77/1.04 Prover9 (32) version 2009-11A, November 2009. % 0.77/1.04 Process 19046 was started by sandbox2 on n018.cluster.edu, % 0.77/1.04 Wed Apr 29 00:58:17 2026 % 0.77/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18893_n018.cluster.edu". % 0.77/1.04 ============================== end of head =========================== % 0.77/1.04 % 0.77/1.04 ============================== INPUT ================================= % 0.77/1.04 % 0.77/1.04 % Reading from file /tmp/Prover9_18893_n018.cluster.edu % 0.77/1.04 % 0.77/1.04 set(prolog_style_variables). % 0.77/1.04 set(auto2). % 0.77/1.04 % set(auto2) -> set(auto). % 0.77/1.04 % set(auto) -> set(auto_inference). % 0.77/1.04 % set(auto) -> set(auto_setup). % 0.77/1.04 % set(auto_setup) -> set(predicate_elim). % 0.77/1.04 % set(auto_setup) -> assign(eq_defs, unfold). % 0.77/1.04 % set(auto) -> set(auto_limits). % 0.77/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.77/1.04 % set(auto_limits) -> assign(sos_limit, 20000). % 0.77/1.04 % set(auto) -> set(auto_denials). % 0.77/1.04 % set(auto) -> set(auto_process). % 0.77/1.04 % set(auto2) -> assign(new_constants, 1). % 0.77/1.04 % set(auto2) -> assign(fold_denial_max, 3). % 0.77/1.04 % set(auto2) -> assign(max_weight, "200.000"). % 0.77/1.04 % set(auto2) -> assign(max_hours, 1). % 0.77/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.77/1.04 % set(auto2) -> assign(max_seconds, 0). % 0.77/1.04 % set(auto2) -> assign(max_minutes, 5). % 0.77/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.77/1.04 % set(auto2) -> set(sort_initial_sos). % 0.77/1.04 % set(auto2) -> assign(sos_limit, -1). % 0.77/1.04 % set(auto2) -> assign(lrs_ticks, 3000). % 0.77/1.04 % set(auto2) -> assign(max_megs, 400). % 0.77/1.04 % set(auto2) -> assign(stats, some). % 0.77/1.04 % set(auto2) -> clear(echo_input). % 0.77/1.04 % set(auto2) -> set(quiet). % 0.77/1.04 % set(auto2) -> clear(print_initial_clauses). % 0.77/1.04 % set(auto2) -> clear(print_given). % 0.77/1.04 assign(lrs_ticks,-1). % 0.77/1.04 assign(sos_limit,10000). % 0.77/1.04 assign(order,kbo). % 0.77/1.04 set(lex_order_vars). % 0.77/1.04 clear(print_given). % 0.77/1.04 % 0.77/1.04 % formulas(sos). % not echoed (13 formulas) % 0.77/1.04 % 0.77/1.04 ============================== end of input ========================== % 0.77/1.04 % 0.77/1.04 % From the command line: assign(max_seconds, 300). % 0.77/1.04 % 0.77/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.77/1.04 % 0.77/1.04 % Formulas that are not ordinary clauses: % 0.77/1.04 % 0.77/1.04 ============================== end of process non-clausal formulas === % 0.77/1.04 % 0.77/1.04 ============================== PROCESS INITIAL CLAUSES =============== % 0.77/1.04 % 0.77/1.04 ============================== PREDICATE ELIMINATION ================= % 0.77/1.04 % 0.77/1.04 ============================== end predicate elimination ============= % 0.77/1.04 % 0.77/1.04 Auto_denials: % 0.77/1.04 % copying label goal to answer in negative clause % 0.77/1.04 % 0.77/1.04 Term ordering decisions: % 0.77/1.04 Function symbol KB weights: bfalse=1. btrue=1. z=1. eq=1. eq2=1. x2=1. impl=1. s=1. plus_not_idem=1. % 0.77/1.04 % 0.77/1.04 ============================== end of process initial clauses ======== % 0.77/1.04 % 0.77/1.04 ============================== CLAUSES FOR SEARCH ==================== % 0.77/1.04 % 0.77/1.04 ============================== end of clauses for search ============= % 0.77/1.04 % 0.77/1.04 ============================== SEARCH ================================ % 0.77/1.04 % 0.77/1.04 % Starting search at 0.01 seconds. % 0.77/1.04 % 0.77/1.04 ============================== PROOF ================================= % 0.77/1.04 % SZS status Unsatisfiable % 0.77/1.04 % SZS output start Refutation % 0.77/1.04 % 0.77/1.04 % Proof 1 at 0.01 (+ 0.00) seconds: goal. % 0.77/1.04 % Length of proof is 10. % 0.77/1.04 % Level of proof is 3. % 0.77/1.04 % Maximum clause weight is 11.000. % 0.77/1.04 % Given clauses 13. % 0.77/1.04 % 0.77/1.04 1 impl(btrue,A) = A # label(axiom) # label(axiom). [assumption]. % 0.77/1.04 3 x2(z,A) = A # label(axiom_002) # label(axiom). [assumption]. % 0.77/1.04 5 eq2(btrue,bfalse) = bfalse # label(axiom_006) # label(axiom). [assumption]. % 0.77/1.04 6 eq(A,A) = btrue # label(axiom_010) # label(axiom). [assumption]. % 0.77/1.04 7 eq2(A,A) = btrue # label(axiom_011) # label(axiom). [assumption]. % 0.77/1.04 13 plus_not_idem(A) = impl(eq(x2(A,A),A),eq2(btrue,bfalse)) # label(axiom_004) # label(axiom). [assumption]. % 0.77/1.04 14 plus_not_idem(A) = impl(eq(x2(A,A),A),bfalse). [copy(13),rewrite([5(6)])]. % 0.77/1.04 15 eq2(plus_not_idem(A),bfalse) != btrue # label(goal) # label(negated_conjecture) # answer(goal). [assumption]. % 0.77/1.04 16 eq2(impl(eq(x2(A,A),A),bfalse),bfalse) != btrue # answer(goal). [copy(15),rewrite([14(1)])]. % 0.77/1.04 22 $F # answer(goal). [para(3(a,1),16(a,1,1,1,1)),rewrite([6(3),1(3),7(3)]),xx(a)]. % 0.77/1.04 % 0.77/1.04 % SZS output end Refutation % 0.77/1.04 ============================== end of proof ========================== % 0.77/1.04 % 0.77/1.04 ============================== STATISTICS ============================ % 0.77/1.04 % 0.77/1.04 Given=13. Generated=40. Kept=18. proofs=1. % 0.77/1.04 Usable=13. Sos=5. Demods=17. Limbo=0, Disabled=13. Hints=0. % 0.77/1.04 Megabytes=0.04. % 0.77/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.77/1.04 % 0.77/1.04 ============================== end of statistics ===================== % 0.77/1.04 % 0.77/1.04 ============================== end of search ========================= % 0.77/1.04 % 0.77/1.04 THEOREM PROVED % 0.77/1.04 % SZS status Unsatisfiable % 0.77/1.04 % 0.77/1.04 Exiting with 1 proof. % 0.77/1.04 % 0.77/1.04 Process 19046 exit (max_proofs) Wed Apr 29 00:58:17 2026 % 0.77/1.04 Prover9 interrupted %------------------------------------------------------------------------------