0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.08/0.28	% Computer   : n013.cluster.edu
0.08/0.28	% Model      : x86_64 x86_64
0.08/0.28	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.28	% Memory     : 8042.1875MB
0.08/0.28	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.28	% CPULimit   : 960
0.08/0.28	% DateTime   : Thu Jul  2 07:48:18 EDT 2020
0.08/0.28	% CPUTime    : 
0.56/0.92	============================== Prover9 ===============================
0.56/0.92	Prover9 (32) version 2009-11A, November 2009.
0.56/0.92	Process 12435 was started by sandbox2 on n013.cluster.edu,
0.56/0.92	Thu Jul  2 07:48:19 2020
0.56/0.92	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_12268_n013.cluster.edu".
0.56/0.92	============================== end of head ===========================
0.56/0.92	
0.56/0.92	============================== INPUT =================================
0.56/0.92	
0.56/0.92	% Reading from file /tmp/Prover9_12268_n013.cluster.edu
0.56/0.92	
0.56/0.92	set(prolog_style_variables).
0.56/0.92	set(auto2).
0.56/0.92	    % set(auto2) -> set(auto).
0.56/0.92	    % set(auto) -> set(auto_inference).
0.56/0.92	    % set(auto) -> set(auto_setup).
0.56/0.92	    % set(auto_setup) -> set(predicate_elim).
0.56/0.92	    % set(auto_setup) -> assign(eq_defs, unfold).
0.56/0.92	    % set(auto) -> set(auto_limits).
0.56/0.92	    % set(auto_limits) -> assign(max_weight, "100.000").
0.56/0.92	    % set(auto_limits) -> assign(sos_limit, 20000).
0.56/0.92	    % set(auto) -> set(auto_denials).
0.56/0.92	    % set(auto) -> set(auto_process).
0.56/0.92	    % set(auto2) -> assign(new_constants, 1).
0.56/0.92	    % set(auto2) -> assign(fold_denial_max, 3).
0.56/0.92	    % set(auto2) -> assign(max_weight, "200.000").
0.56/0.92	    % set(auto2) -> assign(max_hours, 1).
0.56/0.92	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.56/0.92	    % set(auto2) -> assign(max_seconds, 0).
0.56/0.92	    % set(auto2) -> assign(max_minutes, 5).
0.56/0.92	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.56/0.92	    % set(auto2) -> set(sort_initial_sos).
0.56/0.92	    % set(auto2) -> assign(sos_limit, -1).
0.56/0.92	    % set(auto2) -> assign(lrs_ticks, 3000).
0.56/0.92	    % set(auto2) -> assign(max_megs, 400).
0.56/0.92	    % set(auto2) -> assign(stats, some).
0.56/0.92	    % set(auto2) -> clear(echo_input).
0.56/0.92	    % set(auto2) -> set(quiet).
0.56/0.92	    % set(auto2) -> clear(print_initial_clauses).
0.56/0.92	    % set(auto2) -> clear(print_given).
0.56/0.92	assign(lrs_ticks,-1).
0.56/0.92	assign(sos_limit,10000).
0.56/0.92	assign(order,kbo).
0.56/0.92	set(lex_order_vars).
0.56/0.92	clear(print_given).
0.56/0.92	
0.56/0.92	% formulas(sos).  % not echoed (167 formulas)
0.56/0.92	
0.56/0.92	============================== end of input ==========================
0.56/0.92	
0.56/0.92	% From the command line: assign(max_seconds, 960).
0.56/0.92	
0.56/0.92	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.56/0.92	
0.56/0.92	% Formulas that are not ordinary clauses:
0.56/0.92	1 (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.56/0.92	2 (all Fluent all Time (-holdsAt(Fluent,Time) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	3 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	4 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & terminates(Event,Fluent1,Time1) & less(n0,Time2) & happens(Event,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	5 (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.56/0.92	6 (all Event all Time all Fluent ((terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	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.56/0.92	8 (all Time1 all Fluent all Time2 ((exists Event exists Time (less(Time1,Time) & terminates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))) <-> stoppedIn(Time1,Fluent,Time2))) # label(stoppedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	9 (all Fluent all Time (-(exists Event (releases(Event,Fluent,Time) & happens(Event,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	10 (all Event all Time all Fluent all Fluent2 all Offset (initiates(Event,Fluent,Time) & trajectory(Fluent,Time,Fluent2,Offset) & less(n0,Offset) & happens(Event,Time) & -stoppedIn(Time,Fluent,plus(Time,Offset)) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	11 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	12 (all Fluent all Time (holdsAt(Fluent,Time) & -(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	13 (all Trolley backwards(Trolley) != forwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	14 (all Event all Fluent all Time ((exists Agent exists Trolley (pull(Agent,Trolley) = Event & -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent | happens(push(Agent,Trolley),Time) & Event = pull(Agent,Trolley) & spinning(Trolley) = Fluent | Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event)) <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	15 (all Event all Fluent all Time ((exists Agent exists Trolley (-happens(pull(Agent,Trolley),Time) & spinning(Trolley) = Fluent & push(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & happens(push(Agent,Trolley),Time) & forwards(Trolley) = Fluent | -happens(push(Agent,Trolley),Time) & Fluent = spinning(Trolley) & Event = pull(Agent,Trolley) | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent | Fluent = forwards(Trolley) & Event = pull(Agent,Trolley) & -happens(push(Agent,Trolley),Time) | backwards(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event)) <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	16 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Trolley2 != Trolley1 & Agent1 != Agent2 -> pull(Agent1,Trolley1) != pull(Agent2,Trolley2))) # label(pull_unique) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	17 (all Trolley forwards(Trolley) != spinning(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	18 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	19 (all Agent all Trolley push(Agent,Trolley) != pull(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	20 (all Trolley spinning(Trolley) != backwards(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	21 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent2 != Agent1 & Trolley2 != Trolley1 -> push(Agent1,Trolley1) != push(Agent2,Trolley2))) # label(push_unique) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	22 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	23 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	24 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	25 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	26 (all X all Y (less(X,Y) <-> Y != X & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	27 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	28 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	29 (all Event all Time (happens(Event,Time) <-> Event = push(agent1,trolley1) & n0 = Time | push(agent3,trolley3) = Event & n0 = Time | Time = n0 & Event = pull(agent4,trolley4) | Time = n0 & Event = pull(agent6,trolley6) | Event = push(agent6,trolley6) & n0 = Time | n0 = Time & Event = pull(agent7,trolley7) | n0 = Time & Event = pull(agent8,trolley8) | push(agent8,trolley8) = Event & n0 = Time | pull(agent9,trolley9) = Event & n0 = Time | Event = push(agent9,trolley9) & Time = n0 | n0 = Time & Event = pull(agent10,trolley10) | Time = n0 & push(agent10,trolley10) = Event | push(agent7,trolley7) = Event & n0 = Time | Time = n0 & push(agent5,trolley5) = Event | Time = n0 & Event = pull(agent5,trolley5) | Time = n0 & push(agent4,trolley4) = Event | Event = pull(agent3,trolley3) & Time = n0 | n0 = Time & push(agent2,trolley2) = Event | Time = n0 & Event = pull(agent2,trolley2) | Event = pull(agent1,trolley1) & Time = n0)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	30 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	31 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	32 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	33 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	34 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.56/0.92	35 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	36 (all X all Y (X = Y | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.56/0.92	37 -(holdsAt(spinning(trolley1),n1) & holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley10),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley3),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.56/0.92	
0.56/0.92	============================== end of process non-clausal formulas ===
0.56/0.92	
0.56/0.92	============================== PROCESS INITIAL CLAUSES ===============
0.56/0.92	
0.56/0.92	============================== PREDICATE ELIMINATION =================
0.56/0.92	38 initiates(f1(A,B,C),C,f2(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.56/0.92	39 -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | startedIn(A,D,E) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.56/0.92	Derived: -startedIn(A,B,C) | -less(D,f2(A,C,B)) | -less(f2(A,C,B),E) | -happens(f1(A,C,B),f2(A,C,B)) | startedIn(D,B,E).  [resolve(38,a,39,b)].
0.56/0.92	40 holdsAt(A,B) | initiates(f3(A,B),A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom).  [clausify(2)].
0.56/0.92	Derived: holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f3(A,B),B) | startedIn(C,A,D).  [resolve(40,b,39,b)].
0.56/0.92	41 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(3)].
0.56/0.92	Derived: -happens(f1(A,B,C),f2(A,B,C)) | holdsAt(C,plus(f2(A,B,C),n1)) | -startedIn(A,C,B).  [resolve(41,a,38,a)].
0.56/0.92	42 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(6)].
0.56/0.92	43 -initiates(A,B,C) | -trajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | stoppedIn(C,B,plus(C,E)) | holdsAt(D,plus(C,E)) # label(change_holding) # label(axiom).  [clausify(10)].
0.56/0.92	Derived: -trajectory(A,f2(B,C,A),D,E) | -less(n0,E) | -happens(f1(B,C,A),f2(B,C,A)) | stoppedIn(f2(B,C,A),A,plus(f2(B,C,A),E)) | holdsAt(D,plus(f2(B,C,A),E)) | -startedIn(B,A,C).  [resolve(43,a,38,a)].
0.56/0.92	Derived: -trajectory(A,B,C,D) | -less(n0,D) | -happens(f3(A,B),B) | stoppedIn(B,A,plus(B,D)) | holdsAt(C,plus(B,D)) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(43,a,40,b)].
0.56/0.93	44 -releasedAt(A,B) | terminates(f7(A,B),A,B) | initiates(f7(A,B),A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom).  [clausify(11)].
0.56/0.93	45 pull(A,B) != C | happens(push(A,B),D) | backwards(B) != E | initiates(C,E,D) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.56/0.93	Derived: pull(A,B) != C | happens(push(A,B),D) | backwards(B) != E | -less(F,D) | -less(D,V6) | -happens(C,D) | startedIn(F,E,V6).  [resolve(45,d,39,b)].
0.56/0.93	Derived: pull(A,B) != C | happens(push(A,B),D) | backwards(B) != E | -happens(C,D) | holdsAt(E,plus(D,n1)).  [resolve(45,d,41,a)].
0.56/0.93	Derived: pull(A,B) != C | happens(push(A,B),D) | backwards(B) != E | -trajectory(E,D,F,V6) | -less(n0,V6) | -happens(C,D) | stoppedIn(D,E,plus(D,V6)) | holdsAt(F,plus(D,V6)).  [resolve(45,d,43,a)].
0.56/0.93	46 -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | initiates(D,E,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.56/0.93	Derived: -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | -less(F,C) | -less(C,V6) | -happens(D,C) | startedIn(F,E,V6).  [resolve(46,d,39,b)].
0.56/0.93	Derived: -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | -happens(D,C) | holdsAt(E,plus(C,n1)).  [resolve(46,d,41,a)].
0.56/0.93	Derived: -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | -trajectory(E,C,F,V6) | -less(n0,V6) | -happens(D,C) | stoppedIn(C,E,plus(C,V6)) | holdsAt(F,plus(C,V6)).  [resolve(46,d,43,a)].
0.56/0.93	47 forwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | initiates(E,B,D) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.56/0.93	Derived: forwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | -less(F,D) | -less(D,V6) | -happens(E,D) | startedIn(F,B,V6).  [resolve(47,d,39,b)].
0.56/0.93	Derived: forwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | -happens(E,D) | holdsAt(B,plus(D,n1)).  [resolve(47,d,41,a)].
0.56/0.93	Derived: forwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | -trajectory(B,D,F,V6) | -less(n0,V6) | -happens(E,D) | stoppedIn(D,B,plus(D,V6)) | holdsAt(F,plus(D,V6)).  [resolve(47,d,43,a)].
0.56/0.93	48 pull(f9(A,B,C),f10(A,B,C)) = A | forwards(f10(A,B,C)) = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.56/0.93	Derived: pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | forwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | -startedIn(A,C,B).  [resolve(48,c,38,a)].
0.56/0.93	Derived: pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | forwards(f10(f3(A,B),A,B)) = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(48,c,40,b)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | forwards(f10(A,B,C)) = B | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(48,c,45,d)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | forwards(f10(A,B,C)) = B | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(48,c,46,d)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | forwards(f10(A,B,C)) = B | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(48,c,47,d)].
0.56/0.93	49 pull(f9(A,B,C),f10(A,B,C)) = A | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.56/0.93	Derived: pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | -happens(pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | -startedIn(A,C,B).  [resolve(49,c,38,a)].
0.56/0.93	Derived: pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | -happens(pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(49,c,40,b)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(49,c,45,d)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(49,c,46,d)].
0.56/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(49,c,47,d)].
0.61/0.93	50 pull(f9(A,B,C),f10(A,B,C)) = A | push(f9(A,B,C),f10(A,B,C)) = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | -startedIn(A,C,B).  [resolve(50,c,38,a)].
0.61/0.93	Derived: pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(50,c,40,b)].
0.61/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | push(f9(A,B,C),f10(A,B,C)) = A | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(50,c,45,d)].
0.61/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | push(f9(A,B,C),f10(A,B,C)) = A | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(50,c,46,d)].
0.61/0.93	Derived: pull(f9(A,B,C),f10(A,B,C)) = A | push(f9(A,B,C),f10(A,B,C)) = A | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(50,c,47,d)].
0.61/0.93	51 -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: -happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | forwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | -startedIn(A,C,B).  [resolve(51,d,38,a)].
0.61/0.93	Derived: -happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | spinning(f10(f3(A,B),A,B)) = A | forwards(f10(f3(A,B),A,B)) = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(51,d,40,b)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(51,d,45,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(51,d,46,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(51,d,47,d)].
0.61/0.93	52 -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: -happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | -happens(pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | -startedIn(A,C,B).  [resolve(52,d,38,a)].
0.61/0.93	Derived: -happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | spinning(f10(f3(A,B),A,B)) = A | -happens(pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(52,d,40,b)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(52,d,45,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(52,d,46,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(52,d,47,d)].
0.61/0.93	53 -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: -happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | -startedIn(A,C,B).  [resolve(53,d,38,a)].
0.61/0.93	Derived: -happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | spinning(f10(f3(A,B),A,B)) = A | push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(53,d,40,b)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(53,d,45,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(53,d,46,d)].
0.61/0.93	Derived: -happens(push(f9(A,B,C),f10(A,B,C)),C) | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(53,d,47,d)].
0.61/0.93	54 backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | forwards(f10(A,B,C)) = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | forwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | -startedIn(A,C,B).  [resolve(54,d,38,a)].
0.61/0.93	Derived: backwards(f10(f3(A,B),A,B)) = A | happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | forwards(f10(f3(A,B),A,B)) = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(54,d,40,b)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | forwards(f10(A,B,C)) = B | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(54,d,45,d)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | forwards(f10(A,B,C)) = B | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(54,d,46,d)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | forwards(f10(A,B,C)) = B | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(54,d,47,d)].
0.61/0.93	55 backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | -happens(pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | -startedIn(A,C,B).  [resolve(55,d,38,a)].
0.61/0.93	Derived: backwards(f10(f3(A,B),A,B)) = A | happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | -happens(pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(55,d,40,b)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(55,d,45,d)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(55,d,46,d)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(55,d,47,d)].
0.61/0.93	56 backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | push(f9(A,B,C),f10(A,B,C)) = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.93	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | happens(push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | -startedIn(A,C,B).  [resolve(56,d,38,a)].
0.61/0.93	Derived: backwards(f10(f3(A,B),A,B)) = A | happens(push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(56,d,40,b)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | push(f9(A,B,C),f10(A,B,C)) = A | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(56,d,45,d)].
0.61/0.93	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | push(f9(A,B,C),f10(A,B,C)) = A | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(56,d,46,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | happens(push(f9(A,B,C),f10(A,B,C)),C) | push(f9(A,B,C),f10(A,B,C)) = A | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(56,d,47,d)].
0.61/0.94	57 backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.94	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | forwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | -startedIn(A,C,B).  [resolve(57,d,38,a)].
0.61/0.94	Derived: backwards(f10(f3(A,B),A,B)) = A | spinning(f10(f3(A,B),A,B)) = A | forwards(f10(f3(A,B),A,B)) = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(57,d,40,b)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(57,d,45,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(57,d,46,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | forwards(f10(A,B,C)) = B | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(57,d,47,d)].
0.61/0.94	58 backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.94	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | -happens(pull(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))),f2(A,B,C)) | -startedIn(A,C,B).  [resolve(58,d,38,a)].
0.61/0.94	Derived: backwards(f10(f3(A,B),A,B)) = A | spinning(f10(f3(A,B),A,B)) = A | -happens(pull(f9(f3(A,B),A,B),f10(f3(A,B),A,B)),B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(58,d,40,b)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(58,d,45,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(58,d,46,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | -happens(pull(f9(A,B,C),f10(A,B,C)),C) | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(58,d,47,d)].
0.61/0.94	59 backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
0.61/0.94	Derived: backwards(f10(f1(A,B,C),C,f2(A,B,C))) = C | spinning(f10(f1(A,B,C),C,f2(A,B,C))) = C | push(f9(f1(A,B,C),C,f2(A,B,C)),f10(f1(A,B,C),C,f2(A,B,C))) = f1(A,B,C) | -startedIn(A,C,B).  [resolve(59,d,38,a)].
0.61/0.94	Derived: backwards(f10(f3(A,B),A,B)) = A | spinning(f10(f3(A,B),A,B)) = A | push(f9(f3(A,B),A,B),f10(f3(A,B),A,B)) = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)).  [resolve(59,d,40,b)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | pull(D,E) != A | happens(push(D,E),C) | backwards(E) != B.  [resolve(59,d,45,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | -happens(push(D,E),C) | pull(D,E) != A | spinning(E) != B.  [resolve(59,d,46,d)].
0.61/0.94	Derived: backwards(f10(A,B,C)) = B | spinning(f10(A,B,C)) = B | push(f9(A,B,C),f10(A,B,C)) = A | forwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(59,d,47,d)].
0.61/0.94	60 terminates(f4(A,B,C),B,f5(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom).  [clausify(8)].
0.61/0.94	61 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(5)].
0.61/0.94	62 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom).  [clausify(6)].
0.61/0.94	63 -less(A,B) | -terminates(C,D,B) | -less(B,E) | -happens(C,B) | stoppedIn(A,D,E) # label(stoppedin_defn) # label(axiom).  [clausify(8)].
0.61/0.95	Derived: -stoppedIn(A,B,C) | -happens(f4(A,B,C),f5(A,B,C)) | -holdsAt(B,plus(f5(A,B,C),n1)).  [resolve(60,a,61,a)].
0.61/0.95	Derived: -stoppedIn(A,B,C) | -less(D,f5(A,B,C)) | -less(f5(A,B,C),E) | -happens(f4(A,B,C),f5(A,B,C)) | stoppedIn(D,B,E).  [resolve(60,a,63,b)].
0.61/0.95	64 -holdsAt(A,B) | terminates(f8(A,B),A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom).  [clausify(12)].
0.61/0.95	Derived: -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f8(A,B),B) | stoppedIn(C,A,D).  [resolve(64,b,63,b)].
0.61/0.95	65 happens(pull(A,B),C) | spinning(B) != D | push(A,B) != E | terminates(E,D,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: happens(pull(A,B),C) | spinning(B) != D | push(A,B) != E | -happens(E,C) | -holdsAt(D,plus(C,n1)).  [resolve(65,d,61,a)].
0.61/0.95	Derived: happens(pull(A,B),C) | spinning(B) != D | push(A,B) != E | -less(F,C) | -less(C,V6) | -happens(E,C) | stoppedIn(F,D,V6).  [resolve(65,d,63,b)].
0.61/0.95	66 pull(A,B) != C | -happens(push(A,B),D) | forwards(B) != E | terminates(C,E,D) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: pull(A,B) != C | -happens(push(A,B),D) | forwards(B) != E | -happens(C,D) | -holdsAt(E,plus(D,n1)).  [resolve(66,d,61,a)].
0.61/0.95	Derived: pull(A,B) != C | -happens(push(A,B),D) | forwards(B) != E | -less(F,D) | -less(D,V6) | -happens(C,D) | stoppedIn(F,E,V6).  [resolve(66,d,63,b)].
0.61/0.95	67 happens(push(A,B),C) | spinning(B) != D | pull(A,B) != E | terminates(E,D,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: happens(push(A,B),C) | spinning(B) != D | pull(A,B) != E | -happens(E,C) | -holdsAt(D,plus(C,n1)).  [resolve(67,d,61,a)].
0.61/0.95	Derived: happens(push(A,B),C) | spinning(B) != D | pull(A,B) != E | -less(F,C) | -less(C,V6) | -happens(E,C) | stoppedIn(F,D,V6).  [resolve(67,d,63,b)].
0.61/0.95	68 pull(A,B) != C | -happens(push(A,B),D) | backwards(B) != E | terminates(C,E,D) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: pull(A,B) != C | -happens(push(A,B),D) | backwards(B) != E | -happens(C,D) | -holdsAt(E,plus(D,n1)).  [resolve(68,d,61,a)].
0.61/0.95	Derived: pull(A,B) != C | -happens(push(A,B),D) | backwards(B) != E | -less(F,D) | -less(D,V6) | -happens(C,D) | stoppedIn(F,E,V6).  [resolve(68,d,63,b)].
0.61/0.95	69 forwards(A) != B | pull(C,A) != D | happens(push(C,A),E) | terminates(D,B,E) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: forwards(A) != B | pull(C,A) != D | happens(push(C,A),E) | -happens(D,E) | -holdsAt(B,plus(E,n1)).  [resolve(69,d,61,a)].
0.61/0.95	Derived: forwards(A) != B | pull(C,A) != D | happens(push(C,A),E) | -less(F,E) | -less(E,V6) | -happens(D,E) | stoppedIn(F,B,V6).  [resolve(69,d,63,b)].
0.61/0.95	70 backwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | terminates(E,B,D) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: backwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | -happens(E,D) | -holdsAt(B,plus(D,n1)).  [resolve(70,d,61,a)].
0.61/0.95	Derived: backwards(A) != B | happens(pull(C,A),D) | push(C,A) != E | -less(F,D) | -less(D,V6) | -happens(E,D) | stoppedIn(F,B,V6).  [resolve(70,d,63,b)].
0.61/0.95	71 -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: -happens(pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | -stoppedIn(A,B,C).  [resolve(71,c,60,a)].
0.61/0.95	Derived: -happens(pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(71,c,64,b)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(71,c,65,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(71,c,66,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(71,c,67,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(71,c,68,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(71,c,69,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(71,c,70,d)].
0.61/0.95	72 -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: -happens(pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | forwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -happens(push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | backwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -stoppedIn(A,B,C).  [resolve(72,e,60,a)].
0.61/0.95	Derived: -happens(pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | forwards(f12(f8(A,B),A,B)) = A | -happens(push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | backwards(f12(f8(A,B),A,B)) = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(72,e,64,b)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(72,e,65,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(72,e,66,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(72,e,67,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(72,e,68,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(72,e,69,d)].
0.61/0.95	Derived: -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(72,e,70,d)].
0.61/0.95	73 spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: spinning(f12(f4(A,B,C),B,f5(A,B,C))) = B | pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | backwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -stoppedIn(A,B,C).  [resolve(73,d,60,a)].
0.61/0.95	Derived: spinning(f12(f8(A,B),A,B)) = A | pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | backwards(f12(f8(A,B),A,B)) = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(73,d,64,b)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(73,d,65,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(73,d,66,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(73,d,67,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(73,d,68,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(73,d,69,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(f12(A,B,C)) = B | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(73,d,70,d)].
0.61/0.95	74 spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: spinning(f12(f4(A,B,C),B,f5(A,B,C))) = B | happens(push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | forwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -happens(pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | -stoppedIn(A,B,C).  [resolve(74,e,60,a)].
0.61/0.95	Derived: spinning(f12(f8(A,B),A,B)) = A | happens(push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | forwards(f12(f8(A,B),A,B)) = A | -happens(pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(74,e,64,b)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(74,e,65,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(74,e,66,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(74,e,67,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(74,e,68,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(74,e,69,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | -happens(pull(f11(A,B,C),f12(A,B,C)),C) | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(74,e,70,d)].
0.61/0.95	75 spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: spinning(f12(f4(A,B,C),B,f5(A,B,C))) = B | happens(push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | forwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | -stoppedIn(A,B,C).  [resolve(75,e,60,a)].
0.61/0.95	Derived: spinning(f12(f8(A,B),A,B)) = A | happens(push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | forwards(f12(f8(A,B),A,B)) = A | push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(75,e,64,b)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(75,e,65,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(75,e,66,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(75,e,67,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(75,e,68,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(75,e,69,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | happens(push(f11(A,B,C),f12(A,B,C)),C) | forwards(f12(A,B,C)) = B | push(f11(A,B,C),f12(A,B,C)) = A | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(75,e,70,d)].
0.61/0.95	76 spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: spinning(f12(f4(A,B,C),B,f5(A,B,C))) = B | forwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | backwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -stoppedIn(A,B,C).  [resolve(76,d,60,a)].
0.61/0.95	Derived: spinning(f12(f8(A,B),A,B)) = A | forwards(f12(f8(A,B),A,B)) = A | backwards(f12(f8(A,B),A,B)) = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(76,d,64,b)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(76,d,65,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(76,d,66,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(76,d,67,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(76,d,68,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(76,d,69,d)].
0.61/0.95	Derived: spinning(f12(A,B,C)) = B | forwards(f12(A,B,C)) = B | backwards(f12(A,B,C)) = B | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(76,d,70,d)].
0.61/0.95	77 push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | pull(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | -stoppedIn(A,B,C).  [resolve(77,c,60,a)].
0.61/0.95	Derived: push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | pull(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(77,c,64,b)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(77,c,65,d)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(77,c,66,d)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(77,c,67,d)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(77,c,68,d)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(77,c,69,d)].
0.61/0.95	Derived: push(f11(A,B,C),f12(A,B,C)) = A | pull(f11(A,B,C),f12(A,B,C)) = A | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(77,c,70,d)].
0.61/0.95	78 push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom).  [clausify(15)].
0.61/0.95	Derived: push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))) = f4(A,B,C) | forwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -happens(push(f11(f4(A,B,C),B,f5(A,B,C)),f12(f4(A,B,C),B,f5(A,B,C))),f5(A,B,C)) | backwards(f12(f4(A,B,C),B,f5(A,B,C))) = B | -stoppedIn(A,B,C).  [resolve(78,e,60,a)].
2.29/2.62	Derived: push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)) = f8(A,B) | forwards(f12(f8(A,B),A,B)) = A | -happens(push(f11(f8(A,B),A,B),f12(f8(A,B),A,B)),B) | backwards(f12(f8(A,B),A,B)) = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)).  [resolve(78,e,64,b)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | happens(pull(D,E),C) | spinning(E) != B | push(D,E) != A.  [resolve(78,e,65,d)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | forwards(E) != B.  [resolve(78,e,66,d)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | happens(push(D,E),C) | spinning(E) != B | pull(D,E) != A.  [resolve(78,e,67,d)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | pull(D,E) != A | -happens(push(D,E),C) | backwards(E) != B.  [resolve(78,e,68,d)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | forwards(D) != B | pull(E,D) != A | happens(push(E,D),C).  [resolve(78,e,69,d)].
2.29/2.62	Derived: push(f11(A,B,C),f12(A,B,C)) = A | forwards(f12(A,B,C)) = B | -happens(push(f11(A,B,C),f12(A,B,C)),C) | backwards(f12(A,B,C)) = B | backwards(D) != B | happens(pull(E,D),C) | push(E,D) != A.  [resolve(78,e,70,d)].
2.29/2.62	79 releases(f6(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(9)].
2.29/2.62	80 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(7)].
2.29/2.62	81 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(18)].
2.29/2.62	
2.29/2.62	============================== end predicate elimination =============
2.29/2.62	
2.29/2.62	Auto_denials:  (non-Horn, no changes).
2.29/2.62	
2.29/2.62	Term ordering decisions:
2.29/2.62	Function symbol KB weights:  n1=1. n0=1. n2=1. n3=1. n4=1. n5=1. n6=1. agent1=1. agent10=1. agent2=1. agent3=1. agent4=1. agent5=1. agent6=1. agent7=1. agent8=1. agent9=1. n7=1. n8=1. trolley1=1. trolley10=1. trolley2=1. trolley3=1. trolley4=1. trolley5=1. trolley6=1. trolley7=1. trolley8=1. trolley9=1. n9=1. push=1. pull=1. plus=1. f3=1. f6=1. f7=1. f8=1. spinning=1. backwards=1. forwards=1. f1=1. f2=1. f4=1. f5=1. f9=1. f10=1. f11=1. f12=1.
2.29/2.62	
2.29/2.62	============================== end of process initial clauses ========
2.29/2.62	
2.29/2.62	============================== CLAUSES FOR SEARCH ====================
2.29/2.62	
2.29/2.62	============================== end of clauses for search =============
2.29/2.62	
2.29/2.62	============================== SEARCH ================================
2.29/2.62	
2.29/2.62	% Starting search at 0.09 seconds.
2.29/2.62	
2.29/2.62	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 139 (0.00 of 0.19 sec).
2.29/2.62	
2.29/2.62	Low Water (keep): wt=36.000, iters=3390
2.29/2.62	
2.29/2.62	Low Water (keep): wt=33.000, iters=3389
2.29/2.62	
2.29/2.62	============================== PROOF =================================
2.29/2.62	% SZS status Theorem
2.29/2.62	% SZS output start Refutation
2.29/2.62	
2.29/2.62	% Proof 1 at 1.67 (+ 0.05) seconds.
2.29/2.62	% Length of proof is 112.
2.29/2.62	% Level of proof is 16.
2.29/2.62	% Maximum clause weight is 40.000.
2.29/2.62	% Given clauses 1186.
2.29/2.62	
2.29/2.62	3 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause).  [assumption].
2.29/2.62	14 (all Event all Fluent all Time ((exists Agent exists Trolley (pull(Agent,Trolley) = Event & -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent | happens(push(Agent,Trolley),Time) & Event = pull(Agent,Trolley) & spinning(Trolley) = Fluent | Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event)) <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
2.29/2.62	22 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
2.29/2.62	29 (all Event all Time (happens(Event,Time) <-> Event = push(agent1,trolley1) & n0 = Time | push(agent3,trolley3) = Event & n0 = Time | Time = n0 & Event = pull(agent4,trolley4) | Time = n0 & Event = pull(agent6,trolley6) | Event = push(agent6,trolley6) & n0 = Time | n0 = Time & Event = pull(agent7,trolley7) | n0 = Time & Event = pull(agent8,trolley8) | push(agent8,trolley8) = Event & n0 = Time | pull(agent9,trolley9) = Event & n0 = Time | Event = push(agent9,trolley9) & Time = n0 | n0 = Time & Event = pull(agent10,trolley10) | Time = n0 & push(agent10,trolley10) = Event | push(agent7,trolley7) = Event & n0 = Time | Time = n0 & push(agent5,trolley5) = Event | Time = n0 & Event = pull(agent5,trolley5) | Time = n0 & push(agent4,trolley4) = Event | Event = pull(agent3,trolley3) & Time = n0 | n0 = Time & push(agent2,trolley2) = Event | Time = n0 & Event = pull(agent2,trolley2) | Event = pull(agent1,trolley1) & Time = n0)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
2.29/2.62	37 -(holdsAt(spinning(trolley1),n1) & holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley10),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley3),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
2.29/2.62	41 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(3)].
2.29/2.62	46 -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | initiates(D,E,C) # label(initiates_all_defn) # label(axiom).  [clausify(14)].
2.29/2.62	100 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(22)].
2.29/2.62	134 plus(n0,n0) = n0 # label(plus0_0) # label(axiom).  [assumption].
2.29/2.62	286 happens(A,B) | push(agent1,trolley1) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	287 happens(A,B) | push(agent3,trolley3) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	288 happens(A,B) | n0 != B | pull(agent4,trolley4) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	289 happens(A,B) | n0 != B | pull(agent6,trolley6) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	290 happens(A,B) | push(agent6,trolley6) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	291 happens(A,B) | n0 != B | pull(agent7,trolley7) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	292 happens(A,B) | n0 != B | pull(agent8,trolley8) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	293 happens(A,B) | push(agent8,trolley8) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	294 happens(A,B) | pull(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	295 happens(A,B) | push(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	296 happens(A,B) | n0 != B | pull(agent10,trolley10) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	297 happens(A,B) | n0 != B | push(agent10,trolley10) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	298 happens(A,B) | push(agent7,trolley7) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	299 happens(A,B) | n0 != B | push(agent5,trolley5) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	300 happens(A,B) | n0 != B | pull(agent5,trolley5) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	301 happens(A,B) | n0 != B | push(agent4,trolley4) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	302 happens(A,B) | pull(agent3,trolley3) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	303 happens(A,B) | n0 != B | push(agent2,trolley2) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	304 happens(A,B) | n0 != B | pull(agent2,trolley2) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	305 happens(A,B) | pull(agent1,trolley1) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
2.29/2.62	318 n1 = plus(n0,n1) # label(plus0_1) # label(axiom).  [assumption].
2.29/2.62	319 plus(n1,n0) = n1.  [copy(318),rewrite([100(4)]),flip(a)].
2.29/2.62	326 -holdsAt(spinning(trolley1),n1) | -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley3),n1) # label(spinning_3) # label(negated_conjecture).  [clausify(37)].
2.29/2.62	340 -happens(push(A,B),C) | pull(A,B) != D | spinning(B) != E | -happens(D,C) | holdsAt(E,plus(C,n1)).  [resolve(46,d,41,a)].
2.29/2.62	517 happens(push(agent1,trolley1),A) | n0 != A.  [xx_res(286,b)].
2.29/2.62	519 happens(push(agent3,trolley3),A) | n0 != A.  [xx_res(287,b)].
2.29/2.62	521 happens(A,n0) | pull(agent4,trolley4) != A.  [resolve(288,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	523 happens(A,n0) | pull(agent6,trolley6) != A.  [resolve(289,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	525 happens(push(agent6,trolley6),A) | n0 != A.  [xx_res(290,b)].
2.29/2.62	527 happens(A,n0) | pull(agent7,trolley7) != A.  [resolve(291,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	529 happens(A,n0) | pull(agent8,trolley8) != A.  [resolve(292,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	531 happens(push(agent8,trolley8),A) | n0 != A.  [xx_res(293,b)].
2.29/2.62	533 happens(pull(agent9,trolley9),A) | n0 != A.  [xx_res(294,b)].
2.29/2.62	535 happens(push(agent9,trolley9),A) | n0 != A.  [xx_res(295,b)].
2.29/2.62	537 happens(A,n0) | pull(agent10,trolley10) != A.  [resolve(296,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	539 happens(A,n0) | push(agent10,trolley10) != A.  [resolve(297,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	541 happens(push(agent7,trolley7),A) | n0 != A.  [xx_res(298,b)].
2.29/2.62	543 happens(A,n0) | push(agent5,trolley5) != A.  [resolve(299,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	545 happens(A,n0) | pull(agent5,trolley5) != A.  [resolve(300,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	547 happens(A,n0) | push(agent4,trolley4) != A.  [resolve(301,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	549 happens(pull(agent3,trolley3),A) | n0 != A.  [xx_res(302,b)].
2.29/2.62	551 happens(A,n0) | push(agent2,trolley2) != A.  [resolve(303,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	553 happens(A,n0) | pull(agent2,trolley2) != A.  [resolve(304,b,134,a(flip)),rewrite([134(3)])].
2.29/2.62	555 happens(pull(agent1,trolley1),A) | n0 != A.  [xx_res(305,b)].
2.29/2.62	1052 happens(push(agent1,trolley1),n0).  [resolve(517,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1120 happens(push(agent3,trolley3),n0).  [resolve(519,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1237 happens(pull(agent4,trolley4),n0).  [xx_res(521,b)].
2.29/2.62	1293 happens(pull(agent6,trolley6),n0).  [xx_res(523,b)].
2.29/2.62	1434 happens(push(agent6,trolley6),n0).  [resolve(525,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1502 happens(pull(agent7,trolley7),n0).  [xx_res(527,b)].
2.29/2.62	1582 happens(pull(agent8,trolley8),n0).  [xx_res(529,b)].
2.29/2.62	1674 happens(push(agent8,trolley8),n0).  [resolve(531,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1754 happens(pull(agent9,trolley9),n0).  [resolve(533,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1798 pull(agent1,trolley1) != A | spinning(trolley1) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1052,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1830 pull(agent3,trolley3) != A | spinning(trolley3) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1120,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1868 pull(agent6,trolley6) != A | spinning(trolley6) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1434,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1870 happens(push(agent9,trolley9),n0).  [resolve(535,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	1907 pull(agent8,trolley8) != A | spinning(trolley8) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1674,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1942 pull(agent9,trolley9) != A | spinning(trolley9) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1870,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1945 happens(pull(agent10,trolley10),n0).  [xx_res(537,b)].
2.29/2.62	1949 happens(push(agent10,trolley10),n0).  [xx_res(539,b)].
2.29/2.62	1980 pull(agent10,trolley10) != A | spinning(trolley10) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1949,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	1982 happens(push(agent7,trolley7),n0).  [resolve(541,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	2013 pull(agent7,trolley7) != A | spinning(trolley7) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(1982,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	2015 happens(push(agent5,trolley5),n0).  [xx_res(543,b)].
2.29/2.62	2046 pull(agent5,trolley5) != A | spinning(trolley5) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(2015,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	2048 happens(pull(agent5,trolley5),n0).  [xx_res(545,b)].
2.29/2.62	2052 happens(push(agent4,trolley4),n0).  [xx_res(547,b)].
2.29/2.62	2083 pull(agent4,trolley4) != A | spinning(trolley4) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(2052,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	2085 happens(pull(agent3,trolley3),n0).  [resolve(549,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	2089 happens(push(agent2,trolley2),n0).  [xx_res(551,b)].
2.29/2.62	2120 pull(agent2,trolley2) != A | spinning(trolley2) != B | -happens(A,n0) | holdsAt(B,n1).  [resolve(2089,a,340,a),rewrite([100(12),319(12)])].
2.29/2.62	2122 happens(pull(agent2,trolley2),n0).  [xx_res(553,b)].
2.29/2.62	2126 happens(pull(agent1,trolley1),n0).  [resolve(555,b,134,a(flip)),rewrite([134(6)])].
2.29/2.62	7255 spinning(trolley1) != A | holdsAt(A,n1).  [resolve(1798,c,2126,a),xx(a)].
2.29/2.62	7256 holdsAt(spinning(trolley1),n1).  [xx_res(7255,a)].
2.29/2.62	7257 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(326),unit_del(a,7256)].
2.29/2.62	7269 spinning(trolley3) != A | holdsAt(A,n1).  [resolve(1830,c,2085,a),xx(a)].
2.29/2.62	7270 holdsAt(spinning(trolley3),n1).  [xx_res(7269,a)].
2.29/2.62	7271 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7257),unit_del(i,7270)].
2.29/2.62	7295 spinning(trolley6) != A | holdsAt(A,n1).  [resolve(1868,c,1293,a),xx(a)].
2.29/2.62	7296 holdsAt(spinning(trolley6),n1).  [xx_res(7295,a)].
2.29/2.62	7297 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7271),unit_del(g,7296)].
2.29/2.62	7318 spinning(trolley8) != A | holdsAt(A,n1).  [resolve(1907,c,1582,a),xx(a)].
2.29/2.62	7319 holdsAt(spinning(trolley8),n1).  [xx_res(7318,a)].
2.29/2.62	7320 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7297),unit_del(e,7319)].
2.29/2.62	7339 spinning(trolley9) != A | holdsAt(A,n1).  [resolve(1942,c,1754,a),xx(a)].
2.29/2.62	7340 holdsAt(spinning(trolley9),n1).  [xx_res(7339,a)].
2.29/2.62	7341 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7320),unit_del(d,7340)].
2.29/2.62	7358 spinning(trolley10) != A | holdsAt(A,n1).  [resolve(1980,c,1945,a),xx(a)].
2.29/2.62	7359 holdsAt(spinning(trolley10),n1).  [xx_res(7358,a)].
2.29/2.62	7360 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7341),unit_del(c,7359)].
2.29/2.62	7382 spinning(trolley7) != A | holdsAt(A,n1).  [resolve(2013,c,1502,a),xx(a)].
2.29/2.62	7383 holdsAt(spinning(trolley7),n1).  [xx_res(7382,a)].
2.29/2.62	7384 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1).  [back_unit_del(7360),unit_del(c,7383)].
2.29/2.62	7398 spinning(trolley5) != A | holdsAt(A,n1).  [resolve(2046,c,2048,a),xx(a)].
2.29/2.62	7399 holdsAt(spinning(trolley5),n1).  [xx_res(7398,a)].
2.29/2.62	7400 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1).  [back_unit_del(7384),unit_del(c,7399)].
2.29/2.62	7425 spinning(trolley4) != A | holdsAt(A,n1).  [resolve(2083,c,1237,a),xx(a)].
2.29/2.62	7426 holdsAt(spinning(trolley4),n1).  [xx_res(7425,a)].
2.29/2.62	7427 -holdsAt(spinning(trolley2),n1).  [back_unit_del(7400),unit_del(b,7426)].
2.29/2.62	7437 spinning(trolley2) != A | holdsAt(A,n1).  [resolve(2120,c,2122,a),xx(a)].
2.29/2.62	7438 $F.  [xx_res(7437,a),unit_del(a,7427)].
2.29/2.62	
2.29/2.62	% SZS output end Refutation
2.29/2.62	============================== end of proof ==========================
2.29/2.62	
2.29/2.62	============================== STATISTICS ============================
2.29/2.62	
2.29/2.62	Given=1186. Generated=43449. Kept=7281. proofs=1.
2.29/2.62	Usable=1177. Sos=6083. Demods=11. Limbo=0, Disabled=415. Hints=0.
2.29/2.62	Megabytes=11.10.
2.29/2.62	User_CPU=1.67, System_CPU=0.05, Wall_clock=2.
2.29/2.62	
2.29/2.62	============================== end of statistics =====================
2.29/2.62	
2.29/2.62	============================== end of search =========================
2.29/2.62	
2.29/2.62	THEOREM PROVED
2.29/2.62	% SZS status Theorem
2.29/2.62	
2.29/2.62	Exiting with 1 proof.
2.29/2.62	
2.29/2.62	Process 12435 exit (max_proofs) Thu Jul  2 07:48:21 2020
2.29/2.62	Prover9 interrupted
2.29/2.63	EOF