%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n016.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:04 PM UTC 2026 % Result : Unsatisfiable 0.75s 1.04s % Output : Refutation 0.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.13 % Command : tptp2X_and_run_prover9 %d %s % 0.17/0.35 % Computer : n016.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Wed Apr 29 00:36:36 EDT 2026 % 0.17/0.35 % CPUTime : % 0.75/1.04 ============================== Prover9 =============================== % 0.75/1.04 Prover9 (32) version 2009-11A, November 2009. % 0.75/1.04 Process 5347 was started by sandbox on n016.cluster.edu, % 0.75/1.04 Wed Apr 29 00:36:36 2026 % 0.75/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5193_n016.cluster.edu". % 0.75/1.04 ============================== end of head =========================== % 0.75/1.04 % 0.75/1.04 ============================== INPUT ================================= % 0.75/1.04 % 0.75/1.04 % Reading from file /tmp/Prover9_5193_n016.cluster.edu % 0.75/1.04 % 0.75/1.04 set(prolog_style_variables). % 0.75/1.04 set(auto2). % 0.75/1.04 % set(auto2) -> set(auto). % 0.75/1.04 % set(auto) -> set(auto_inference). % 0.75/1.04 % set(auto) -> set(auto_setup). % 0.75/1.04 % set(auto_setup) -> set(predicate_elim). % 0.75/1.04 % set(auto_setup) -> assign(eq_defs, unfold). % 0.75/1.04 % set(auto) -> set(auto_limits). % 0.75/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.75/1.04 % set(auto_limits) -> assign(sos_limit, 20000). % 0.75/1.04 % set(auto) -> set(auto_denials). % 0.75/1.04 % set(auto) -> set(auto_process). % 0.75/1.04 % set(auto2) -> assign(new_constants, 1). % 0.75/1.04 % set(auto2) -> assign(fold_denial_max, 3). % 0.75/1.04 % set(auto2) -> assign(max_weight, "200.000"). % 0.75/1.04 % set(auto2) -> assign(max_hours, 1). % 0.75/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.75/1.04 % set(auto2) -> assign(max_seconds, 0). % 0.75/1.04 % set(auto2) -> assign(max_minutes, 5). % 0.75/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.75/1.04 % set(auto2) -> set(sort_initial_sos). % 0.75/1.04 % set(auto2) -> assign(sos_limit, -1). % 0.75/1.04 % set(auto2) -> assign(lrs_ticks, 3000). % 0.75/1.04 % set(auto2) -> assign(max_megs, 400). % 0.75/1.04 % set(auto2) -> assign(stats, some). % 0.75/1.04 % set(auto2) -> clear(echo_input). % 0.75/1.04 % set(auto2) -> set(quiet). % 0.75/1.04 % set(auto2) -> clear(print_initial_clauses). % 0.75/1.04 % set(auto2) -> clear(print_given). % 0.75/1.04 assign(lrs_ticks,-1). % 0.75/1.04 assign(sos_limit,10000). % 0.75/1.04 assign(order,kbo). % 0.75/1.04 set(lex_order_vars). % 0.75/1.04 clear(print_given). % 0.75/1.04 % 0.75/1.04 % formulas(sos). % not echoed (24 formulas) % 0.75/1.04 % 0.75/1.04 ============================== end of input ========================== % 0.75/1.04 % 0.75/1.04 % From the command line: assign(max_seconds, 300). % 0.75/1.04 % 0.75/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.75/1.04 % 0.75/1.04 % Formulas that are not ordinary clauses: % 0.75/1.04 % 0.75/1.04 ============================== end of process non-clausal formulas === % 0.75/1.04 % 0.75/1.04 ============================== PROCESS INITIAL CLAUSES =============== % 0.75/1.04 % 0.75/1.04 ============================== PREDICATE ELIMINATION ================= % 0.75/1.04 % 0.75/1.04 ============================== end predicate elimination ============= % 0.75/1.04 % 0.75/1.04 Auto_denials: % 0.75/1.04 % copying label goal to answer in negative clause % 0.75/1.04 % 0.75/1.04 Term ordering decisions: % 0.75/1.04 Function symbol KB weights: btrue=1. bfalse=1. nil=1. z=1. cons=1. eq2=1. leqNat=1. merge=1. eq=1. impl=1. prop_merge_ord_not3=1. ord=1. s=1. aux2=1. aux=1. % 0.75/1.04 % 0.75/1.04 ============================== end of process initial clauses ======== % 0.75/1.04 % 0.75/1.04 ============================== CLAUSES FOR SEARCH ==================== % 0.75/1.04 % 0.75/1.04 ============================== end of clauses for search ============= % 0.75/1.04 % 0.75/1.04 ============================== SEARCH ================================ % 0.75/1.04 % 0.75/1.04 % Starting search at 0.01 seconds. % 0.75/1.04 % 0.75/1.04 ============================== PROOF ================================= % 0.75/1.04 % SZS status Unsatisfiable % 0.75/1.04 % SZS output start Refutation % 0.75/1.04 % 0.75/1.04 % Proof 1 at 0.01 (+ 0.00) seconds: goal. % 0.75/1.04 % Length of proof is 20. % 0.75/1.04 % Level of proof is 5. % 0.75/1.04 % Maximum clause weight is 23.000. % 0.75/1.04 % Given clauses 30. % 0.75/1.04 % 0.75/1.04 1 ord(nil) = btrue # label(axiom_010) # label(axiom). [assumption]. % 0.75/1.04 2 btrue = ord(nil). [copy(1),flip(a)]. % 0.75/1.04 5 merge(nil,A) = A # label(axiom_007) # label(axiom). [assumption]. % 0.75/1.04 6 impl(btrue,A) = A # label(axiom_013) # label(axiom). [assumption]. % 0.75/1.04 7 impl(ord(nil),A) = A. [copy(6),rewrite([2(1)])]. % 0.75/1.04 10 eq2(bfalse,btrue) = bfalse # label(axiom_016) # label(axiom). [assumption]. % 0.75/1.04 11 eq2(bfalse,ord(nil)) = bfalse. [copy(10),rewrite([2(2)])]. % 0.75/1.04 16 eq2(A,A) = btrue # label(axiom_022) # label(axiom). [assumption]. % 0.75/1.04 17 eq2(A,A) = ord(nil). [copy(16),rewrite([2(2)])]. % 0.75/1.04 18 leqNat(s(A),z) = bfalse # label(axiom_005) # label(axiom). [assumption]. % 0.75/1.04 23 aux2(A,B,C,bfalse) = bfalse # label(axiom_003) # label(axiom). [assumption]. % 0.75/1.04 33 ord(cons(A,cons(B,C))) = aux2(A,B,C,leqNat(A,B)) # label(axiom_012) # label(axiom). [assumption]. % 0.75/1.04 34 aux2(A,B,C,leqNat(A,B)) = ord(cons(A,cons(B,C))). [copy(33),flip(a)]. % 0.75/1.04 37 prop_merge_ord_not3(A,B) = impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))) # label(axiom_015) # label(axiom). [assumption]. % 0.75/1.04 38 prop_merge_ord_not3(A,B) = impl(eq2(ord(A),ord(nil)),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),ord(nil)))). [copy(37),rewrite([2(3),2(11)])]. % 0.75/1.04 39 eq2(prop_merge_ord_not3(A,B),bfalse) != btrue # label(goal) # label(negated_conjecture) # answer(goal). [assumption]. % 0.75/1.04 40 eq2(impl(eq2(ord(A),ord(nil)),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),ord(nil)))),bfalse) != ord(nil) # answer(goal). [copy(39),rewrite([38(1),2(17)])]. % 0.75/1.04 45 ord(cons(s(A),cons(z,B))) = bfalse. [para(18(a,1),34(a,1,4)),rewrite([23(4)]),flip(a)]. % 0.75/1.04 50 eq2(impl(eq2(ord(A),bfalse),eq2(ord(A),ord(nil))),bfalse) != ord(nil) # answer(goal). [para(5(a,1),40(a,1,1,2,2,1,1)),rewrite([17(5),7(11)])]. % 0.75/1.04 56 $F # answer(goal). [para(45(a,1),50(a,1,1,1,1)),rewrite([17(3),45(7),11(6),7(4),17(3)]),xx(a)]. % 0.75/1.04 % 0.75/1.04 % SZS output end Refutation % 0.75/1.04 ============================== end of proof ========================== % 0.75/1.04 % 0.75/1.04 ============================== STATISTICS ============================ % 0.75/1.04 % 0.75/1.04 Given=30. Generated=109. Kept=39. proofs=1. % 0.75/1.04 Usable=30. Sos=7. Demods=33. Limbo=2, Disabled=24. Hints=0. % 0.75/1.04 Megabytes=0.08. % 0.75/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.75/1.04 % 0.75/1.04 ============================== end of statistics ===================== % 0.75/1.04 % 0.75/1.04 ============================== end of search ========================= % 0.75/1.04 % 0.75/1.04 THEOREM PROVED % 0.75/1.04 % SZS status Unsatisfiable % 0.75/1.04 % 0.75/1.04 Exiting with 1 proof. % 0.75/1.04 % 0.75/1.04 Process 5347 exit (max_proofs) Wed Apr 29 00:36:36 2026 % 0.75/1.04 Prover9 interrupted %------------------------------------------------------------------------------