0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer   : n003.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 1200
0.14/0.34	% DateTime   : Tue Jul 13 12:19:09 EDT 2021
0.14/0.34	% CPUTime    : 
0.77/1.04	============================== Prover9 ===============================
0.77/1.04	Prover9 (32) version 2009-11A, November 2009.
0.77/1.04	Process 19720 was started by sandbox on n003.cluster.edu,
0.77/1.04	Tue Jul 13 12:19:10 2021
0.77/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_19416_n003.cluster.edu".
0.77/1.04	============================== end of head ===========================
0.77/1.04	
0.77/1.04	============================== INPUT =================================
0.77/1.04	
0.77/1.04	% Reading from file /tmp/Prover9_19416_n003.cluster.edu
0.77/1.04	
0.77/1.04	set(prolog_style_variables).
0.77/1.04	set(auto2).
0.77/1.04	    % set(auto2) -> set(auto).
0.77/1.04	    % set(auto) -> set(auto_inference).
0.77/1.04	    % set(auto) -> set(auto_setup).
0.77/1.04	    % set(auto_setup) -> set(predicate_elim).
0.77/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.04	    % set(auto) -> set(auto_limits).
0.77/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.04	    % set(auto) -> set(auto_denials).
0.77/1.04	    % set(auto) -> set(auto_process).
0.77/1.04	    % set(auto2) -> assign(new_constants, 1).
0.77/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.04	    % set(auto2) -> assign(max_hours, 1).
0.77/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.04	    % set(auto2) -> set(sort_initial_sos).
0.77/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.04	    % set(auto2) -> assign(max_megs, 400).
0.77/1.04	    % set(auto2) -> assign(stats, some).
0.77/1.04	    % set(auto2) -> clear(echo_input).
0.77/1.04	    % set(auto2) -> set(quiet).
0.77/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.04	    % set(auto2) -> clear(print_given).
0.77/1.04	assign(lrs_ticks,-1).
0.77/1.04	assign(sos_limit,10000).
0.77/1.04	assign(order,kbo).
0.77/1.04	set(lex_order_vars).
0.77/1.04	clear(print_given).
0.77/1.04	
0.77/1.04	% formulas(sos).  % not echoed (48 formulas)
0.77/1.04	
0.77/1.04	============================== end of input ==========================
0.77/1.04	
0.77/1.04	% From the command line: assign(max_seconds, 1200).
0.77/1.04	
0.77/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.04	
0.77/1.04	% Formulas that are not ordinary clauses:
0.77/1.04	1 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))))) # label(startedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.04	2 (all Event all Time all Fluent all Fluent2 all Offset (happens(Event,Time) & less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.77/1.04	3 (all Event all Time all Fluent (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause).  [assumption].
0.77/1.04	4 (all Fluent all Time (-(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause).  [assumption].
0.77/1.04	5 (all Fluent all Time (-(exists Event ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time))) & releasedAt(Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.77/1.04	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.77/1.04	7 (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.77/1.04	8 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (terminates(Event,Fluent1,Time1) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & less(n0,Time2) & happens(Event,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	9 (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.77/1.05	10 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	11 (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.77/1.05	12 (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.77/1.05	13 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> push = Event & Fluent = forwards & -happens(pull,Time) | backwards = Fluent & -happens(push,Time) & pull = Event | spinning = Fluent & happens(push,Time) & pull = Event)) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	14 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	15 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> -happens(pull,Time) & backwards = Fluent & Event = push | pull = Event & -happens(push,Time) & forwards = Fluent | push = Event & -happens(pull,Time) & Fluent = spinning | -happens(push,Time) & Fluent = spinning & pull = Event | Event = pull & happens(push,Time) & backwards = Fluent | happens(push,Time) & Fluent = forwards & Event = pull)) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	16 (all Event all Time (happens(Event,Time) <-> push = Event & n2 = Time | n2 = Time & pull = Event | Event = pull & Time = n1 | Time = n0 & push = Event)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	17 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	18 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	19 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	20 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	21 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	22 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	23 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.77/1.05	24 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	25 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	26 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	27 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	28 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	29 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	30 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	31 --holdsAt(spinning,n2) # label(not_spinning_2) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.05	
0.77/1.05	============================== end of process non-clausal formulas ===
0.77/1.05	
0.77/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.05	
0.77/1.05	============================== PREDICATE ELIMINATION =================
0.77/1.05	32 startedIn(A,B,C) | -less(A,D) | -initiates(E,B,D) | -less(D,C) | -happens(E,D) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.05	33 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.05	34 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.05	35 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.05	36 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.05	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(A,f2(A,E,D)).  [resolve(32,a,33,a)].
0.77/1.05	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | initiates(f1(A,E,D),D,f2(A,E,D)).  [resolve(32,a,34,a)].
0.77/1.05	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(f2(A,E,D),E).  [resolve(32,a,35,a)].
0.77/1.05	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | happens(f1(A,E,D),f2(A,E,D)).  [resolve(32,a,36,a)].
0.77/1.05	37 -terminates(A,B,C) | startedIn(C,B,plus(C,D)) | -antitrajectory(B,C,E,D) | -less(n0,D) | -happens(A,C) | holdsAt(E,plus(C,D)) # label(antitrajectory) # label(axiom).  [clausify(8)].
0.77/1.05	Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | less(C,f2(C,plus(C,E),B)).  [resolve(37,b,33,a)].
0.77/1.05	Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | initiates(f1(C,plus(C,E),B),B,f2(C,plus(C,E),B)).  [resolve(37,b,34,a)].
0.77/1.05	Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | less(f2(C,plus(C,E),B),plus(C,E)).  [resolve(37,b,35,a)].
0.77/1.05	Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | happens(f1(C,plus(C,E),B),f2(C,plus(C,E),B)).  [resolve(37,b,36,a)].
0.77/1.05	38 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.05	39 -happens(A,B) | -less(n0,C) | stoppedIn(B,D,plus(B,C)) | -trajectory(D,B,E,C) | -initiates(A,D,B) | holdsAt(E,plus(B,C)) # label(change_holding) # label(axiom).  [clausify(2)].
0.77/1.05	Derived: less(A,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)).  [resolve(38,a,39,c)].
0.77/1.05	40 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.05	Derived: less(f6(A,B,plus(A,C)),plus(A,C)) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)).  [resolve(40,a,39,c)].
0.77/1.05	41 -stoppedIn(A,B,C) | terminates(f5(A,B,C),B,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.05	Derived: terminates(f5(A,B,plus(A,C)),B,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)).  [resolve(41,a,39,c)].
0.77/1.05	42 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.05	Derived: happens(f5(A,B,plus(A,C)),f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)).  [resolve(42,a,39,c)].
0.77/1.05	43 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.05	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)).  [resolve(43,a,38,a)].
0.77/1.05	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C).  [resolve(43,a,40,a)].
0.77/1.05	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | terminates(f5(A,E,C),E,f6(A,E,C)).  [resolve(43,a,41,a)].
0.77/1.05	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | happens(f5(A,E,C),f6(A,E,C)).  [resolve(43,a,42,a)].
0.77/1.05	44 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(12)].
0.77/1.05	45 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(4)].
1.13/1.40	46 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(14)].
1.13/1.40	
1.13/1.40	============================== end predicate elimination =============
1.13/1.40	
1.13/1.40	Auto_denials:  (non-Horn, no changes).
1.13/1.40	
1.13/1.40	Term ordering decisions:
1.13/1.40	Function symbol KB weights:  push=1. pull=1. n1=1. n2=1. spinning=1. backwards=1. forwards=1. n0=1. n3=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f3=1. f4=1. f7=1. f8=1. f1=1. f2=1. f5=1. f6=1.
1.13/1.40	
1.13/1.40	============================== end of process initial clauses ========
1.13/1.40	
1.13/1.40	============================== CLAUSES FOR SEARCH ====================
1.13/1.40	
1.13/1.40	============================== end of clauses for search =============
1.13/1.40	
1.13/1.40	============================== SEARCH ================================
1.13/1.40	
1.13/1.40	% Starting search at 0.03 seconds.
1.13/1.40	
1.13/1.40	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 86 (0.00 of 0.31 sec).
1.13/1.40	
1.13/1.40	============================== PROOF =================================
1.13/1.40	% SZS status Theorem
1.13/1.40	% SZS output start Refutation
1.13/1.40	
1.13/1.40	% Proof 1 at 0.36 (+ 0.02) seconds.
1.13/1.40	% Length of proof is 36.
1.13/1.40	% Level of proof is 6.
1.13/1.40	% Maximum clause weight is 13.000.
1.13/1.40	% Given clauses 529.
1.13/1.40	
1.13/1.40	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].
1.13/1.40	15 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> -happens(pull,Time) & backwards = Fluent & Event = push | pull = Event & -happens(push,Time) & forwards = Fluent | push = Event & -happens(pull,Time) & Fluent = spinning | -happens(push,Time) & Fluent = spinning & pull = Event | Event = pull & happens(push,Time) & backwards = Fluent | happens(push,Time) & Fluent = forwards & Event = pull)) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	16 (all Event all Time (happens(Event,Time) <-> push = Event & n2 = Time | n2 = Time & pull = Event | Event = pull & Time = n1 | Time = n0 & push = Event)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	19 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	20 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	22 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	26 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	30 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
1.13/1.40	31 --holdsAt(spinning,n2) # label(not_spinning_2) # label(negated_conjecture) # label(non_clause).  [assumption].
1.13/1.40	52 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(6)].
1.13/1.40	75 push != pull # label(push_not_pull) # label(axiom).  [assumption].
1.13/1.40	76 pull != push.  [copy(75),flip(a)].
1.13/1.40	90 terminates(A,B,C) | happens(push,C) | spinning != B | pull != A # label(terminates_all_defn) # label(axiom).  [clausify(15)].
1.13/1.40	94 -happens(A,B) | n2 = B | pull = A | n0 = B # label(happens_all_defn) # label(axiom).  [clausify(16)].
1.13/1.40	99 happens(A,B) | pull != A | n1 != B # label(happens_all_defn) # label(axiom).  [clausify(16)].
1.13/1.40	113 -less_or_equal(A,n1) | less(A,n2) # label(less2) # label(axiom).  [clausify(19)].
1.13/1.40	117 plus(n0,n1) = n1 # label(plus0_1) # label(axiom).  [assumption].
1.13/1.40	121 plus(n1,n1) = n2 # label(plus1_1) # label(axiom).  [assumption].
1.13/1.40	124 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(20)].
1.13/1.40	129 -less(A,B) | B != A # label(less_property) # label(axiom).  [clausify(22)].
1.13/1.40	136 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom).  [clausify(26)].
1.13/1.40	144 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(30)].
1.13/1.40	147 holdsAt(spinning,n2) # label(not_spinning_2) # label(negated_conjecture).  [clausify(31)].
1.13/1.40	162 plus(n1,n0) = n1.  [back_rewrite(117),rewrite([144(3)])].
1.13/1.40	173 terminates(A,spinning,B) | happens(push,B) | pull != A.  [xx_res(90,c)].
1.13/1.40	179 happens(pull,A) | n1 != A.  [xx_res(99,b)].
1.13/1.40	188 less_or_equal(A,A).  [xx_res(124,b)].
1.13/1.40	209 less(n0,n1).  [resolve(188,a,136,a)].
1.13/1.40	213 less(n1,n2).  [resolve(188,a,113,a)].
1.13/1.40	222 n0 != n1.  [resolve(209,a,129,a),flip(a)].
1.13/1.40	233 n2 != n1.  [resolve(213,a,129,a)].
1.13/1.40	298 terminates(pull,spinning,A) | happens(push,A).  [xx_res(173,c)].
1.13/1.40	341 happens(pull,n1).  [resolve(179,b,162,a(flip)),rewrite([162(4)])].
1.13/1.40	435 happens(push,A) | -happens(pull,A) | -holdsAt(spinning,plus(A,n1)).  [resolve(298,a,52,a)].
1.13/1.40	5094 happens(push,n1).  [para(121(a,1),435(c,2)),unit_del(b,341),unit_del(c,147)].
1.13/1.40	5095 $F.  [resolve(5094,a,94,a),unit_del(a,233),unit_del(b,76),unit_del(c,222)].
1.13/1.40	
1.13/1.40	% SZS output end Refutation
1.13/1.40	============================== end of proof ==========================
1.13/1.40	
1.13/1.40	============================== STATISTICS ============================
1.13/1.40	
1.13/1.40	Given=529. Generated=9397. Kept=5040. proofs=1.
1.13/1.40	Usable=524. Sos=4462. Demods=12. Limbo=0, Disabled=178. Hints=0.
1.13/1.40	Megabytes=5.59.
1.13/1.40	User_CPU=0.36, System_CPU=0.02, Wall_clock=0.
1.13/1.40	
1.13/1.40	============================== end of statistics =====================
1.13/1.40	
1.13/1.40	============================== end of search =========================
1.13/1.40	
1.13/1.40	THEOREM PROVED
1.13/1.40	% SZS status Theorem
1.13/1.40	
1.13/1.40	Exiting with 1 proof.
1.13/1.40	
1.13/1.40	Process 19720 exit (max_proofs) Tue Jul 13 12:19:10 2021
1.13/1.40	Prover9 interrupted
1.13/1.41	EOF