0.02/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.24	% Computer   : n007.star.cs.uiowa.edu
0.03/0.24	% Model      : x86_64 x86_64
0.03/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.24	% Memory     : 32218.625MB
0.03/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.24	% CPULimit   : 300
0.03/0.24	% DateTime   : Fri Jul 13 15:57:02 CDT 2018
0.03/0.24	% CPUTime    : 
0.07/0.49	============================== Prover9 ===============================
0.07/0.49	Prover9 (32) version 2009-11A, November 2009.
0.07/0.49	Process 48711 was started by sandbox on n007.star.cs.uiowa.edu,
0.07/0.49	Fri Jul 13 15:57:03 2018
0.07/0.49	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_48679_n007.star.cs.uiowa.edu".
0.07/0.49	============================== end of head ===========================
0.07/0.49	
0.07/0.49	============================== INPUT =================================
0.07/0.49	
0.07/0.49	% Reading from file /tmp/Prover9_48679_n007.star.cs.uiowa.edu
0.07/0.49	
0.07/0.49	set(prolog_style_variables).
0.07/0.49	set(auto2).
0.07/0.49	    % set(auto2) -> set(auto).
0.07/0.49	    % set(auto) -> set(auto_inference).
0.07/0.49	    % set(auto) -> set(auto_setup).
0.07/0.49	    % set(auto_setup) -> set(predicate_elim).
0.07/0.49	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.49	    % set(auto) -> set(auto_limits).
0.07/0.49	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.49	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.49	    % set(auto) -> set(auto_denials).
0.07/0.49	    % set(auto) -> set(auto_process).
0.07/0.49	    % set(auto2) -> assign(new_constants, 1).
0.07/0.50	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.50	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.50	    % set(auto2) -> assign(max_hours, 1).
0.07/0.50	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.50	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.50	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.50	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.50	    % set(auto2) -> set(sort_initial_sos).
0.07/0.50	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.50	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.50	    % set(auto2) -> assign(max_megs, 400).
0.07/0.50	    % set(auto2) -> assign(stats, some).
0.07/0.50	    % set(auto2) -> clear(echo_input).
0.07/0.50	    % set(auto2) -> set(quiet).
0.07/0.50	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.50	    % set(auto2) -> clear(print_given).
0.07/0.50	assign(lrs_ticks,-1).
0.07/0.50	assign(sos_limit,10000).
0.07/0.50	assign(order,kbo).
0.07/0.50	set(lex_order_vars).
0.07/0.50	clear(print_given).
0.07/0.50	
0.07/0.50	% formulas(sos).  % not echoed (48 formulas)
0.07/0.50	
0.07/0.50	============================== end of input ==========================
0.07/0.50	
0.07/0.50	% From the command line: assign(max_seconds, 300).
0.07/0.50	
0.07/0.50	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.50	
0.07/0.50	% Formulas that are not ordinary clauses:
0.07/0.50	1 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event ((terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) & happens(Event,Time))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	2 (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.07/0.50	3 (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.07/0.50	4 (all Time1 all Time2 all Fluent ((exists Event exists Time (less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))) <-> startedIn(Time1,Fluent,Time2))) # label(startedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	5 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (initiates(Event,Fluent,Time) & happens(Event,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	6 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & trajectory(Fluent,Time,Fluent2,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	7 (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.07/0.50	8 (all Time1 all Fluent all Time2 ((exists Event exists Time (less(Time1,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & happens(Event,Time))) <-> stoppedIn(Time1,Fluent,Time2))) # label(stoppedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	9 (all Fluent all Time (-(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	10 (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.07/0.50	11 (all Fluent all Time (-releasedAt(Fluent,plus(Time,n1)) & -(exists Event (terminates(Event,Fluent,Time) & happens(Event,Time))) & holdsAt(Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	12 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & less(n0,Time2) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & terminates(Event,Fluent1,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	13 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	14 (all Event all Time (happens(Event,Time) <-> Event = pull & n2 = Time | Time = n2 & push = Event | n1 = Time & pull = Event | push = Event & n0 = Time)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	15 (all Event all Fluent all Time (-happens(push,Time) & Fluent = backwards & pull = Event | Event = pull & spinning = Fluent & happens(push,Time) | push = Event & -happens(pull,Time) & forwards = Fluent <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	16 (all Event all Fluent all Time (Event = pull & forwards = Fluent & -happens(push,Time) | Event = pull & happens(push,Time) & Fluent = forwards | happens(push,Time) & backwards = Fluent & pull = Event | Event = push & -happens(pull,Time) & Fluent = spinning | pull = Event & -happens(push,Time) & spinning = Fluent | -happens(pull,Time) & backwards = Fluent & Event = push <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	17 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	18 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	19 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.07/0.50	20 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	21 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	22 (all X all Y (less(X,Y) <-> Y != X & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	23 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	24 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	25 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	26 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	27 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	28 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	29 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	30 (all X all Y (Y = X | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	31 --holdsAt(backwards,n1) # label(not_backwards_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.50	
0.07/0.50	============================== end of process non-clausal formulas ===
0.07/0.50	
0.07/0.50	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.50	
0.07/0.50	============================== PREDICATE ELIMINATION =================
0.07/0.50	32 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(2)].
0.07/0.50	33 -releasedAt(A,B) | terminates(f1(A,B),A,B) | initiates(f1(A,B),A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom).  [clausify(1)].
0.07/0.50	34 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(3)].
0.07/0.50	35 -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | stoppedIn(A,E,C) # label(stoppedin_defn) # label(axiom).  [clausify(8)].
0.07/0.50	36 terminates(f5(A,B,C),B,f6(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom).  [clausify(8)].
0.07/0.50	Derived: -stoppedIn(A,B,C) | -happens(f5(A,B,C),f6(A,B,C)) | -holdsAt(B,plus(f6(A,B,C),n1)).  [resolve(36,a,34,a)].
0.07/0.50	Derived: -stoppedIn(A,B,C) | -less(D,f6(A,B,C)) | -less(f6(A,B,C),E) | -happens(f5(A,B,C),f6(A,B,C)) | stoppedIn(D,B,E).  [resolve(36,a,35,c)].
0.07/0.50	37 releasedAt(A,plus(B,n1)) | terminates(f8(A,B),A,B) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom).  [clausify(11)].
0.07/0.50	Derived: releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f8(A,B),B) | stoppedIn(C,A,D).  [resolve(37,b,35,c)].
0.07/0.50	38 -happens(A,B) | -less(n0,C) | -antitrajectory(D,B,E,C) | startedIn(B,D,plus(B,C)) | -terminates(A,D,B) | holdsAt(E,plus(B,C)) # label(antitrajectory) # label(axiom).  [clausify(12)].
0.07/0.50	Derived: -happens(f5(A,B,C),f6(A,B,C)) | -less(n0,D) | -antitrajectory(B,f6(A,B,C),E,D) | startedIn(f6(A,B,C),B,plus(f6(A,B,C),D)) | holdsAt(E,plus(f6(A,B,C),D)) | -stoppedIn(A,B,C).  [resolve(38,e,36,a)].
0.07/0.50	Derived: -happens(f8(A,B),B) | -less(n0,C) | -antitrajectory(A,B,D,C) | startedIn(B,A,plus(B,C)) | holdsAt(D,plus(B,C)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(38,e,37,b)].
0.07/0.50	39 pull != A | forwards != B | happens(push,C) | terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull != A | forwards != B | happens(push,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)).  [resolve(39,d,34,a)].
0.07/0.50	Derived: pull != A | forwards != B | happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | stoppedIn(D,B,E).  [resolve(39,d,35,c)].
0.07/0.50	Derived: pull != A | forwards != B | happens(push,C) | -happens(A,C) | -less(n0,D) | -antitrajectory(B,C,E,D) | startedIn(C,B,plus(C,D)) | holdsAt(E,plus(C,D)).  [resolve(39,d,38,e)].
0.07/0.50	40 pull != A | -happens(push,B) | forwards != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull != A | -happens(push,B) | forwards != C | -happens(A,B) | -holdsAt(C,plus(B,n1)).  [resolve(40,d,34,a)].
0.07/0.50	Derived: pull != A | -happens(push,B) | forwards != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E).  [resolve(40,d,35,c)].
0.07/0.50	Derived: pull != A | -happens(push,B) | forwards != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)).  [resolve(40,d,38,e)].
0.07/0.50	41 -happens(push,A) | backwards != B | pull != C | terminates(C,B,A) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: -happens(push,A) | backwards != B | pull != C | -happens(C,A) | -holdsAt(B,plus(A,n1)).  [resolve(41,d,34,a)].
0.07/0.50	Derived: -happens(push,A) | backwards != B | pull != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E).  [resolve(41,d,35,c)].
0.07/0.50	Derived: -happens(push,A) | backwards != B | pull != C | -happens(C,A) | -less(n0,D) | -antitrajectory(B,A,E,D) | startedIn(A,B,plus(A,D)) | holdsAt(E,plus(A,D)).  [resolve(41,d,38,e)].
0.07/0.50	42 push != A | happens(pull,B) | spinning != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: push != A | happens(pull,B) | spinning != C | -happens(A,B) | -holdsAt(C,plus(B,n1)).  [resolve(42,d,34,a)].
0.07/0.50	Derived: push != A | happens(pull,B) | spinning != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E).  [resolve(42,d,35,c)].
0.07/0.50	Derived: push != A | happens(pull,B) | spinning != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)).  [resolve(42,d,38,e)].
0.07/0.50	43 pull != A | happens(push,B) | spinning != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull != A | happens(push,B) | spinning != C | -happens(A,B) | -holdsAt(C,plus(B,n1)).  [resolve(43,d,34,a)].
0.07/0.50	Derived: pull != A | happens(push,B) | spinning != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E).  [resolve(43,d,35,c)].
0.07/0.50	Derived: pull != A | happens(push,B) | spinning != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)).  [resolve(43,d,38,e)].
0.07/0.50	44 happens(pull,A) | backwards != B | push != C | terminates(C,B,A) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: happens(pull,A) | backwards != B | push != C | -happens(C,A) | -holdsAt(B,plus(A,n1)).  [resolve(44,d,34,a)].
0.07/0.50	Derived: happens(pull,A) | backwards != B | push != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E).  [resolve(44,d,35,c)].
0.07/0.50	Derived: happens(pull,A) | backwards != B | push != C | -happens(C,A) | -less(n0,D) | -antitrajectory(B,A,E,D) | startedIn(A,B,plus(A,D)) | holdsAt(E,plus(A,D)).  [resolve(44,d,38,e)].
0.07/0.50	45 pull = A | push = A | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull = f5(A,B,C) | push = f5(A,B,C) | -stoppedIn(A,B,C).  [resolve(45,c,36,a)].
0.07/0.50	Derived: pull = f8(A,B) | push = f8(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(45,c,37,b)].
0.07/0.50	46 pull = A | -happens(pull,B) | -terminates(A,C,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull = f5(A,B,C) | -happens(pull,f6(A,B,C)) | -stoppedIn(A,B,C).  [resolve(46,c,36,a)].
0.07/0.50	Derived: pull = f8(A,B) | -happens(pull,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(46,c,37,b)].
0.07/0.50	47 pull = A | spinning = B | backwards = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: pull = f5(A,B,C) | spinning = B | backwards = B | -stoppedIn(A,B,C).  [resolve(47,d,36,a)].
0.07/0.50	Derived: pull = f8(A,B) | spinning = A | backwards = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(47,d,37,b)].
0.07/0.50	48 forwards = A | happens(push,B) | push = C | spinning = A | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: forwards = A | happens(push,f6(B,A,C)) | push = f5(B,A,C) | spinning = A | -stoppedIn(B,A,C).  [resolve(48,e,36,a)].
0.07/0.50	Derived: forwards = A | happens(push,B) | push = f8(A,B) | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(48,e,37,b)].
0.07/0.50	49 forwards = A | happens(push,B) | -happens(pull,B) | spinning = A | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: forwards = A | happens(push,f6(B,A,C)) | -happens(pull,f6(B,A,C)) | spinning = A | -stoppedIn(B,A,C).  [resolve(49,e,36,a)].
0.07/0.50	Derived: forwards = A | happens(push,B) | -happens(pull,B) | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(49,e,37,b)].
0.07/0.50	50 forwards = A | backwards = A | push = B | -happens(push,C) | -terminates(B,A,C) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: forwards = A | backwards = A | push = f5(B,A,C) | -happens(push,f6(B,A,C)) | -stoppedIn(B,A,C).  [resolve(50,e,36,a)].
0.07/0.50	Derived: forwards = A | backwards = A | push = f8(A,B) | -happens(push,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(50,e,37,b)].
0.07/0.50	51 forwards = A | backwards = A | -happens(pull,B) | -happens(push,B) | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: forwards = A | backwards = A | -happens(pull,f6(B,A,C)) | -happens(push,f6(B,A,C)) | -stoppedIn(B,A,C).  [resolve(51,e,36,a)].
0.07/0.50	Derived: forwards = A | backwards = A | -happens(pull,B) | -happens(push,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(51,e,37,b)].
0.07/0.50	52 forwards = A | backwards = A | spinning = A | -terminates(B,A,C) # label(terminates_all_defn) # label(axiom).  [clausify(16)].
0.07/0.50	Derived: forwards = A | backwards = A | spinning = A | -stoppedIn(B,A,C).  [resolve(52,d,36,a)].
0.07/0.50	Derived: forwards = A | backwards = A | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(52,d,37,b)].
0.07/0.50	53 initiates(f2(A,B,C),C,f3(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom).  [clausify(4)].
0.07/0.50	54 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(2)].
0.07/0.50	55 -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | startedIn(A,D,E) # label(startedin_defn) # label(axiom).  [clausify(4)].
0.07/0.50	Derived: -startedIn(A,B,C) | -less(D,f3(A,C,B)) | -less(f3(A,C,B),E) | -happens(f2(A,C,B),f3(A,C,B)) | startedIn(D,B,E).  [resolve(53,a,55,b)].
0.07/0.50	56 holdsAt(A,B) | releasedAt(A,plus(B,n1)) | initiates(f4(A,B),A,B) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom).  [clausify(5)].
0.07/0.50	Derived: holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f4(A,B),B) | startedIn(C,A,D).  [resolve(56,c,55,b)].
0.07/0.50	57 -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) # label(change_holding) # label(axiom).  [clausify(6)].
0.07/0.50	Derived: -less(n0,A) | -trajectory(B,f3(C,D,B),E,A) | stoppedIn(f3(C,D,B),B,plus(f3(C,D,B),A)) | -happens(f2(C,D,B),f3(C,D,B)) | holdsAt(E,plus(f3(C,D,B),A)) | -startedIn(C,B,D).  [resolve(57,d,53,a)].
0.07/0.50	Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -happens(f4(B,C),C) | holdsAt(D,plus(C,A)) | holdsAt(B,C) | releasedAt(B,plus(C,n1)) | -holdsAt(B,plus(C,n1)).  [resolve(57,d,56,c)].
0.07/0.50	58 -happens(A,B) | -initiates(A,C,B) | holdsAt(C,plus(B,n1)) # label(happens_holds) # label(axiom).  [clausify(7)].
0.07/0.50	Derived: -happens(f2(A,B,C),f3(A,B,C)) | holdsAt(C,plus(f3(A,B,C),n1)) | -startedIn(A,C,B).  [resolve(58,b,53,a)].
0.07/0.50	59 happens(push,A) | backwards != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: happens(push,A) | backwards != B | pull != C | -less(D,A) | -less(A,E) | -happens(C,A) | startedIn(D,B,E).  [resolve(59,d,55,b)].
0.07/0.50	Derived: happens(push,A) | backwards != B | pull != C | -less(n0,D) | -trajectory(B,A,E,D) | stoppedIn(A,B,plus(A,D)) | -happens(C,A) | holdsAt(E,plus(A,D)).  [resolve(59,d,57,d)].
0.07/0.50	Derived: happens(push,A) | backwards != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)).  [resolve(59,d,58,b)].
0.07/0.50	60 pull != A | spinning != B | -happens(push,C) | initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: pull != A | spinning != B | -happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | startedIn(D,B,E).  [resolve(60,d,55,b)].
0.07/0.50	Derived: pull != A | spinning != B | -happens(push,C) | -less(n0,D) | -trajectory(B,C,E,D) | stoppedIn(C,B,plus(C,D)) | -happens(A,C) | holdsAt(E,plus(C,D)).  [resolve(60,d,57,d)].
0.07/0.50	Derived: pull != A | spinning != B | -happens(push,C) | -happens(A,C) | holdsAt(B,plus(C,n1)).  [resolve(60,d,58,b)].
0.07/0.50	61 push != A | happens(pull,B) | forwards != C | initiates(A,C,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: push != A | happens(pull,B) | forwards != C | -less(D,B) | -less(B,E) | -happens(A,B) | startedIn(D,C,E).  [resolve(61,d,55,b)].
0.07/0.50	Derived: push != A | happens(pull,B) | forwards != C | -less(n0,D) | -trajectory(C,B,E,D) | stoppedIn(B,C,plus(B,D)) | -happens(A,B) | holdsAt(E,plus(B,D)).  [resolve(61,d,57,d)].
0.07/0.50	Derived: push != A | happens(pull,B) | forwards != C | -happens(A,B) | holdsAt(C,plus(B,n1)).  [resolve(61,d,58,b)].
0.07/0.50	62 -happens(push,A) | spinning = B | push = C | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: -happens(push,f3(A,B,C)) | spinning = C | push = f2(A,B,C) | -startedIn(A,C,B).  [resolve(62,d,53,a)].
0.07/0.50	Derived: -happens(push,A) | spinning = B | push = f4(B,A) | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)).  [resolve(62,d,56,c)].
0.07/0.50	63 -happens(push,A) | spinning = B | -happens(pull,A) | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: -happens(push,f3(A,B,C)) | spinning = C | -happens(pull,f3(A,B,C)) | -startedIn(A,C,B).  [resolve(63,d,53,a)].
0.07/0.50	Derived: -happens(push,A) | spinning = B | -happens(pull,A) | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)).  [resolve(63,d,56,c)].
0.07/0.50	64 -happens(push,A) | spinning = B | forwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: -happens(push,f3(A,B,C)) | spinning = C | forwards = C | -startedIn(A,C,B).  [resolve(64,d,53,a)].
0.07/0.50	Derived: -happens(push,A) | spinning = B | forwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)).  [resolve(64,d,56,c)].
0.07/0.50	65 backwards = A | spinning = A | push = B | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | spinning = A | push = f2(B,C,A) | -startedIn(B,A,C).  [resolve(65,d,53,a)].
0.07/0.50	Derived: backwards = A | spinning = A | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(65,d,56,c)].
0.07/0.50	66 backwards = A | spinning = A | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | spinning = A | -happens(pull,f3(B,C,A)) | -startedIn(B,A,C).  [resolve(66,d,53,a)].
0.07/0.50	Derived: backwards = A | spinning = A | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(66,d,56,c)].
0.07/0.50	67 backwards = A | spinning = A | forwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | spinning = A | forwards = A | -startedIn(B,A,C).  [resolve(67,d,53,a)].
0.07/0.50	Derived: backwards = A | spinning = A | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(67,d,56,c)].
0.07/0.50	68 backwards = A | happens(push,B) | push = C | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | happens(push,f3(B,C,A)) | push = f2(B,C,A) | -startedIn(B,A,C).  [resolve(68,d,53,a)].
0.07/0.50	Derived: backwards = A | happens(push,B) | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(68,d,56,c)].
0.07/0.50	69 backwards = A | happens(push,B) | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | happens(push,f3(B,C,A)) | -happens(pull,f3(B,C,A)) | -startedIn(B,A,C).  [resolve(69,d,53,a)].
0.07/0.50	Derived: backwards = A | happens(push,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(69,d,56,c)].
0.07/0.50	70 backwards = A | happens(push,B) | forwards = A | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: backwards = A | happens(push,f3(B,C,A)) | forwards = A | -startedIn(B,A,C).  [resolve(70,d,53,a)].
0.07/0.50	Derived: backwards = A | happens(push,B) | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(70,d,56,c)].
0.07/0.50	71 pull = A | push = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: pull = f2(A,B,C) | push = f2(A,B,C) | -startedIn(A,C,B).  [resolve(71,c,53,a)].
0.07/0.50	Derived: pull = f4(A,B) | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(71,c,56,c)].
0.07/0.50	72 pull = A | -happens(pull,B) | -initiates(A,C,B) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: pull = f2(A,B,C) | -happens(pull,f3(A,B,C)) | -startedIn(A,C,B).  [resolve(72,c,53,a)].
0.07/0.50	Derived: pull = f4(A,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(72,c,56,c)].
0.07/0.50	73 pull = A | forwards = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(15)].
0.07/0.50	Derived: pull = f2(A,B,C) | forwards = C | -startedIn(A,C,B).  [resolve(73,c,53,a)].
0.07/0.50	Derived: pull = f4(A,B) | forwards = A | holdsAt(A,Cputime limit exceeded (core dumped)
300.08/300.31	EOF