0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer   : n013.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1200
0.10/0.32	% DateTime   : Tue Jul 13 12:03:48 EDT 2021
0.10/0.32	% CPUTime    : 
0.77/1.06	============================== Prover9 ===============================
0.77/1.06	Prover9 (32) version 2009-11A, November 2009.
0.77/1.06	Process 31144 was started by sandbox on n013.cluster.edu,
0.77/1.06	Tue Jul 13 12:03:49 2021
0.77/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_30990_n013.cluster.edu".
0.77/1.06	============================== end of head ===========================
0.77/1.06	
0.77/1.06	============================== INPUT =================================
0.77/1.06	
0.77/1.06	% Reading from file /tmp/Prover9_30990_n013.cluster.edu
0.77/1.06	
0.77/1.06	set(prolog_style_variables).
0.77/1.06	set(auto2).
0.77/1.06	    % set(auto2) -> set(auto).
0.77/1.06	    % set(auto) -> set(auto_inference).
0.77/1.06	    % set(auto) -> set(auto_setup).
0.77/1.06	    % set(auto_setup) -> set(predicate_elim).
0.77/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.06	    % set(auto) -> set(auto_limits).
0.77/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.06	    % set(auto) -> set(auto_denials).
0.77/1.06	    % set(auto) -> set(auto_process).
0.77/1.06	    % set(auto2) -> assign(new_constants, 1).
0.77/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.06	    % set(auto2) -> assign(max_hours, 1).
0.77/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.06	    % set(auto2) -> set(sort_initial_sos).
0.77/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.06	    % set(auto2) -> assign(max_megs, 400).
0.77/1.06	    % set(auto2) -> assign(stats, some).
0.77/1.06	    % set(auto2) -> clear(echo_input).
0.77/1.06	    % set(auto2) -> set(quiet).
0.77/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.06	    % set(auto2) -> clear(print_given).
0.77/1.06	assign(lrs_ticks,-1).
0.77/1.06	assign(sos_limit,10000).
0.77/1.06	assign(order,kbo).
0.77/1.06	set(lex_order_vars).
0.77/1.06	clear(print_given).
0.77/1.06	
0.77/1.06	% formulas(sos).  % not echoed (48 formulas)
0.77/1.06	
0.77/1.06	============================== end of input ==========================
0.77/1.06	
0.77/1.06	% From the command line: assign(max_seconds, 1200).
0.77/1.06	
0.77/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.06	
0.77/1.06	% Formulas that are not ordinary clauses:
0.77/1.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	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.06	14 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	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.06	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.06	17 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	18 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.77/1.06	19 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	20 (all X all Y (less(X,Y) <-> Y != X & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	21 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	22 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	23 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	24 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	25 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	26 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	27 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	28 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	29 (all X all Y (less(X,Y) | X = Y <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	30 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	
0.77/1.06	============================== end of process non-clausal formulas ===
0.77/1.06	
0.77/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.06	
0.77/1.06	============================== PREDICATE ELIMINATION =================
0.77/1.06	31 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.06	32 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.06	33 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.06	34 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.06	35 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.77/1.06	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(A,f2(A,E,D)).  [resolve(31,a,32,a)].
0.77/1.06	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(31,a,33,a)].
0.77/1.06	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(f2(A,E,D),E).  [resolve(31,a,34,a)].
0.77/1.06	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | happens(f1(A,E,D),f2(A,E,D)).  [resolve(31,a,35,a)].
0.77/1.06	36 -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.06	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(36,b,32,a)].
0.77/1.06	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(36,b,33,a)].
0.77/1.06	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(36,b,34,a)].
0.77/1.06	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(36,b,35,a)].
0.77/1.06	37 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.06	38 -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.06	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(37,a,38,c)].
0.77/1.06	39 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.06	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(39,a,38,c)].
0.77/1.06	40 -stoppedIn(A,B,C) | terminates(f5(A,B,C),B,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.06	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(40,a,38,c)].
0.77/1.06	41 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.77/1.06	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(41,a,38,c)].
0.77/1.06	42 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.06	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)).  [resolve(42,a,37,a)].
0.77/1.06	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C).  [resolve(42,a,39,a)].
0.77/1.06	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(42,a,40,a)].
0.77/1.06	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | happens(f5(A,E,C),f6(A,E,C)).  [resolve(42,a,41,a)].
0.77/1.06	43 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(12)].
0.77/1.06	44 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(4)].
0.77/1.06	45 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(14)].
0.91/1.20	
0.91/1.20	============================== end predicate elimination =============
0.91/1.20	
0.91/1.20	Auto_denials:  (non-Horn, no changes).
0.91/1.20	
0.91/1.20	Term ordering decisions:
0.91/1.20	Function symbol KB weights:  push=1. pull=1. n1=1. n2=1. backwards=1. spinning=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.
0.91/1.20	
0.91/1.20	============================== end of process initial clauses ========
0.91/1.20	
0.91/1.20	============================== CLAUSES FOR SEARCH ====================
0.91/1.20	
0.91/1.20	============================== end of clauses for search =============
0.91/1.20	
0.91/1.20	============================== SEARCH ================================
0.91/1.20	
0.91/1.20	% Starting search at 0.02 seconds.
0.91/1.20	
0.91/1.20	============================== PROOF =================================
0.91/1.20	% SZS status Theorem
0.91/1.20	% SZS output start Refutation
0.91/1.20	
0.91/1.20	% Proof 1 at 0.15 (+ 0.01) seconds.
0.91/1.20	% Length of proof is 35.
0.91/1.20	% Level of proof is 6.
0.91/1.20	% Maximum clause weight is 13.000.
0.91/1.20	% Given clauses 419.
0.91/1.20	
0.91/1.20	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.91/1.20	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.91/1.20	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.91/1.20	20 (all X all Y (less(X,Y) <-> Y != X & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.91/1.20	21 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.91/1.20	24 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.91/1.20	26 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.91/1.20	29 (all X all Y (less(X,Y) | X = Y <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.91/1.20	52 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(7)].
0.91/1.20	70 initiates(A,B,C) | backwards != B | happens(push,C) | pull != A # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.91/1.20	74 push != pull # label(push_not_pull) # label(axiom).  [assumption].
0.91/1.20	75 pull != push.  [copy(74),flip(a)].
0.91/1.20	92 -happens(A,B) | n2 = B | pull = A | n0 = B # label(happens_all_defn) # label(axiom).  [clausify(16)].
0.91/1.20	97 happens(A,B) | pull != A | n1 != B # label(happens_all_defn) # label(axiom).  [clausify(16)].
0.91/1.20	107 plus(n1,n1) = n2 # label(plus1_1) # label(axiom).  [assumption].
0.91/1.20	108 -less(A,B) | B != A # label(less_property) # label(axiom).  [clausify(20)].
0.91/1.20	111 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(21)].
0.91/1.20	119 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom).  [clausify(24)].
0.91/1.20	123 -less_or_equal(A,n1) | less(A,n2) # label(less2) # label(axiom).  [clausify(26)].
0.91/1.20	128 plus(n0,n1) = n1 # label(plus0_1) # label(axiom).  [assumption].
0.91/1.20	129 plus(n1,n0) = n1.  [copy(128),rewrite([111(3)])].
0.91/1.20	134 A != B | less_or_equal(B,A) # label(less_or_equal) # label(axiom).  [clausify(29)].
0.91/1.20	145 -holdsAt(backwards,n2) # label(backwards_2) # label(negated_conjecture).  [assumption].
0.91/1.20	161 initiates(A,backwards,B) | happens(push,B) | pull != A.  [xx_res(70,b)].
0.91/1.20	175 happens(pull,A) | n1 != A.  [xx_res(97,b)].
0.91/1.20	198 less_or_equal(A,A).  [xx_res(134,a)].
0.91/1.20	206 less(n1,n2).  [resolve(198,a,123,a)].
0.91/1.20	208 less(n0,n1).  [resolve(198,a,119,a)].
0.91/1.20	223 n2 != n1.  [resolve(206,a,108,a)].
0.91/1.20	228 n0 != n1.  [resolve(208,a,108,a),flip(a)].
0.91/1.20	232 initiates(pull,backwards,A) | happens(push,A).  [xx_res(161,c)].
0.91/1.20	337 happens(pull,n1).  [resolve(175,b,129,a(flip)),rewrite([129(4)])].
0.91/1.20	404 happens(push,A) | -happens(pull,A) | holdsAt(backwards,plus(A,n1)).  [resolve(232,a,52,a)].
0.91/1.20	1700 happens(push,n1).  [resolve(404,b,337,a),rewrite([107(7)]),unit_del(b,145)].
0.91/1.20	1701 $F.  [resolve(1700,a,92,a),unit_del(a,223),unit_del(b,75),unit_del(c,228)].
0.91/1.20	
0.91/1.20	% SZS output end Refutation
0.91/1.20	============================== end of proof ==========================
0.91/1.20	
0.91/1.20	============================== STATISTICS ============================
0.91/1.20	
0.91/1.20	Given=419. Generated=3470. Kept=1648. proofs=1.
0.91/1.20	Usable=419. Sos=1159. Demods=11. Limbo=0, Disabled=194. Hints=0.
0.91/1.20	Megabytes=1.85.
0.91/1.20	User_CPU=0.15, System_CPU=0.01, Wall_clock=0.
0.91/1.20	
0.91/1.20	============================== end of statistics =====================
0.91/1.20	
0.91/1.20	============================== end of search =========================
0.91/1.20	
0.91/1.20	THEOREM PROVED
0.91/1.20	% SZS status Theorem
0.91/1.20	
0.91/1.20	Exiting with 1 proof.
0.91/1.20	
0.91/1.20	Process 31144 exit (max_proofs) Tue Jul 13 12:03:49 2021
0.91/1.20	Prover9 interrupted
0.91/1.21	EOF