0.00/0.05	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.06	% Command  : tptp4X_and_run_prover9 1440 /export/starexec/sandbox/benchmark/theBenchmark.p
0.16/0.47	% Computer : n004.cluster.edu
0.16/0.47	% Model    : x86_64 x86_64
0.16/0.47	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.47	% Memory   : 8046.5625MB
0.16/0.47	% OS       : Linux 6.8.0-71-generic
0.16/0.47	% CPULimit : 1440
0.16/0.47	% WCLimit  : 180
0.16/0.47	% DateTime : Mon Jul 27 09:02:23 UTC 2026
0.16/0.48	% CPUTime  : 
0.16/0.48	Running tptp4X_and_run_prover9 1440 /export/starexec/sandbox/benchmark/theBenchmark.p
0.61/0.94	============================== Prover9 ===============================
0.61/0.94	Prover9 (64) version 2009-11A, November 2009.
0.61/0.94	Process 2798531 was started by sandbox on n004,
0.61/0.94	Mon Jul 27 09:02:23 2026
0.61/0.94	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_2798523_n004".
0.61/0.94	============================== end of head ===========================
0.61/0.94	
0.61/0.94	
0.61/0.94	% Starting search at 0.02 seconds.
0.61/0.94	
0.61/0.94	============================== PROOF =================================
0.61/0.94	% SZS status Theorem
0.61/0.94	% SZS output start Refutation
0.61/0.94	
0.61/0.94	% Proof 1 at 0.38 (+ 0.01) seconds.
0.61/0.94	% Length of proof is 36.
0.61/0.94	% Level of proof is 8.
0.61/0.94	% Maximum clause weight is 18.000.
0.61/0.94	% Given clauses 151.
0.61/0.94	
0.61/0.94	10 (all P all C (inner_point(P,C) <-> -end_point(P,C) & incident_c(P,C))) # label(non_clause).  [assumption].
0.61/0.94	14 (all P all C ((all C1 all C2 (part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) & part_of(C1,C) -> part_of(C1,C2) | part_of(C2,C1))) & incident_c(P,C) <-> end_point(P,C))) # label(non_clause).  [assumption].
0.61/0.94	15 (all C all C1 ((all P (incident_c(P,C1) -> incident_c(P,C))) <-> part_of(C1,C))) # label(non_clause).  [assumption].
0.61/0.94	17 (all C all P all Q all R (between_c(C,P,Q,R) <-> (exists Cpp (part_of(Cpp,C) & end_point(R,Cpp) & inner_point(Q,Cpp) & end_point(P,Cpp))) & R != P)) # label(non_clause).  [assumption].
0.61/0.94	18 -(all C all P all Q all R (between_c(C,P,Q,R) -> incident_c(Q,C) & incident_c(R,C) & R != P & R != Q & Q != P & incident_c(P,C))) # label(non_clause).  [assumption].
0.61/0.94	19 -inner_point(A,B) | -end_point(A,B).  [clausify(10)].
0.61/0.94	21 -inner_point(A,B) | incident_c(A,B).  [clausify(10)].
0.61/0.94	25 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)).  [clausify(17)].
0.61/0.94	33 between_c(c1,c2,c3,c4).  [clausify(18)].
0.61/0.94	39 -between_c(A,B,C,D) | D != B.  [clausify(17)].
0.61/0.94	40 incident_c(A,B) | -end_point(A,B).  [clausify(14)].
0.61/0.94	45 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C).  [clausify(15)].
0.61/0.94	54 -between_c(A,B,C,D) | part_of(f14(A,B,C,D),A).  [clausify(17)].
0.61/0.94	55 -between_c(A,B,C,D) | end_point(D,f14(A,B,C,D)).  [clausify(17)].
0.61/0.94	56 -between_c(A,B,C,D) | end_point(B,f14(A,B,C,D)).  [clausify(17)].
0.61/0.94	68 -incident_c(c3,c1) | -incident_c(c4,c1) | c4 = c2 | c4 = c3 | c2 = c3 | -incident_c(c2,c1).  [clausify(18)].
0.61/0.94	69 -incident_c(c3,c1) | -incident_c(c4,c1) | c4 = c2 | c4 = c3 | c3 = c2 | -incident_c(c2,c1).  [copy(68),flip(e)].
0.61/0.94	79 -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(25,b,19,a)].
0.61/0.94	80 -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(25,b,21,a)].
0.61/0.94	103 c4 != c2.  [resolve(39,a,33,a)].
0.61/0.94	105 -incident_c(c3,c1) | -incident_c(c4,c1) | c4 = c3 | c3 = c2 | -incident_c(c2,c1).  [back_unit_del(69),unit_del(c,103)].
0.61/0.94	177 part_of(f14(c1,c2,c3,c4),c1).  [resolve(54,a,33,a)].
0.61/0.94	178 end_point(c4,f14(c1,c2,c3,c4)).  [resolve(55,a,33,a)].
0.61/0.94	179 end_point(c2,f14(c1,c2,c3,c4)).  [resolve(56,a,33,a)].
0.61/0.94	309 -end_point(c3,f14(c1,c2,c3,c4)).  [resolve(79,a,33,a)].
0.61/0.94	310 incident_c(c3,f14(c1,c2,c3,c4)).  [resolve(80,a,33,a)].
0.61/0.94	404 -incident_c(A,f14(c1,c2,c3,c4)) | incident_c(A,c1).  [resolve(177,a,45,c)].
0.61/0.94	409 incident_c(c4,f14(c1,c2,c3,c4)).  [resolve(178,a,40,b)].
0.61/0.94	416 incident_c(c2,f14(c1,c2,c3,c4)).  [resolve(179,a,40,b)].
0.61/0.94	1095 incident_c(c2,c1).  [resolve(404,a,416,a)].
0.61/0.94	1096 incident_c(c4,c1).  [resolve(404,a,409,a)].
0.61/0.94	1097 incident_c(c3,c1).  [resolve(404,a,310,a)].
0.61/0.94	1106 c4 = c3 | c3 = c2.  [back_unit_del(105),unit_del(a,1097),unit_del(b,1096),unit_del(e,1095)].
0.61/0.94	1179 c3 = c2.  [para(1106(a,1),178(a,1)),unit_del(b,309)].
0.61/0.94	1301 -end_point(c2,f14(c1,c2,c2,c4)).  [back_rewrite(309),rewrite([1179(1),1179(4)])].
0.61/0.94	1302 $F.  [back_rewrite(179),rewrite([1179(4)]),unit_del(a,1301)].
0.61/0.94	
0.61/0.94	% SZS output end Refutation
0.61/0.94	============================== end of proof ==========================
0.61/0.94	
0.61/0.94	
0.61/0.94	THEOREM PROVED
0.61/0.94	% SZS status Theorem
0.61/0.94	
0.61/0.94	Exiting with 1 proof.
0.61/0.94	
0.61/0.94	Process 2798531 exit (max_proofs) Mon Jul 27 09:02:24 2026
0.61/0.94	Prover9 ended
0.61/0.95	EOF