0.02/0.10	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer : n008.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit : 1440
0.10/0.31	% WCLimit  : 180
0.10/0.31	% DateTime : Mon Jul  3 04:37:34 EDT 2023
0.10/0.31	% CPUTime  : 
0.74/1.03	============================== Prover9 ===============================
0.74/1.03	Prover9 (32) version 2009-11A, November 2009.
0.74/1.03	Process 27181 was started by sandbox on n008.cluster.edu,
0.74/1.03	Mon Jul  3 04:37:35 2023
0.74/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_27022_n008.cluster.edu".
0.74/1.03	============================== end of head ===========================
0.74/1.03	
0.74/1.03	============================== INPUT =================================
0.74/1.03	
0.74/1.03	% Reading from file /tmp/Prover9_27022_n008.cluster.edu
0.74/1.03	
0.74/1.03	set(prolog_style_variables).
0.74/1.03	set(auto2).
0.74/1.03	    % set(auto2) -> set(auto).
0.74/1.03	    % set(auto) -> set(auto_inference).
0.74/1.03	    % set(auto) -> set(auto_setup).
0.74/1.03	    % set(auto_setup) -> set(predicate_elim).
0.74/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.03	    % set(auto) -> set(auto_limits).
0.74/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.03	    % set(auto) -> set(auto_denials).
0.74/1.03	    % set(auto) -> set(auto_process).
0.74/1.03	    % set(auto2) -> assign(new_constants, 1).
0.74/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.03	    % set(auto2) -> assign(max_hours, 1).
0.74/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.03	    % set(auto2) -> set(sort_initial_sos).
0.74/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.03	    % set(auto2) -> assign(max_megs, 400).
0.74/1.03	    % set(auto2) -> assign(stats, some).
0.74/1.03	    % set(auto2) -> clear(echo_input).
0.74/1.03	    % set(auto2) -> set(quiet).
0.74/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.03	    % set(auto2) -> clear(print_given).
0.74/1.03	assign(lrs_ticks,-1).
0.74/1.03	assign(sos_limit,10000).
0.74/1.03	assign(order,kbo).
0.74/1.03	set(lex_order_vars).
0.74/1.03	clear(print_given).
0.74/1.03	
0.74/1.03	% formulas(sos).  % not echoed (48 formulas)
0.74/1.03	
0.74/1.03	============================== end of input ==========================
0.74/1.03	
0.74/1.03	% From the command line: assign(max_seconds, 1440).
0.74/1.03	
0.74/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.03	
0.74/1.03	% Formulas that are not ordinary clauses:
0.74/1.03	1 (all Event all Time all Fluent all Fluent2 all Offset (initiates(Event,Fluent,Time) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & less(n0,Offset) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	2 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	3 (all Event all Time all Fluent ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	4 (all Fluent all Time (-(exists Event (terminates(Event,Fluent,Time) & happens(Event,Time))) & -releasedAt(Fluent,plus(Time,n1)) & holdsAt(Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	5 (all Time1 all Fluent all Time2 ((exists Event exists Time (less(Time,Time2) & terminates(Event,Fluent,Time) & less(Time1,Time) & happens(Event,Time))) <-> stoppedIn(Time1,Fluent,Time2))) # label(stoppedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	6 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	7 (all Event all Time all Fluent (releases(Event,Fluent,Time) & happens(Event,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	8 (all Fluent all Time (-releasedAt(Fluent,Time) & -(exists Event (releases(Event,Fluent,Time) & happens(Event,Time))) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	9 (all Event all Time all Fluent (terminates(Event,Fluent,Time) & happens(Event,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	10 (all Time1 all Time2 all Fluent ((exists Event exists Time (happens(Event,Time) & less(Time1,Time) & less(Time,Time2) & initiates(Event,Fluent,Time))) <-> startedIn(Time1,Fluent,Time2))) # label(startedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	11 (all Fluent all Time (-(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) & -holdsAt(Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	12 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (-startedIn(Time1,Fluent1,plus(Time1,Time2)) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & less(n0,Time2) & terminates(Event,Fluent1,Time1) & happens(Event,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	13 (all Event all Fluent all Time (happens(push,Time) & spinning = Fluent & Event = pull | -happens(push,Time) & Fluent = backwards & Event = pull | push = Event & -happens(pull,Time) & Fluent = forwards <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	14 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> Event = push & -happens(pull,Time) & backwards = Fluent | spinning = Fluent & -happens(push,Time) & Event = pull | -happens(pull,Time) & Fluent = spinning & push = Event | Event = pull & Fluent = backwards & happens(push,Time) | happens(push,Time) & forwards = Fluent & pull = Event | Event = pull & forwards = Fluent & -happens(push,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	15 (all Event all Time (push = Event & n0 = Time | push = Event & n2 = Time | Time = n2 & pull = Event | Time = n1 & pull = Event <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	16 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	17 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	18 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	19 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	20 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	21 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	22 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.74/1.03	23 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	24 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	25 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	26 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	27 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	28 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	29 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	30 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	
0.74/1.03	============================== end of process non-clausal formulas ===
0.74/1.03	
0.74/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.74/1.03	
0.74/1.03	============================== PREDICATE ELIMINATION =================
0.74/1.04	31 -releasedAt(A,B) | initiates(f4(A,B),A,B) | terminates(f4(A,B),A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom).  [clausify(6)].
0.74/1.04	32 -initiates(A,B,C) | stoppedIn(C,B,plus(C,D)) | -trajectory(B,C,E,D) | -less(n0,D) | -happens(A,C) | holdsAt(E,plus(C,D)) # label(change_holding) # label(axiom).  [clausify(1)].
0.74/1.04	33 -happens(A,B) | -initiates(A,C,B) | holdsAt(C,plus(B,n1)) # label(happens_holds) # label(axiom).  [clausify(2)].
0.74/1.04	34 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(3)].
0.74/1.04	35 -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | startedIn(C,E,D) # label(startedin_defn) # label(axiom).  [clausify(10)].
0.74/1.04	36 initiates(f6(A,B,C),C,f7(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom).  [clausify(10)].
0.74/1.04	Derived: -startedIn(A,B,C) | stoppedIn(f7(A,C,B),B,plus(f7(A,C,B),D)) | -trajectory(B,f7(A,C,B),E,D) | -less(n0,D) | -happens(f6(A,C,B),f7(A,C,B)) | holdsAt(E,plus(f7(A,C,B),D)).  [resolve(36,a,32,a)].
0.74/1.04	Derived: -startedIn(A,B,C) | -happens(f6(A,C,B),f7(A,C,B)) | holdsAt(B,plus(f7(A,C,B),n1)).  [resolve(36,a,33,b)].
0.74/1.04	Derived: -startedIn(A,B,C) | -happens(f6(A,C,B),f7(A,C,B)) | -less(D,f7(A,C,B)) | -less(f7(A,C,B),E) | startedIn(D,B,E).  [resolve(36,a,35,d)].
0.74/1.04	37 initiates(f8(A,B),A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom).  [clausify(11)].
0.74/1.04	Derived: releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) | stoppedIn(B,A,plus(B,C)) | -trajectory(A,B,D,C) | -less(n0,C) | -happens(f8(A,B),B) | holdsAt(D,plus(B,C)).  [resolve(37,a,32,a)].
0.74/1.04	Derived: releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) | -happens(f8(A,B),B) | -less(C,B) | -less(B,D) | startedIn(C,A,D).  [resolve(37,a,35,d)].
0.74/1.04	38 -happens(push,A) | spinning != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: -happens(push,A) | spinning != B | pull != C | stoppedIn(A,B,plus(A,D)) | -trajectory(B,A,E,D) | -less(n0,D) | -happens(C,A) | holdsAt(E,plus(A,D)).  [resolve(38,d,32,a)].
0.74/1.04	Derived: -happens(push,A) | spinning != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)).  [resolve(38,d,33,b)].
0.74/1.04	Derived: -happens(push,A) | spinning != B | pull != C | -happens(C,A) | -less(D,A) | -less(A,E) | startedIn(D,B,E).  [resolve(38,d,35,d)].
0.74/1.04	39 happens(push,A) | backwards != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: happens(push,A) | backwards != B | pull != C | stoppedIn(A,B,plus(A,D)) | -trajectory(B,A,E,D) | -less(n0,D) | -happens(C,A) | holdsAt(E,plus(A,D)).  [resolve(39,d,32,a)].
0.74/1.04	Derived: happens(push,A) | backwards != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)).  [resolve(39,d,33,b)].
0.74/1.04	Derived: happens(push,A) | backwards != B | pull != C | -happens(C,A) | -less(D,A) | -less(A,E) | startedIn(D,B,E).  [resolve(39,d,35,d)].
0.74/1.04	40 push != A | happens(pull,B) | forwards != C | initiates(A,C,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: push != A | happens(pull,B) | forwards != C | stoppedIn(B,C,plus(B,D)) | -trajectory(C,B,E,D) | -less(n0,D) | -happens(A,B) | holdsAt(E,plus(B,D)).  [resolve(40,d,32,a)].
0.74/1.04	Derived: push != A | happens(pull,B) | forwards != C | -happens(A,B) | holdsAt(C,plus(B,n1)).  [resolve(40,d,33,b)].
0.74/1.04	Derived: push != A | happens(pull,B) | forwards != C | -happens(A,B) | -less(D,B) | -less(B,E) | startedIn(D,C,E).  [resolve(40,d,35,d)].
0.74/1.04	41 happens(push,A) | backwards = B | push = C | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: happens(push,f7(A,B,C)) | backwards = C | push = f6(A,B,C) | -startedIn(A,C,B).  [resolve(41,d,36,a)].
0.74/1.04	Derived: happens(push,A) | backwards = B | push = f8(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(41,d,37,a)].
0.74/1.04	42 happens(push,A) | backwards = B | -happens(pull,A) | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: happens(push,f7(A,B,C)) | backwards = C | -happens(pull,f7(A,B,C)) | -startedIn(A,C,B).  [resolve(42,d,36,a)].
0.74/1.04	Derived: happens(push,A) | backwards = B | -happens(pull,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(42,d,37,a)].
0.74/1.04	43 happens(push,A) | backwards = B | forwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: happens(push,f7(A,B,C)) | backwards = C | forwards = C | -startedIn(A,C,B).  [resolve(43,d,36,a)].
0.74/1.04	Derived: happens(push,A) | backwards = B | forwards = B | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(43,d,37,a)].
0.74/1.04	44 spinning = A | -happens(push,B) | push = C | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | -happens(push,f7(B,C,A)) | push = f6(B,C,A) | -startedIn(B,A,C).  [resolve(44,d,36,a)].
0.74/1.04	Derived: spinning = A | -happens(push,B) | push = f8(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(44,d,37,a)].
0.74/1.04	45 spinning = A | -happens(push,B) | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | -happens(push,f7(B,C,A)) | -happens(pull,f7(B,C,A)) | -startedIn(B,A,C).  [resolve(45,d,36,a)].
0.74/1.04	Derived: spinning = A | -happens(push,B) | -happens(pull,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(45,d,37,a)].
0.74/1.04	46 spinning = A | -happens(push,B) | forwards = A | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | -happens(push,f7(B,C,A)) | forwards = A | -startedIn(B,A,C).  [resolve(46,d,36,a)].
0.74/1.04	Derived: spinning = A | -happens(push,B) | forwards = A | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(46,d,37,a)].
0.74/1.04	47 spinning = A | backwards = A | push = B | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | backwards = A | push = f6(B,C,A) | -startedIn(B,A,C).  [resolve(47,d,36,a)].
0.74/1.04	Derived: spinning = A | backwards = A | push = f8(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(47,d,37,a)].
0.74/1.04	48 spinning = A | backwards = A | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | backwards = A | -happens(pull,f7(B,C,A)) | -startedIn(B,A,C).  [resolve(48,d,36,a)].
0.74/1.04	Derived: spinning = A | backwards = A | -happens(pull,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(48,d,37,a)].
0.74/1.04	49 spinning = A | backwards = A | forwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: spinning = A | backwards = A | forwards = A | -startedIn(B,A,C).  [resolve(49,d,36,a)].
0.74/1.04	Derived: spinning = A | backwards = A | forwards = A | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(49,d,37,a)].
0.74/1.04	50 pull = A | push = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: pull = f6(A,B,C) | push = f6(A,B,C) | -startedIn(A,C,B).  [resolve(50,c,36,a)].
0.74/1.04	Derived: pull = f8(A,B) | push = f8(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(50,c,37,a)].
0.74/1.04	51 pull = A | -happens(pull,B) | -initiates(A,C,B) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: pull = f6(A,B,C) | -happens(pull,f7(A,B,C)) | -startedIn(A,C,B).  [resolve(51,c,36,a)].
0.74/1.04	Derived: pull = f8(A,B) | -happens(pull,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(51,c,37,a)].
0.74/1.04	52 pull = A | forwards = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.74/1.04	Derived: pull = f6(A,B,C) | forwards = C | -startedIn(A,C,B).  [resolve(52,c,36,a)].
0.74/1.04	Derived: pull = f8(A,B) | forwards = A | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(52,c,37,a)].
0.74/1.04	53 terminates(f1(A,B),A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom).  [clausify(4)].
0.74/1.04	54 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(3)].
0.74/1.04	55 -less(A,B) | -terminates(C,D,A) | -less(E,A) | -happens(C,A) | stoppedIn(E,D,B) # label(stoppedin_defn) # label(axiom).  [clausify(5)].
0.74/1.04	Derived: -less(A,B) | -less(C,A) | -happens(f1(D,A),A) | stoppedIn(C,D,B) | releasedAt(D,plus(A,n1)) | -holdsAt(D,A) | holdsAt(D,plus(A,n1)).  [resolve(55,b,53,a)].
0.74/1.04	56 terminates(f2(A,B,C),B,f3(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom).  [clausify(5)].
0.74/1.04	Derived: -stoppedIn(A,B,C) | -less(f3(A,B,C),D) | -less(E,f3(A,B,C)) | -happens(f2(A,B,C),f3(A,B,C)) | stoppedIn(E,B,D).  [resolve(56,a,55,b)].
0.74/1.04	57 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(9)].
0.74/1.04	Derived: -happens(f2(A,B,C),f3(A,B,C)) | -holdsAt(B,plus(f3(A,B,C),n1)) | -stoppedIn(A,B,C).  [resolve(57,a,56,a)].
0.74/1.04	58 startedIn(A,B,plus(A,C)) | -antitrajectory(B,A,D,C) | -less(n0,C) | -terminates(E,B,A) | -happens(E,A) | holdsAt(D,plus(A,C)) # label(antitrajectory) # label(axiom).  [clausify(12)].
0.74/1.04	Derived: startedIn(A,B,plus(A,C)) | -antitrajectory(B,A,D,C) | -less(n0,C) | -happens(f1(B,A),A) | holdsAt(D,plus(A,C)) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(58,d,53,a)].
0.74/1.04	Derived: startedIn(f3(A,B,C),B,plus(f3(A,B,C),D)) | -antitrajectory(B,f3(A,B,C),E,D) | -less(n0,D) | -happens(f2(A,B,C),f3(A,B,C)) | holdsAt(E,plus(f3(A,B,C),D)) | -stoppedIn(A,B,C).  [resolve(58,d,56,a)].
0.74/1.04	59 -terminates(A,B,C) | push = A | spinning = B | happens(push,C) | forwards = B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: push = f1(A,B) | spinning = A | happens(push,B) | forwards = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(59,a,53,a)].
0.74/1.04	Derived: push = f2(A,B,C) | spinning = B | happens(push,f3(A,B,C)) | forwards = B | -stoppedIn(A,B,C).  [resolve(59,a,56,a)].
0.74/1.04	60 -terminates(A,B,C) | push = A | -happens(push,C) | backwards = B | forwards = B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: push = f1(A,B) | -happens(push,B) | backwards = A | forwards = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(60,a,53,a)].
0.74/1.04	Derived: push = f2(A,B,C) | -happens(push,f3(A,B,C)) | backwards = B | forwards = B | -stoppedIn(A,B,C).  [resolve(60,a,56,a)].
0.74/1.04	61 -terminates(A,B,C) | push = A | pull = A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: push = f1(A,B) | pull = f1(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(61,a,53,a)].
0.74/1.04	Derived: push = f2(A,B,C) | pull = f2(A,B,C) | -stoppedIn(A,B,C).  [resolve(61,a,56,a)].
0.74/1.04	62 -terminates(A,B,C) | -happens(pull,C) | spinning = B | happens(push,C) | forwards = B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: -happens(pull,A) | spinning = B | happens(push,A) | forwards = B | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(62,a,53,a)].
0.74/1.04	Derived: -happens(pull,f3(A,B,C)) | spinning = B | happens(push,f3(A,B,C)) | forwards = B | -stoppedIn(A,B,C).  [resolve(62,a,56,a)].
0.74/1.04	63 -terminates(A,B,C) | -happens(pull,C) | -happens(push,C) | backwards = B | forwards = B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: -happens(pull,A) | -happens(push,A) | backwards = B | forwards = B | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(63,a,53,a)].
0.74/1.04	Derived: -happens(pull,f3(A,B,C)) | -happens(push,f3(A,B,C)) | backwards = B | forwards = B | -stoppedIn(A,B,C).  [resolve(63,a,56,a)].
0.74/1.04	64 -terminates(A,B,C) | -happens(pull,C) | pull = A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: -happens(pull,A) | pull = f1(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(64,a,53,a)].
0.74/1.04	Derived: -happens(pull,f3(A,B,C)) | pull = f2(A,B,C) | -stoppedIn(A,B,C).  [resolve(64,a,56,a)].
0.74/1.04	65 -terminates(A,B,C) | backwards = B | spinning = B | pull = A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: backwards = A | spinning = A | pull = f1(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(65,a,53,a)].
0.74/1.04	Derived: backwards = A | spinning = A | pull = f2(B,A,C) | -stoppedIn(B,A,C).  [resolve(65,a,56,a)].
0.74/1.04	66 -terminates(A,B,C) | backwards = B | spinning = B | forwards = B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: backwards = A | spinning = A | forwards = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(66,a,53,a)].
0.74/1.04	Derived: backwards = A | spinning = A | forwards = A | -stoppedIn(B,A,C).  [resolve(66,a,56,a)].
0.74/1.04	67 terminates(A,B,C) | push != A | happens(pull,C) | backwards != B # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: push != A | happens(pull,B) | backwards != C | -less(B,D) | -less(E,B) | -happens(A,B) | stoppedIn(E,C,D).  [resolve(67,a,55,b)].
0.74/1.04	Derived: push != A | happens(pull,B) | backwards != C | -happens(A,B) | -holdsAt(C,plus(B,n1)).  [resolve(67,a,57,a)].
0.74/1.04	Derived: push != A | happens(pull,B) | backwards != C | startedIn(B,C,plus(B,D)) | -antitrajectory(C,B,E,D) | -less(n0,D) | -happens(A,B) | holdsAt(E,plus(B,D)).  [resolve(67,a,58,d)].
0.74/1.04	68 terminates(A,B,C) | spinning != B | happens(push,C) | pull != A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: spinning != A | happens(push,B) | pull != C | -less(B,D) | -less(E,B) | -happens(C,B) | stoppedIn(E,A,D).  [resolve(68,a,55,b)].
0.74/1.04	Derived: spinning != A | happens(push,B) | pull != C | -happens(C,B) | -holdsAt(A,plus(B,n1)).  [resolve(68,a,57,a)].
0.74/1.04	Derived: spinning != A | happens(push,B) | pull != C | startedIn(B,A,plus(B,D)) | -antitrajectory(A,B,E,D) | -less(n0,D) | -happens(C,B) | holdsAt(E,plus(B,D)).  [resolve(68,a,58,d)].
0.74/1.04	69 terminates(A,B,C) | happens(pull,C) | spinning != B | push != A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: happens(pull,A) | spinning != B | push != C | -less(A,D) | -less(E,A) | -happens(C,A) | stoppedIn(E,B,D).  [resolve(69,a,55,b)].
0.74/1.04	Derived: happens(pull,A) | spinning != B | push != C | -happens(C,A) | -holdsAt(B,plus(A,n1)).  [resolve(69,a,57,a)].
0.74/1.04	Derived: happens(pull,A) | spinning != B | push != C | startedIn(A,B,plus(A,D)) | -antitrajectory(B,A,E,D) | -less(n0,D) | -happens(C,A) | holdsAt(E,plus(A,D)).  [resolve(69,a,58,d)].
0.74/1.04	70 terminates(A,B,C) | pull != A | backwards != B | -happens(push,C) # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: pull != A | backwards != B | -happens(push,C) | -less(C,D) | -less(E,C) | -happens(A,C) | stoppedIn(E,B,D).  [resolve(70,a,55,b)].
0.74/1.04	Derived: pull != A | backwards != B | -happens(push,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)).  [resolve(70,a,57,a)].
0.74/1.04	Derived: pull != A | backwards != B | -happens(push,C) | startedIn(C,B,plus(C,D)) | -antitrajectory(B,C,E,D) | -less(n0,D) | -happens(A,C) | holdsAt(E,plus(C,D)).  [resolve(70,a,58,d)].
0.74/1.04	71 terminates(A,B,C) | -happens(push,C) | forwards != B | pull != A # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: -happens(push,A) | forwards != B | pull != C | -less(A,D) | -less(E,A) | -happens(C,A) | stoppedIn(E,B,D).  [resolve(71,a,55,b)].
0.74/1.04	Derived: -happens(push,A) | forwards != B | pull != C | -happens(C,A) | -holdsAt(B,plus(A,n1)).  [resolve(71,a,57,a)].
0.74/1.04	Derived: -happens(push,A) | forwards != B | pull != C | startedIn(A,B,plus(A,D)) | -antitrajectory(B,A,E,D) | -less(n0,D) | -happens(C,A) | holdsAt(E,plus(A,D)).  [resolve(71,a,58,d)].
0.74/1.04	72 terminates(A,B,C) | pull != A | forwards != B | happens(push,C) # label(terminates_all_defn) # label(axiom).  [clausify(14)].
0.74/1.04	Derived: pull != A | forwards != B | happens(push,C) | -less(C,D) | -less(E,C) | -happens(A,C) | stoppedIn(E,B,D).  [resolve(72,a,55,b)].
0.74/1.04	Derived: pull != A | forwards != B | happens(push,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)).  [resolve(72,a,57,a)].
0.74/1.04	Derived: pull != A | forwards != B | happens(push,C) | startedIn(C,B,plus(C,D)) | -antitrajectory(B,C,E,D) | -less(n0,D) | -happens(A,C) | holdsAt(E,plus(C,D)).  [resolve(72,a,58,d)].
0.74/1.04	73 releasedAt(A,B) | releases(f5(A,B),A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(8)].
0.88/1.18	74 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(7)].
0.88/1.18	75 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(16)].
0.88/1.18	
0.88/1.18	============================== end predicate elimination =============
0.88/1.18	
0.88/1.18	Auto_denials:  (non-Horn, no changes).
0.88/1.18	
0.88/1.18	Term ordering decisions:
0.88/1.18	Function symbol KB weights:  n1=1. push=1. pull=1. spinning=1. backwards=1. forwards=1. n0=1. n2=1. n3=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f1=1. f4=1. f5=1. f8=1. f2=1. f3=1. f6=1. f7=1.
0.88/1.18	
0.88/1.18	============================== end of process initial clauses ========
0.88/1.18	
0.88/1.18	============================== CLAUSES FOR SEARCH ====================
0.88/1.18	
0.88/1.18	============================== end of clauses for search =============
0.88/1.18	
0.88/1.18	============================== SEARCH ================================
0.88/1.18	
0.88/1.18	% Starting search at 0.03 seconds.
0.88/1.18	
0.88/1.18	============================== PROOF =================================
0.88/1.18	% SZS status Theorem
0.88/1.18	% SZS output start Refutation
0.88/1.18	
0.88/1.18	% Proof 1 at 0.15 (+ 0.00) seconds.
0.88/1.18	% Length of proof is 29.
0.88/1.18	% Level of proof is 6.
0.88/1.18	% Maximum clause weight is 17.000.
0.88/1.18	% Given clauses 352.
0.88/1.18	
0.88/1.18	2 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	13 (all Event all Fluent all Time (happens(push,Time) & spinning = Fluent & Event = pull | -happens(push,Time) & Fluent = backwards & Event = pull | push = Event & -happens(pull,Time) & Fluent = forwards <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	15 (all Event all Time (push = Event & n0 = Time | push = Event & n2 = Time | Time = n2 & pull = Event | Time = n1 & pull = Event <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	17 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	19 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	26 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	27 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	33 -happens(A,B) | -initiates(A,C,B) | holdsAt(C,plus(B,n1)) # label(happens_holds) # label(axiom).  [clausify(2)].
0.88/1.18	39 happens(push,A) | backwards != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.88/1.18	90 n1 != A | pull != B | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(15)].
0.88/1.18	94 n0 = A | n2 = A | pull = B | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(15)].
0.88/1.18	97 pull != push # label(push_not_pull) # label(axiom).  [assumption].
0.88/1.18	103 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(17)].
0.88/1.18	108 -less(A,B) | B != A # label(less_property) # label(axiom).  [clausify(19)].
0.88/1.18	127 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom).  [clausify(26)].
0.88/1.18	128 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom).  [clausify(27)].
0.88/1.18	143 plus(n1,n1) = n2 # label(plus1_1) # label(axiom).  [assumption].
0.88/1.18	144 -holdsAt(backwards,n2) # label(backwards_2) # label(negated_conjecture).  [assumption].
0.88/1.18	158 happens(push,A) | backwards != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)).  [resolve(39,d,33,b)].
0.88/1.18	271 pull != A | happens(A,n1).  [xx_res(90,a)].
0.88/1.18	273 less_or_equal(A,A).  [xx_res(103,b)].
0.88/1.18	353 less(n0,n1).  [resolve(273,a,128,a)].
0.88/1.18	354 less(n1,n2).  [resolve(273,a,127,b)].
0.88/1.18	424 n0 != n1.  [resolve(353,a,108,a),flip(a)].
0.88/1.18	449 n2 != n1.  [resolve(354,a,108,a)].
0.88/1.18	644 happens(pull,n1).  [xx_res(271,a)].
0.88/1.18	773 happens(push,n1) | backwards != A | holdsAt(A,n2).  [resolve(644,a,158,d),rewrite([143(11)]),xx(c)].
0.88/1.18	1537 happens(push,n1).  [xx_res(773,b),unit_del(b,144)].
0.88/1.18	1577 $F.  [resolve(1537,a,94,d),unit_del(a,424),unit_del(b,449),unit_del(c,97)].
0.88/1.18	
0.88/1.18	% SZS output end Refutation
0.88/1.18	============================== end of proof ==========================
0.88/1.18	
0.88/1.18	============================== STATISTICS ============================
0.88/1.18	
0.88/1.18	Given=352. Generated=2482. Kept=1456. proofs=1.
0.88/1.18	Usable=348. Sos=994. Demods=11. Limbo=0, Disabled=299. Hints=0.
0.88/1.18	Megabytes=1.52.
0.88/1.18	User_CPU=0.15, System_CPU=0.00, Wall_clock=0.
0.88/1.18	
0.88/1.18	============================== end of statistics =====================
0.88/1.18	
0.88/1.18	============================== end of search =========================
0.88/1.18	
0.88/1.18	THEOREM PROVED
0.88/1.18	% SZS status Theorem
0.88/1.18	
0.88/1.18	Exiting with 1 proof.
0.88/1.18	
0.88/1.18	Process 27181 exit (max_proofs) Mon Jul  3 04:37:35 2023
0.88/1.18	Prover9 interrupted
0.92/1.18	EOF