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