%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n003.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.88s 1.13s % Output : Refutation 0.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0. % 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s % 0.17/0.35 % Computer : n003.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 01:00:11 EDT 2026 % 0.17/0.35 % CPUTime : % 0.88/1.13 ============================== Prover9 =============================== % 0.88/1.13 Prover9 (32) version 2009-11A, November 2009. % 0.88/1.13 Process 19641 was started by sandbox2 on n003.cluster.edu, % 0.88/1.13 Wed Apr 29 01:00:11 2026 % 0.88/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19488_n003.cluster.edu". % 0.88/1.13 ============================== end of head =========================== % 0.88/1.13 % 0.88/1.13 ============================== INPUT ================================= % 0.88/1.13 % 0.88/1.13 % Reading from file /tmp/Prover9_19488_n003.cluster.edu % 0.88/1.13 % 0.88/1.13 set(prolog_style_variables). % 0.88/1.13 set(auto2). % 0.88/1.13 % set(auto2) -> set(auto). % 0.88/1.13 % set(auto) -> set(auto_inference). % 0.88/1.13 % set(auto) -> set(auto_setup). % 0.88/1.13 % set(auto_setup) -> set(predicate_elim). % 0.88/1.13 % set(auto_setup) -> assign(eq_defs, unfold). % 0.88/1.13 % set(auto) -> set(auto_limits). % 0.88/1.13 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.88/1.13 % set(auto_limits) -> assign(sos_limit, 20000). % 0.88/1.13 % set(auto) -> set(auto_denials). % 0.88/1.13 % set(auto) -> set(auto_process). % 0.88/1.13 % set(auto2) -> assign(new_constants, 1). % 0.88/1.13 % set(auto2) -> assign(fold_denial_max, 3). % 0.88/1.13 % set(auto2) -> assign(max_weight, "200.000"). % 0.88/1.13 % set(auto2) -> assign(max_hours, 1). % 0.88/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.88/1.13 % set(auto2) -> assign(max_seconds, 0). % 0.88/1.13 % set(auto2) -> assign(max_minutes, 5). % 0.88/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.88/1.13 % set(auto2) -> set(sort_initial_sos). % 0.88/1.13 % set(auto2) -> assign(sos_limit, -1). % 0.88/1.13 % set(auto2) -> assign(lrs_ticks, 3000). % 0.88/1.13 % set(auto2) -> assign(max_megs, 400). % 0.88/1.13 % set(auto2) -> assign(stats, some). % 0.88/1.13 % set(auto2) -> clear(echo_input). % 0.88/1.13 % set(auto2) -> set(quiet). % 0.88/1.13 % set(auto2) -> clear(print_initial_clauses). % 0.88/1.13 % set(auto2) -> clear(print_given). % 0.88/1.13 assign(lrs_ticks,-1). % 0.88/1.13 assign(sos_limit,10000). % 0.88/1.13 assign(order,kbo). % 0.88/1.13 set(lex_order_vars). % 0.88/1.13 clear(print_given). % 0.88/1.13 % 0.88/1.13 % formulas(sos). % not echoed (49 formulas) % 0.88/1.13 % 0.88/1.13 ============================== end of input ========================== % 0.88/1.13 % 0.88/1.13 % From the command line: assign(max_seconds, 300). % 0.88/1.13 % 0.88/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.88/1.13 % 0.88/1.13 % Formulas that are not ordinary clauses: % 0.88/1.13 % 0.88/1.13 ============================== end of process non-clausal formulas === % 0.88/1.13 % 0.88/1.13 ============================== PROCESS INITIAL CLAUSES =============== % 0.88/1.13 % 0.88/1.13 ============================== PREDICATE ELIMINATION ================= % 0.88/1.13 % 0.88/1.13 ============================== end predicate elimination ============= % 0.88/1.13 % 0.88/1.13 Auto_denials: % 0.88/1.13 % copying label goal to answer in negative clause % 0.88/1.13 % 0.88/1.13 Term ordering decisions: % 0.88/1.13 Function symbol KB weights: bfalse=1. btrue=1. nil=1. pA=1. pB=1. pE=1. a=1. b=1. eq3=1. cons=1. append=1. eq=1. c2=1. eq2=1. eq4=1. eq5=1. impl=1. unambig=1. aP=1. bP=1. linP=1. linC=1. % 0.88/1.13 % 0.88/1.13 ============================== end of process initial clauses ======== % 0.88/1.13 % 0.88/1.13 ============================== CLAUSES FOR SEARCH ==================== % 0.88/1.13 % 0.88/1.13 ============================== end of clauses for search ============= % 0.88/1.13 % 0.88/1.13 ============================== SEARCH ================================ % 0.88/1.13 % 0.88/1.13 % Starting search at 0.02 seconds. % 0.88/1.13 % 0.88/1.13 ============================== PROOF ================================= % 0.88/1.13 % SZS status Unsatisfiable % 0.88/1.13 % SZS output start Refutation % 0.88/1.13 % 0.88/1.13 % Proof 1 at 0.04 (+ 0.00) seconds: goal. % 0.88/1.13 % Length of proof is 29. % 0.88/1.13 % Level of proof is 7. % 0.88/1.13 % Maximum clause weight is 18.000. % 0.88/1.13 % Given clauses 103. % 0.88/1.13 % 0.88/1.13 1 linP(pE) = nil # label(axiom_008) # label(axiom). [assumption]. % 0.88/1.13 2 impl(btrue,A) = A # label(axiom) # label(axiom). [assumption]. % 0.88/1.13 4 append(nil,A) = A # label(axiom_002) # label(axiom). [assumption]. % 0.88/1.13 5 eq2(a,b) = bfalse # label(axiom_011) # label(axiom). [assumption]. % 0.88/1.13 6 bfalse = eq2(a,b). [copy(5),flip(a)]. % 0.88/1.13 9 eq3(pA,pB) = bfalse # label(axiom_013) # label(axiom). [assumption]. % 0.88/1.13 10 eq2(a,b) = eq3(pA,pB). [copy(9),rewrite([6(4)]),flip(a)]. % 0.88/1.13 17 eq3(pE,pA) = bfalse # label(axiom_017) # label(axiom). [assumption]. % 0.88/1.13 18 eq3(pE,pA) = eq3(pA,pB). [copy(17),rewrite([6(4),10(6)])]. % 0.88/1.13 25 eq(A,A) = btrue # label(axiom_039) # label(axiom). [assumption]. % 0.88/1.13 29 eq5(A,A) = btrue # label(axiom_043) # label(axiom). [assumption]. % 0.88/1.13 30 linP(pA) = cons(a,nil) # label(axiom_006) # label(axiom). [assumption]. % 0.88/1.13 31 cons(a,nil) = linP(pA). [copy(30),flip(a)]. % 0.88/1.13 68 linC(c2(A,B)) = append(linP(A),linP(B)) # label(axiom_009) # label(axiom). [assumption]. % 0.88/1.13 69 append(linP(A),linP(B)) = linC(c2(A,B)). [copy(68),flip(a)]. % 0.88/1.13 70 append(cons(A,B),C) = cons(A,append(B,C)) # label(axiom_003) # label(axiom). [assumption]. % 0.88/1.13 71 unambig(A,B) = impl(eq(linC(A),linC(B)),eq4(A,B)) # label(axiom_010) # label(axiom). [assumption]. % 0.88/1.13 76 eq5(unambig(A,B),bfalse) != btrue # label(goal) # label(negated_conjecture) # answer(goal). [assumption]. % 0.88/1.13 77 eq5(impl(eq(linC(A),linC(B)),eq4(A,B)),eq3(pA,pB)) != btrue # answer(goal). [copy(76),rewrite([71(1),6(6),10(8)])]. % 0.88/1.13 78 eq3(A,B) != bfalse | eq4(c2(A,C),c2(B,D)) = bfalse # label(axiom_037) # label(axiom). [assumption]. % 0.88/1.13 79 eq3(pA,pB) != eq3(A,B) | eq4(c2(A,C),c2(B,D)) = eq3(pA,pB). [copy(78),rewrite([6(2),10(4),6(9),10(11)]),flip(a)]. % 0.88/1.13 91 linC(c2(pE,A)) = linP(A). [para(1(a,1),69(a,1,1)),rewrite([4(3)]),flip(a)]. % 0.88/1.13 93 append(linP(pA),A) = cons(a,A). [para(31(a,1),70(a,1,1)),rewrite([4(6)])]. % 0.88/1.13 115 eq4(c2(pE,A),c2(pA,B)) = eq3(pA,pB). [hyper(79,a,18,a(flip))]. % 0.88/1.13 128 eq5(impl(eq(linP(A),linC(B)),eq4(c2(pE,A),B)),eq3(pA,pB)) != btrue # answer(goal). [para(91(a,1),77(a,1,1,1,1))]. % 0.88/1.13 154 linC(c2(pA,A)) = cons(a,linP(A)). [para(93(a,1),69(a,1)),flip(a)]. % 0.88/1.13 158 eq5(impl(eq(linP(A),cons(a,linP(B))),eq3(pA,pB)),eq3(pA,pB)) != btrue # answer(goal). [para(154(a,1),128(a,1,1,1,2)),rewrite([115(10)])]. % 0.88/1.13 231 eq5(impl(eq(linP(A),linP(pA)),eq3(pA,pB)),eq3(pA,pB)) != btrue # answer(goal). [para(1(a,1),158(a,1,1,1,2,2)),rewrite([31(4)])]. % 0.88/1.13 234 $F # answer(goal). [para(25(a,1),231(a,1,1,1)),rewrite([2(5),29(7)]),xx(a)]. % 0.88/1.13 % 0.88/1.13 % SZS output end Refutation % 0.88/1.13 ============================== end of proof ========================== % 0.88/1.13 % 0.88/1.13 ============================== STATISTICS ============================ % 0.88/1.13 % 0.88/1.13 Given=103. Generated=493. Kept=199. proofs=1. % 0.88/1.13 Usable=98. Sos=81. Demods=98. Limbo=0, Disabled=69. Hints=0. % 0.88/1.13 Megabytes=0.26. % 0.88/1.13 User_CPU=0.04, System_CPU=0.00, Wall_clock=0. % 0.88/1.13 % 0.88/1.13 ============================== end of statistics ===================== % 0.88/1.13 % 0.88/1.13 ============================== end of search ========================= % 0.88/1.13 % 0.88/1.13 THEOREM PROVED % 0.88/1.13 % SZS status Unsatisfiable % 0.88/1.13 % 0.88/1.13 Exiting with 1 proof. % 0.88/1.13 % 0.88/1.13 Process 19641 exit (max_proofs) Wed Apr 29 01:00:11 2026 % 0.88/1.13 Prover9 interrupted %------------------------------------------------------------------------------