0.11/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.14	% Command  : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer : n017.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit : 960
0.14/0.35	% WCLimit  : 120
0.14/0.35	% DateTime : Tue Aug  9 03:55:30 EDT 2022
0.14/0.36	% CPUTime  : 
0.84/1.09	============================== Prover9 ===============================
0.84/1.09	Prover9 (32) version 2009-11A, November 2009.
0.84/1.09	Process 10382 was started by sandbox2 on n017.cluster.edu,
0.84/1.09	Tue Aug  9 03:55:30 2022
0.84/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_10229_n017.cluster.edu".
0.84/1.09	============================== end of head ===========================
0.84/1.09	
0.84/1.09	============================== INPUT =================================
0.84/1.09	
0.84/1.09	% Reading from file /tmp/Prover9_10229_n017.cluster.edu
0.84/1.09	
0.84/1.09	set(prolog_style_variables).
0.84/1.09	set(auto2).
0.84/1.09	    % set(auto2) -> set(auto).
0.84/1.09	    % set(auto) -> set(auto_inference).
0.84/1.09	    % set(auto) -> set(auto_setup).
0.84/1.09	    % set(auto_setup) -> set(predicate_elim).
0.84/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.84/1.09	    % set(auto) -> set(auto_limits).
0.84/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.84/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.84/1.09	    % set(auto) -> set(auto_denials).
0.84/1.09	    % set(auto) -> set(auto_process).
0.84/1.09	    % set(auto2) -> assign(new_constants, 1).
0.84/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.84/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.84/1.09	    % set(auto2) -> assign(max_hours, 1).
0.84/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.84/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.84/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.84/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.84/1.09	    % set(auto2) -> set(sort_initial_sos).
0.84/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.84/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.84/1.09	    % set(auto2) -> assign(max_megs, 400).
0.84/1.09	    % set(auto2) -> assign(stats, some).
0.84/1.09	    % set(auto2) -> clear(echo_input).
0.84/1.09	    % set(auto2) -> set(quiet).
0.84/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.84/1.09	    % set(auto2) -> clear(print_given).
0.84/1.09	assign(lrs_ticks,-1).
0.84/1.09	assign(sos_limit,10000).
0.84/1.09	assign(order,kbo).
0.84/1.09	set(lex_order_vars).
0.84/1.09	clear(print_given).
0.84/1.09	
0.84/1.09	% formulas(sos).  % not echoed (167 formulas)
0.84/1.09	
0.84/1.09	============================== end of input ==========================
0.84/1.09	
0.84/1.09	% From the command line: assign(max_seconds, 960).
0.84/1.09	
0.84/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.84/1.09	
0.84/1.09	% Formulas that are not ordinary clauses:
0.84/1.09	1 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2))))) # label(startedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	2 (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.84/1.09	3 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & less(Time1,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	4 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	5 (all Fluent all Time (-releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -holdsAt(Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	6 (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.84/1.09	7 (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.84/1.09	8 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & terminates(Event,Fluent1,Time1) & less(n0,Time2) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	9 (all Event all Time all Fluent (happens(Event,Time) & releases(Event,Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	10 (all Event all Time all Fluent ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	11 (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.84/1.09	12 (all Fluent all Time (-(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) & releasedAt(Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	13 (all Agent all Trolley push(Agent,Trolley) != pull(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	14 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> (exists Agent exists Trolley (Event = push(Agent,Trolley) & backwards(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) | spinning(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event | Fluent = spinning(Trolley) & -happens(push(Agent,Trolley),Time) & pull(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & backwards(Trolley) = Fluent & happens(push(Agent,Trolley),Time) | happens(push(Agent,Trolley),Time) & forwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(push(Agent,Trolley),Time))))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	15 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent2 != Agent1 & Trolley1 != Trolley2 -> push(Agent1,Trolley1) != push(Agent2,Trolley2))) # label(push_unique) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	16 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (push(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) | -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & Fluent = spinning(Trolley))))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	17 (all Trolley spinning(Trolley) != forwards(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	18 (all Trolley backwards(Trolley) != spinning(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	19 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent1 != Agent2 & Trolley2 != Trolley1 -> pull(Agent1,Trolley1) != pull(Agent2,Trolley2))) # label(pull_unique) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	20 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	21 (all Trolley backwards(Trolley) != forwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	22 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	23 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	24 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.84/1.09	25 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	26 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	27 (all X all Y (less_or_equal(X,Y) <-> X = Y | less(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	28 (all X all Y (-less(Y,X) & Y != X <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	29 (all Event all Time (happens(Event,Time) <-> n0 = Time & Event = push(agent1,trolley1) | pull(agent2,trolley2) = Event & Time = n0 | pull(agent3,trolley3) = Event & n0 = Time | pull(agent4,trolley4) = Event & n0 = Time | push(agent4,trolley4) = Event & Time = n0 | pull(agent5,trolley5) = Event & n0 = Time | Event = push(agent5,trolley5) & n0 = Time | Time = n0 & Event = pull(agent6,trolley6) | Event = pull(agent7,trolley7) & n0 = Time | push(agent8,trolley8) = Event & n0 = Time | n0 = Time & push(agent10,trolley10) = Event | pull(agent10,trolley10) = Event & n0 = Time | Event = push(agent9,trolley9) & n0 = Time | Event = pull(agent9,trolley9) & Time = n0 | Time = n0 & Event = pull(agent8,trolley8) | n0 = Time & push(agent7,trolley7) = Event | push(agent6,trolley6) = Event & Time = n0 | n0 = Time & push(agent3,trolley3) = Event | n0 = Time & Event = push(agent2,trolley2) | n0 = Time & Event = pull(agent1,trolley1))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	30 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	31 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	32 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	33 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	34 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	35 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	36 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	37 -(holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley10),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley3),n1) & holdsAt(spinning(trolley1),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.09	
0.84/1.09	============================== end of process non-clausal formulas ===
0.84/1.09	
0.84/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.84/1.09	
0.84/1.09	============================== PREDICATE ELIMINATION =================
0.84/1.09	38 startedIn(A,B,C) | -happens(D,E) | -less(A,E) | -initiates(D,B,E) | -less(E,C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.84/1.09	39 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.84/1.09	40 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.84/1.09	41 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.84/1.09	42 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.84/1.09	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | happens(f1(C,E,D),f2(C,E,D)).  [resolve(38,a,39,a)].
0.84/1.09	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(C,f2(C,E,D)).  [resolve(38,a,40,a)].
0.84/1.09	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | initiates(f1(C,E,D),D,f2(C,E,D)).  [resolve(38,a,41,a)].
0.84/1.09	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(f2(C,E,D),E).  [resolve(38,a,42,a)].
0.84/1.09	43 -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)) # label(antitrajectory) # label(axiom).  [clausify(8)].
0.84/1.09	Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,plus(B,D),C),f2(B,plus(B,D),C)).  [resolve(43,e,39,a)].
0.84/1.09	Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,plus(B,D),C)).  [resolve(43,e,40,a)].
0.84/1.48	Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | initiates(f1(B,plus(B,D),C),C,f2(B,plus(B,D),C)).  [resolve(43,e,41,a)].
0.84/1.48	Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,plus(B,D),C),plus(B,D)).  [resolve(43,e,42,a)].
0.84/1.48	44 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom).  [clausify(9)].
0.84/1.48	45 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(2)].
0.84/1.48	46 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(20)].
0.84/1.48	47 stoppedIn(A,B,C) | -happens(D,E) | -less(E,C) | -terminates(D,B,E) | -less(A,E) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.84/1.48	48 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.84/1.48	49 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.84/1.48	50 -stoppedIn(A,B,C) | terminates(f4(A,B,C),B,f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.84/1.48	51 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.84/1.48	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | happens(f4(E,D,C),f5(E,D,C)).  [resolve(47,a,48,a)].
0.84/1.48	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(f5(E,D,C),C).  [resolve(47,a,49,a)].
0.84/1.48	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | terminates(f4(E,D,C),D,f5(E,D,C)).  [resolve(47,a,50,a)].
0.84/1.48	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(E,f5(E,D,C)).  [resolve(47,a,51,a)].
0.84/1.48	52 -less(n0,A) | stoppedIn(B,C,plus(B,A)) | -trajectory(C,B,D,A) | -initiates(E,C,B) | -happens(E,B) | holdsAt(D,plus(B,A)) # label(change_holding) # label(axiom).  [clausify(4)].
0.84/1.48	Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | happens(f4(C,B,plus(C,A)),f5(C,B,plus(C,A))).  [resolve(52,b,48,a)].
0.84/1.48	Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(f5(C,B,plus(C,A)),plus(C,A)).  [resolve(52,b,49,a)].
0.84/1.48	Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | terminates(f4(C,B,plus(C,A)),B,f5(C,B,plus(C,A))).  [resolve(52,b,50,a)].
0.84/1.48	Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(C,f5(C,B,plus(C,A))).  [resolve(52,b,51,a)].
0.84/1.48	
0.84/1.48	============================== end predicate elimination =============
0.84/1.48	
0.84/1.48	Auto_denials:  (non-Horn, no changes).
0.84/1.48	
0.84/1.48	Term ordering decisions:
0.84/1.48	Function symbol KB weights:  n0=1. n1=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. backwards=1. spinning=1. forwards=1. f1=1. f2=1. f4=1. f5=1. f9=1. f10=1. f11=1. f12=1.
0.84/1.48	
0.84/1.48	============================== end of process initial clauses ========
0.84/1.48	
0.84/1.48	============================== CLAUSES FOR SEARCH ====================
0.84/1.48	
0.84/1.48	============================== end of clauses for search =============
0.84/1.48	
0.84/1.48	============================== SEARCH ================================
0.84/1.48	
0.84/1.48	% Starting search at 0.03 seconds.
0.84/1.48	
0.84/1.48	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 46 (0.00 of 0.06 sec).
0.84/1.48	
0.84/1.48	Low Water (keep): wt=33.000, iters=3352
0.84/1.48	
0.84/1.48	============================== PROOF =================================
0.84/1.48	% SZS status Theorem
0.84/1.48	% SZS output start Refutation
0.84/1.48	
0.84/1.48	% Proof 1 at 0.39 (+ 0.01) seconds.
0.84/1.48	% Length of proof is 119.
0.84/1.48	% Level of proof is 17.
0.84/1.48	% Maximum clause weight is 40.000.
0.84/1.48	% Given clauses 928.
0.84/1.48	
0.84/1.48	6 (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.84/1.48	16 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (push(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) | -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & Fluent = spinning(Trolley))))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.48	29 (all Event all Time (happens(Event,Time) <-> n0 = Time & Event = push(agent1,trolley1) | pull(agent2,trolley2) = Event & Time = n0 | pull(agent3,trolley3) = Event & n0 = Time | pull(agent4,trolley4) = Event & n0 = Time | push(agent4,trolley4) = Event & Time = n0 | pull(agent5,trolley5) = Event & n0 = Time | Event = push(agent5,trolley5) & n0 = Time | Time = n0 & Event = pull(agent6,trolley6) | Event = pull(agent7,trolley7) & n0 = Time | push(agent8,trolley8) = Event & n0 = Time | n0 = Time & push(agent10,trolley10) = Event | pull(agent10,trolley10) = Event & n0 = Time | Event = push(agent9,trolley9) & n0 = Time | Event = pull(agent9,trolley9) & Time = n0 | Time = n0 & Event = pull(agent8,trolley8) | n0 = Time & push(agent7,trolley7) = Event | push(agent6,trolley6) = Event & Time = n0 | n0 = Time & push(agent3,trolley3) = Event | n0 = Time & Event = push(agent2,trolley2) | n0 = Time & Event = pull(agent1,trolley1))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.48	37 -(holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley10),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley3),n1) & holdsAt(spinning(trolley1),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.48	56 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(6)].
0.84/1.48	94 initiates(A,B,C) | pull(D,E) != A | -happens(push(D,E),C) | spinning(E) != B # label(initiates_all_defn) # label(axiom).  [clausify(16)].
0.84/1.48	111 plus(n0,n1) = n1 # label(plus0_1) # label(axiom).  [assumption].
0.84/1.48	121 happens(A,B) | n0 != B | push(agent1,trolley1) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	122 happens(A,B) | pull(agent2,trolley2) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	123 happens(A,B) | pull(agent3,trolley3) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	124 happens(A,B) | pull(agent4,trolley4) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	125 happens(A,B) | push(agent4,trolley4) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	126 happens(A,B) | pull(agent5,trolley5) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	127 happens(A,B) | push(agent5,trolley5) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	128 happens(A,B) | n0 != B | pull(agent6,trolley6) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	129 happens(A,B) | pull(agent7,trolley7) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	130 happens(A,B) | push(agent8,trolley8) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	131 happens(A,B) | n0 != B | push(agent10,trolley10) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	132 happens(A,B) | pull(agent10,trolley10) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	133 happens(A,B) | push(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	134 happens(A,B) | pull(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	135 happens(A,B) | n0 != B | pull(agent8,trolley8) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	136 happens(A,B) | n0 != B | push(agent7,trolley7) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	137 happens(A,B) | push(agent6,trolley6) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	138 happens(A,B) | n0 != B | push(agent3,trolley3) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	139 happens(A,B) | n0 != B | push(agent2,trolley2) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	140 happens(A,B) | n0 != B | pull(agent1,trolley1) != A # label(happens_all_defn) # label(axiom).  [clausify(29)].
0.84/1.48	142 n0 = plus(n0,n0) # label(plus0_0) # label(axiom).  [assumption].
0.84/1.48	143 plus(n0,n0) = n0.  [copy(142),flip(a)].
0.84/1.48	325 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley1),n1) # label(spinning_3) # label(negated_conjecture).  [clausify(37)].
0.84/1.48	364 happens(A,n0) | push(agent1,trolley1) != A.  [xx_res(121,b)].
0.84/1.48	366 happens(pull(agent2,trolley2),A) | n0 != A.  [xx_res(122,b)].
0.84/1.48	368 happens(pull(agent3,trolley3),A) | n0 != A.  [xx_res(123,b)].
0.84/1.48	370 happens(pull(agent4,trolley4),A) | n0 != A.  [xx_res(124,b)].
0.84/1.48	372 happens(push(agent4,trolley4),A) | n0 != A.  [xx_res(125,b)].
0.84/1.48	374 happens(pull(agent5,trolley5),A) | n0 != A.  [xx_res(126,b)].
0.84/1.48	376 happens(push(agent5,trolley5),A) | n0 != A.  [xx_res(127,b)].
0.84/1.48	378 happens(A,n0) | pull(agent6,trolley6) != A.  [xx_res(128,b)].
0.84/1.48	380 happens(pull(agent7,trolley7),A) | n0 != A.  [xx_res(129,b)].
0.84/1.48	382 happens(push(agent8,trolley8),A) | n0 != A.  [xx_res(130,b)].
0.84/1.48	384 happens(A,n0) | push(agent10,trolley10) != A.  [xx_res(131,b)].
0.84/1.48	386 happens(pull(agent10,trolley10),A) | n0 != A.  [xx_res(132,b)].
0.84/1.48	388 happens(push(agent9,trolley9),A) | n0 != A.  [xx_res(133,b)].
0.84/1.48	390 happens(pull(agent9,trolley9),A) | n0 != A.  [xx_res(134,b)].
0.84/1.48	392 happens(A,n0) | pull(agent8,trolley8) != A.  [xx_res(135,b)].
0.84/1.48	394 happens(A,n0) | push(agent7,trolley7) != A.  [xx_res(136,b)].
0.84/1.48	396 happens(push(agent6,trolley6),A) | n0 != A.  [xx_res(137,b)].
0.84/1.48	398 happens(A,n0) | push(agent3,trolley3) != A.  [xx_res(138,b)].
0.84/1.48	400 happens(A,n0) | push(agent2,trolley2) != A.  [xx_res(139,b)].
0.84/1.48	402 happens(A,n0) | pull(agent1,trolley1) != A.  [xx_res(140,b)].
0.84/1.48	588 happens(push(agent1,trolley1),n0).  [xx_res(364,b)].
0.84/1.48	600 happens(pull(agent2,trolley2),n0).  [resolve(366,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	610 initiates(A,B,n0) | pull(agent1,trolley1) != A | spinning(trolley1) != B.  [resolve(588,a,94,c)].
0.84/1.48	613 happens(pull(agent3,trolley3),n0).  [resolve(368,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	614 happens(pull(agent4,trolley4),n0).  [resolve(370,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	615 happens(push(agent4,trolley4),n0).  [resolve(372,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	616 initiates(A,B,n0) | pull(agent4,trolley4) != A | spinning(trolley4) != B.  [resolve(615,a,94,c)].
0.84/1.48	619 happens(pull(agent5,trolley5),n0).  [resolve(374,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	620 happens(push(agent5,trolley5),n0).  [resolve(376,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	621 initiates(A,B,n0) | pull(agent5,trolley5) != A | spinning(trolley5) != B.  [resolve(620,a,94,c)].
0.84/1.48	624 happens(pull(agent6,trolley6),n0).  [xx_res(378,b)].
0.84/1.48	625 happens(pull(agent7,trolley7),n0).  [resolve(380,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	626 happens(push(agent8,trolley8),n0).  [resolve(382,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	627 initiates(A,B,n0) | pull(agent8,trolley8) != A | spinning(trolley8) != B.  [resolve(626,a,94,c)].
0.84/1.48	630 happens(push(agent10,trolley10),n0).  [xx_res(384,b)].
0.84/1.48	631 initiates(A,B,n0) | pull(agent10,trolley10) != A | spinning(trolley10) != B.  [resolve(630,a,94,c)].
0.84/1.48	634 happens(pull(agent10,trolley10),n0).  [resolve(386,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	635 happens(push(agent9,trolley9),n0).  [resolve(388,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	636 initiates(A,B,n0) | pull(agent9,trolley9) != A | spinning(trolley9) != B.  [resolve(635,a,94,c)].
0.84/1.48	639 happens(pull(agent9,trolley9),n0).  [resolve(390,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	640 happens(pull(agent8,trolley8),n0).  [xx_res(392,b)].
0.84/1.48	641 happens(push(agent7,trolley7),n0).  [xx_res(394,b)].
0.84/1.48	642 initiates(A,B,n0) | pull(agent7,trolley7) != A | spinning(trolley7) != B.  [resolve(641,a,94,c)].
0.84/1.48	645 happens(push(agent6,trolley6),n0).  [resolve(396,b,143,a(flip)),rewrite([143(6)])].
0.84/1.48	646 initiates(A,B,n0) | pull(agent6,trolley6) != A | spinning(trolley6) != B.  [resolve(645,a,94,c)].
0.84/1.48	649 happens(push(agent3,trolley3),n0).  [xx_res(398,b)].
0.84/1.48	650 initiates(A,B,n0) | pull(agent3,trolley3) != A | spinning(trolley3) != B.  [resolve(649,a,94,c)].
0.84/1.48	653 happens(push(agent2,trolley2),n0).  [xx_res(400,b)].
0.84/1.48	654 initiates(A,B,n0) | pull(agent2,trolley2) != A | spinning(trolley2) != B.  [resolve(653,a,94,c)].
0.84/1.48	657 happens(pull(agent1,trolley1),n0).  [xx_res(402,b)].
0.84/1.48	814 initiates(pull(agent1,trolley1),A,n0) | spinning(trolley1) != A.  [xx_res(610,b)].
0.84/1.48	868 initiates(pull(agent4,trolley4),A,n0) | spinning(trolley4) != A.  [xx_res(616,b)].
0.84/1.48	878 initiates(pull(agent5,trolley5),A,n0) | spinning(trolley5) != A.  [xx_res(621,b)].
0.84/1.48	888 initiates(pull(agent8,trolley8),A,n0) | spinning(trolley8) != A.  [xx_res(627,b)].
0.84/1.48	944 initiates(pull(agent10,trolley10),A,n0) | spinning(trolley10) != A.  [xx_res(631,b)].
0.84/1.48	954 initiates(pull(agent9,trolley9),A,n0) | spinning(trolley9) != A.  [xx_res(636,b)].
0.84/1.48	963 initiates(pull(agent7,trolley7),A,n0) | spinning(trolley7) != A.  [xx_res(642,b)].
0.84/1.48	1013 initiates(pull(agent6,trolley6),A,n0) | spinning(trolley6) != A.  [xx_res(646,b)].
0.84/1.48	1022 initiates(pull(agent3,trolley3),A,n0) | spinning(trolley3) != A.  [xx_res(650,b)].
0.84/1.48	1030 initiates(pull(agent2,trolley2),A,n0) | spinning(trolley2) != A.  [xx_res(654,b)].
0.84/1.48	1923 initiates(pull(agent1,trolley1),spinning(trolley1),n0).  [xx_res(814,b)].
0.84/1.48	1936 holdsAt(spinning(trolley1),n1).  [resolve(1923,a,56,a),rewrite([111(10)]),unit_del(a,657)].
0.84/1.48	1937 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(325),unit_del(j,1936)].
0.84/1.48	2237 initiates(pull(agent4,trolley4),spinning(trolley4),n0).  [xx_res(868,b)].
0.84/1.48	2250 holdsAt(spinning(trolley4),n1).  [resolve(2237,a,56,a),rewrite([111(10)]),unit_del(a,614)].
0.84/1.48	2251 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(1937),unit_del(b,2250)].
0.84/1.48	2299 initiates(pull(agent5,trolley5),spinning(trolley5),n0).  [xx_res(878,b)].
0.84/1.48	2312 holdsAt(spinning(trolley5),n1).  [resolve(2299,a,56,a),rewrite([111(10)]),unit_del(a,619)].
0.84/1.48	2313 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(2251),unit_del(b,2312)].
0.84/1.48	2360 initiates(pull(agent8,trolley8),spinning(trolley8),n0).  [xx_res(888,b)].
0.84/1.48	2373 holdsAt(spinning(trolley8),n1).  [resolve(2360,a,56,a),rewrite([111(10)]),unit_del(a,640)].
0.84/1.48	2374 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley10),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(2313),unit_del(e,2373)].
0.84/1.48	2938 initiates(pull(agent10,trolley10),spinning(trolley10),n0).  [xx_res(944,b)].
0.84/1.48	2951 holdsAt(spinning(trolley10),n1).  [resolve(2938,a,56,a),rewrite([111(10)]),unit_del(a,634)].
0.84/1.48	2952 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(2374),unit_del(d,2951)].
0.84/1.48	3517 initiates(pull(agent9,trolley9),spinning(trolley9),n0).  [xx_res(954,b)].
0.84/1.48	3530 holdsAt(spinning(trolley9),n1).  [resolve(3517,a,56,a),rewrite([111(10)]),unit_del(a,639)].
0.84/1.48	3531 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(2952),unit_del(c,3530)].
0.84/1.48	3583 initiates(pull(agent7,trolley7),spinning(trolley7),n0).  [xx_res(963,b)].
0.84/1.48	3596 holdsAt(spinning(trolley7),n1).  [resolve(3583,a,56,a),rewrite([111(10)]),unit_del(a,625)].
0.84/1.48	3597 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(3531),unit_del(c,3596)].
0.84/1.48	3651 initiates(pull(agent6,trolley6),spinning(trolley6),n0).  [xx_res(1013,b)].
0.84/1.48	3664 holdsAt(spinning(trolley6),n1).  [resolve(3651,a,56,a),rewrite([111(10)]),unit_del(a,624)].
0.84/1.48	3665 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley3),n1).  [back_unit_del(3597),unit_del(b,3664)].
0.84/1.48	3971 initiates(pull(agent3,trolley3),spinning(trolley3),n0).  [xx_res(1022,b)].
0.84/1.48	3984 holdsAt(spinning(trolley3),n1).  [resolve(3971,a,56,a),rewrite([111(10)]),unit_del(a,613)].
0.84/1.48	3985 -holdsAt(spinning(trolley2),n1).  [back_unit_del(3665),unit_del(b,3984)].
0.84/1.48	4777 initiates(pull(agent2,trolley2),spinning(trolley2),n0).  [xx_res(1030,b)].
0.84/1.48	4790 $F.  [resolve(4777,a,56,a),rewrite([111(10)]),unit_del(a,600),unit_del(b,3985)].
0.84/1.48	
0.84/1.48	% SZS output end Refutation
0.84/1.48	============================== end of proof ==========================
0.84/1.48	
0.84/1.48	============================== STATISTICS ============================
0.84/1.48	
0.84/1.48	Given=928. Generated=11673. Kept=4690. proofs=1.
0.84/1.48	Usable=919. Sos=3733. Demods=11. Limbo=12, Disabled=283. Hints=0.
0.84/1.48	Megabytes=9.15.
0.84/1.48	User_CPU=0.40, System_CPU=0.01, Wall_clock=1.
0.84/1.48	
0.84/1.48	============================== end of statistics =====================
0.84/1.48	
0.84/1.48	============================== end of search =========================
0.84/1.48	
0.84/1.48	THEOREM PROVED
0.84/1.48	% SZS status Theorem
0.84/1.48	
0.84/1.48	Exiting with 1 proof.
0.84/1.48	
0.84/1.48	Process 10382 exit (max_proofs) Tue Aug  9 03:55:31 2022
0.84/1.48	Prover9 interrupted
0.84/1.48	EOF