0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer   : n015.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1200
0.10/0.31	% DateTime   : Tue Jul 13 12:08:49 EDT 2021
0.10/0.31	% CPUTime    : 
0.80/1.13	============================== Prover9 ===============================
0.80/1.13	Prover9 (32) version 2009-11A, November 2009.
0.80/1.13	Process 29013 was started by sandbox2 on n015.cluster.edu,
0.80/1.13	Tue Jul 13 12:08:50 2021
0.80/1.13	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_28860_n015.cluster.edu".
0.80/1.13	============================== end of head ===========================
0.80/1.13	
0.80/1.13	============================== INPUT =================================
0.80/1.13	
0.80/1.13	% Reading from file /tmp/Prover9_28860_n015.cluster.edu
0.80/1.13	
0.80/1.13	set(prolog_style_variables).
0.80/1.13	set(auto2).
0.80/1.13	    % set(auto2) -> set(auto).
0.80/1.13	    % set(auto) -> set(auto_inference).
0.80/1.13	    % set(auto) -> set(auto_setup).
0.80/1.13	    % set(auto_setup) -> set(predicate_elim).
0.80/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.13	    % set(auto) -> set(auto_limits).
0.80/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.13	    % set(auto) -> set(auto_denials).
0.80/1.13	    % set(auto) -> set(auto_process).
0.80/1.13	    % set(auto2) -> assign(new_constants, 1).
0.80/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.13	    % set(auto2) -> assign(max_hours, 1).
0.80/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.13	    % set(auto2) -> set(sort_initial_sos).
0.80/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.13	    % set(auto2) -> assign(max_megs, 400).
0.80/1.13	    % set(auto2) -> assign(stats, some).
0.80/1.13	    % set(auto2) -> clear(echo_input).
0.80/1.13	    % set(auto2) -> set(quiet).
0.80/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.13	    % set(auto2) -> clear(print_given).
0.80/1.13	assign(lrs_ticks,-1).
0.80/1.13	assign(sos_limit,10000).
0.80/1.13	assign(order,kbo).
0.80/1.13	set(lex_order_vars).
0.80/1.13	clear(print_given).
0.80/1.13	
0.80/1.13	% formulas(sos).  % not echoed (155 formulas)
0.80/1.13	
0.80/1.13	============================== end of input ==========================
0.80/1.13	
0.80/1.13	% From the command line: assign(max_seconds, 1200).
0.80/1.13	
0.80/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.13	
0.80/1.13	% Formulas that are not ordinary clauses:
0.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	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.80/1.13	13 (all Event all Fluent all Time ((exists Agent exists Trolley (-happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & spinning(Trolley) = Fluent & happens(push(Agent,Trolley),Time) | push(Agent,Trolley) = Event & -happens(pull(Agent,Trolley),Time) & Fluent = forwards(Trolley))) <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	14 (all Trolley forwards(Trolley) != spinning(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	15 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	16 (all Trolley spinning(Trolley) != backwards(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	17 (all Trolley forwards(Trolley) != backwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	18 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Trolley1 != Trolley2 & Agent2 != Agent1 -> push(Agent2,Trolley2) != push(Agent1,Trolley1))) # label(push_unique) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	19 (all Agent all Trolley pull(Agent,Trolley) != push(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	20 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> (exists Agent exists Trolley (happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Fluent = spinning(Trolley) & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event | -happens(push(Agent,Trolley),Time) & spinning(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & Fluent = forwards(Trolley) & happens(push(Agent,Trolley),Time) | pull(Agent,Trolley) = Event & -happens(push(Agent,Trolley),Time) & Fluent = forwards(Trolley) | Event = push(Agent,Trolley) & -happens(pull(Agent,Trolley),Time) & Fluent = backwards(Trolley))))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	21 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent1 != Agent2 & Trolley1 != Trolley2 -> pull(Agent2,Trolley2) != pull(Agent1,Trolley1))) # label(pull_unique) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	22 (all Agent all Trolley push(Agent,Trolley) != pull(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	23 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause).  [assumption].
0.80/1.13	24 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	25 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	26 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	27 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | Y = X)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	28 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	29 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Trolley2 != Trolley1 & Agent2 != Agent1 -> pull(Agent1,Trolley1) != pull(Agent2,Trolley2))) # label(pull_unique) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	30 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	31 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (-happens(pull(Agent,Trolley),Time) & forwards(Trolley) = Fluent & Event = push(Agent,Trolley) | Fluent = backwards(Trolley) & -happens(push(Agent,Trolley),Time) & Event = pull(Agent,Trolley) | happens(push(Agent,Trolley),Time) & spinning(Trolley) = Fluent & Event = pull(Agent,Trolley))))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	32 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	33 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	34 (all X all Y (X != Y & -less(Y,X) <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	35 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	36 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	37 (all Trolley forwards(Trolley) != spinning(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	38 (all Event all Fluent all Time ((exists Agent exists Trolley (Fluent = backwards(Trolley) & happens(push(Agent,Trolley),Time) & pull(Agent,Trolley) = Event | push(Agent,Trolley) = Event & spinning(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) | Fluent = spinning(Trolley) & -happens(push(Agent,Trolley),Time) & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & forwards(Trolley) = Fluent | forwards(Trolley) = Fluent & -happens(push(Agent,Trolley),Time) & Event = pull(Agent,Trolley) | backwards(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) & Event = push(Agent,Trolley))) <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	39 (all Trolley backwards(Trolley) != forwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	40 (all Event all Time (happens(Event,Time) <-> push(agent2,trolley2) = Event & Time = n0 | Time = n0 & Event = pull(agent4,trolley4) | n0 = Time & push(agent6,trolley6) = Event | Event = pull(agent7,trolley7) & Time = n0 | n0 = Time & Event = push(agent7,trolley7) | n0 = Time & Event = push(agent8,trolley8) | push(agent9,trolley9) = Event & Time = n0 | Event = pull(agent9,trolley9) & n0 = Time | Time = n0 & pull(agent8,trolley8) = Event | pull(agent6,trolley6) = Event & n0 = Time | n0 = Time & push(agent5,trolley5) = Event | Time = n0 & Event = pull(agent5,trolley5) | Event = push(agent4,trolley4) & Time = n0 | push(agent3,trolley3) = Event & Time = n0 | Time = n0 & Event = pull(agent3,trolley3) | Event = pull(agent2,trolley2) & n0 = Time | n0 = Time & Event = push(agent1,trolley1) | pull(agent1,trolley1) = Event & n0 = Time)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	41 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent1 != Agent2 & Trolley1 != Trolley2 -> push(Agent1,Trolley1) != push(Agent2,Trolley2))) # label(push_unique) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	42 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	43 (all Trolley backwards(Trolley) != spinning(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause).  [assumption].
0.80/1.13	44 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.80/1.14	45 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.14	46 -(holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley3),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley1),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.80/1.14	
0.80/1.14	============================== end of process non-clausal formulas ===
0.80/1.14	
0.80/1.14	============================== PROCESS INITIAL CLAUSES ===============
0.80/1.14	
0.80/1.14	============================== PREDICATE ELIMINATION =================
0.80/1.14	47 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.80/1.14	48 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.80/1.14	49 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.80/1.14	50 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.80/1.14	51 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.80/1.14	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(A,f2(A,E,D)).  [resolve(47,a,48,a)].
0.80/1.14	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(47,a,49,a)].
0.80/1.14	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(f2(A,E,D),E).  [resolve(47,a,50,a)].
0.80/1.14	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | happens(f1(A,E,D),f2(A,E,D)).  [resolve(47,a,51,a)].
0.80/1.14	52 -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.80/1.14	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(52,b,48,a)].
0.80/1.14	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(52,b,49,a)].
0.80/1.14	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(52,b,50,a)].
0.80/1.14	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(52,b,51,a)].
0.80/1.14	53 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.80/1.14	54 -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.80/1.14	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(53,a,54,c)].
0.80/1.14	55 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.80/1.14	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(55,a,54,c)].
0.80/1.14	56 -stoppedIn(A,B,C) | terminates(f5(A,B,C),B,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.80/1.14	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(56,a,54,c)].
0.80/1.14	57 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.80/1.14	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(57,a,54,c)].
0.80/1.14	58 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.80/1.14	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)).  [resolve(58,a,53,a)].
0.84/1.58	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C).  [resolve(58,a,55,a)].
0.84/1.58	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(58,a,56,a)].
0.84/1.58	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | happens(f5(A,E,C),f6(A,E,C)).  [resolve(58,a,57,a)].
0.84/1.58	59 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(12)].
0.84/1.58	60 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(4)].
0.84/1.58	61 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(15)].
0.84/1.58	62 -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(33)].
0.84/1.58	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(62,a,60,a)].
0.84/1.58	
0.84/1.58	============================== end predicate elimination =============
0.84/1.58	
0.84/1.58	Auto_denials:  (non-Horn, no changes).
0.84/1.58	
0.84/1.58	Term ordering decisions:
0.84/1.58	Function symbol KB weights:  n0=1. n1=1. n2=1. n3=1. n4=1. n5=1. n6=1. agent1=1. agent2=1. agent3=1. agent4=1. agent5=1. agent6=1. agent7=1. agent8=1. agent9=1. n7=1. n8=1. trolley1=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. f4=1. f7=1. f8=1. backwards=1. spinning=1. forwards=1. f1=1. f2=1. f5=1. f6=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1.
0.84/1.58	
0.84/1.58	============================== end of process initial clauses ========
0.84/1.58	
0.84/1.58	============================== CLAUSES FOR SEARCH ====================
0.84/1.58	
0.84/1.58	============================== end of clauses for search =============
0.84/1.58	
0.84/1.58	============================== SEARCH ================================
0.84/1.58	
0.84/1.58	% Starting search at 0.04 seconds.
0.84/1.58	
0.84/1.58	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 59 (0.00 of 0.09 sec).
0.84/1.58	
0.84/1.58	============================== PROOF =================================
0.84/1.58	% SZS status Theorem
0.84/1.58	% SZS output start Refutation
0.84/1.58	
0.84/1.58	% Proof 1 at 0.44 (+ 0.03) seconds.
0.84/1.58	% Length of proof is 108.
0.84/1.58	% Level of proof is 16.
0.84/1.58	% Maximum clause weight is 36.000.
0.84/1.58	% Given clauses 910.
0.84/1.58	
0.84/1.58	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.84/1.58	13 (all Event all Fluent all Time ((exists Agent exists Trolley (-happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & spinning(Trolley) = Fluent & happens(push(Agent,Trolley),Time) | push(Agent,Trolley) = Event & -happens(pull(Agent,Trolley),Time) & Fluent = forwards(Trolley))) <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.58	40 (all Event all Time (happens(Event,Time) <-> push(agent2,trolley2) = Event & Time = n0 | Time = n0 & Event = pull(agent4,trolley4) | n0 = Time & push(agent6,trolley6) = Event | Event = pull(agent7,trolley7) & Time = n0 | n0 = Time & Event = push(agent7,trolley7) | n0 = Time & Event = push(agent8,trolley8) | push(agent9,trolley9) = Event & Time = n0 | Event = pull(agent9,trolley9) & n0 = Time | Time = n0 & pull(agent8,trolley8) = Event | pull(agent6,trolley6) = Event & n0 = Time | n0 = Time & push(agent5,trolley5) = Event | Time = n0 & Event = pull(agent5,trolley5) | Event = push(agent4,trolley4) & Time = n0 | push(agent3,trolley3) = Event & Time = n0 | Time = n0 & Event = pull(agent3,trolley3) | Event = pull(agent2,trolley2) & n0 = Time | n0 = Time & Event = push(agent1,trolley1) | pull(agent1,trolley1) = Event & n0 = Time)) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.58	46 -(holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley3),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley1),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.58	69 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(7)].
0.84/1.58	75 pull(A,B) != C | spinning(B) != D | -happens(push(A,B),E) | initiates(C,D,E) # label(initiates_all_defn) # label(axiom).  [clausify(13)].
0.84/1.58	135 n1 = plus(n0,n1) # label(plus0_1) # label(axiom).  [assumption].
0.84/1.58	136 plus(n0,n1) = n1.  [copy(135),flip(a)].
0.84/1.58	139 plus(n0,n0) = n0 # label(plus0_0) # label(axiom).  [assumption].
0.84/1.58	188 happens(A,B) | push(agent2,trolley2) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	189 happens(A,B) | n0 != B | pull(agent4,trolley4) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	190 happens(A,B) | n0 != B | push(agent6,trolley6) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	191 happens(A,B) | pull(agent7,trolley7) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	192 happens(A,B) | n0 != B | push(agent7,trolley7) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	193 happens(A,B) | n0 != B | push(agent8,trolley8) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	194 happens(A,B) | push(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	195 happens(A,B) | pull(agent9,trolley9) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	196 happens(A,B) | n0 != B | pull(agent8,trolley8) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	197 happens(A,B) | pull(agent6,trolley6) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	198 happens(A,B) | n0 != B | push(agent5,trolley5) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	199 happens(A,B) | n0 != B | pull(agent5,trolley5) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	200 happens(A,B) | push(agent4,trolley4) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	201 happens(A,B) | push(agent3,trolley3) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	202 happens(A,B) | n0 != B | pull(agent3,trolley3) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	203 happens(A,B) | pull(agent2,trolley2) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	204 happens(A,B) | n0 != B | push(agent1,trolley1) != A # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	205 happens(A,B) | pull(agent1,trolley1) != A | n0 != B # label(happens_all_defn) # label(axiom).  [clausify(40)].
0.84/1.58	328 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley1),n1) # label(spinning_3) # label(negated_conjecture).  [clausify(46)].
0.84/1.58	369 happens(push(agent2,trolley2),A) | n0 != A.  [xx_res(188,b)].
0.84/1.58	371 happens(A,n0) | pull(agent4,trolley4) != A.  [resolve(189,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	373 happens(A,n0) | push(agent6,trolley6) != A.  [resolve(190,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	375 happens(pull(agent7,trolley7),A) | n0 != A.  [xx_res(191,b)].
0.84/1.58	377 happens(A,n0) | push(agent7,trolley7) != A.  [resolve(192,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	379 happens(A,n0) | push(agent8,trolley8) != A.  [resolve(193,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	381 happens(push(agent9,trolley9),A) | n0 != A.  [xx_res(194,b)].
0.84/1.58	383 happens(pull(agent9,trolley9),A) | n0 != A.  [xx_res(195,b)].
0.84/1.58	385 happens(A,n0) | pull(agent8,trolley8) != A.  [resolve(196,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	387 happens(pull(agent6,trolley6),A) | n0 != A.  [xx_res(197,b)].
0.84/1.58	389 happens(A,n0) | push(agent5,trolley5) != A.  [resolve(198,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	391 happens(A,n0) | pull(agent5,trolley5) != A.  [resolve(199,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	393 happens(push(agent4,trolley4),A) | n0 != A.  [xx_res(200,b)].
0.84/1.58	395 happens(push(agent3,trolley3),A) | n0 != A.  [xx_res(201,b)].
0.84/1.58	397 happens(A,n0) | pull(agent3,trolley3) != A.  [resolve(202,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	399 happens(pull(agent2,trolley2),A) | n0 != A.  [xx_res(203,b)].
0.84/1.58	401 happens(A,n0) | push(agent1,trolley1) != A.  [resolve(204,b,139,a(flip)),rewrite([139(3)])].
0.84/1.58	403 happens(pull(agent1,trolley1),A) | n0 != A.  [xx_res(205,b)].
0.84/1.58	605 happens(push(agent2,trolley2),n0).  [resolve(369,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	610 pull(agent2,trolley2) != A | spinning(trolley2) != B | initiates(A,B,n0).  [resolve(605,a,75,c)].
0.84/1.58	611 happens(pull(agent4,trolley4),n0).  [xx_res(371,b)].
0.84/1.58	612 happens(push(agent6,trolley6),n0).  [xx_res(373,b)].
0.84/1.58	615 pull(agent6,trolley6) != A | spinning(trolley6) != B | initiates(A,B,n0).  [resolve(612,a,75,c)].
0.84/1.58	616 happens(pull(agent7,trolley7),n0).  [resolve(375,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	617 happens(push(agent7,trolley7),n0).  [xx_res(377,b)].
0.84/1.58	620 pull(agent7,trolley7) != A | spinning(trolley7) != B | initiates(A,B,n0).  [resolve(617,a,75,c)].
0.84/1.58	621 happens(push(agent8,trolley8),n0).  [xx_res(379,b)].
0.84/1.58	624 pull(agent8,trolley8) != A | spinning(trolley8) != B | initiates(A,B,n0).  [resolve(621,a,75,c)].
0.84/1.58	625 happens(push(agent9,trolley9),n0).  [resolve(381,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	628 pull(agent9,trolley9) != A | spinning(trolley9) != B | initiates(A,B,n0).  [resolve(625,a,75,c)].
0.84/1.58	629 happens(pull(agent9,trolley9),n0).  [resolve(383,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	630 happens(pull(agent8,trolley8),n0).  [xx_res(385,b)].
0.84/1.58	631 happens(pull(agent6,trolley6),n0).  [resolve(387,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	632 happens(push(agent5,trolley5),n0).  [xx_res(389,b)].
0.84/1.58	635 pull(agent5,trolley5) != A | spinning(trolley5) != B | initiates(A,B,n0).  [resolve(632,a,75,c)].
0.84/1.58	636 happens(pull(agent5,trolley5),n0).  [xx_res(391,b)].
0.84/1.58	637 happens(push(agent4,trolley4),n0).  [resolve(393,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	640 pull(agent4,trolley4) != A | spinning(trolley4) != B | initiates(A,B,n0).  [resolve(637,a,75,c)].
0.84/1.58	641 happens(push(agent3,trolley3),n0).  [resolve(395,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	644 pull(agent3,trolley3) != A | spinning(trolley3) != B | initiates(A,B,n0).  [resolve(641,a,75,c)].
0.84/1.58	645 happens(pull(agent3,trolley3),n0).  [xx_res(397,b)].
0.84/1.58	646 happens(pull(agent2,trolley2),n0).  [resolve(399,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	647 happens(push(agent1,trolley1),n0).  [xx_res(401,b)].
0.84/1.58	650 pull(agent1,trolley1) != A | spinning(trolley1) != B | initiates(A,B,n0).  [resolve(647,a,75,c)].
0.84/1.58	651 happens(pull(agent1,trolley1),n0).  [resolve(403,b,139,a(flip)),rewrite([139(6)])].
0.84/1.58	930 spinning(trolley2) != A | initiates(pull(agent2,trolley2),A,n0).  [xx_res(610,a)].
0.84/1.58	940 spinning(trolley6) != A | initiates(pull(agent6,trolley6),A,n0).  [xx_res(615,a)].
0.84/1.58	972 spinning(trolley7) != A | initiates(pull(agent7,trolley7),A,n0).  [xx_res(620,a)].
0.84/1.58	1005 spinning(trolley8) != A | initiates(pull(agent8,trolley8),A,n0).  [xx_res(624,a)].
0.84/1.58	1014 spinning(trolley9) != A | initiates(pull(agent9,trolley9),A,n0).  [xx_res(628,a)].
0.84/1.58	1048 spinning(trolley5) != A | initiates(pull(agent5,trolley5),A,n0).  [xx_res(635,a)].
0.84/1.58	1073 spinning(trolley4) != A | initiates(pull(agent4,trolley4),A,n0).  [xx_res(640,a)].
0.84/1.58	1081 spinning(trolley3) != A | initiates(pull(agent3,trolley3),A,n0).  [xx_res(644,a)].
0.84/1.58	1121 spinning(trolley1) != A | initiates(pull(agent1,trolley1),A,n0).  [xx_res(650,a)].
0.84/1.58	2278 initiates(pull(agent2,trolley2),spinning(trolley2),n0).  [xx_res(930,a)].
0.84/1.58	2303 holdsAt(spinning(trolley2),n1).  [resolve(2278,a,69,a),rewrite([136(10)]),unit_del(a,646)].
0.84/1.58	2304 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(328),unit_del(a,2303)].
0.84/1.58	2386 initiates(pull(agent6,trolley6),spinning(trolley6),n0).  [xx_res(940,a)].
0.84/1.58	2411 holdsAt(spinning(trolley6),n1).  [resolve(2386,a,69,a),rewrite([136(10)]),unit_del(a,631)].
0.84/1.58	2412 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2304),unit_del(d,2411)].
0.84/1.58	2482 initiates(pull(agent7,trolley7),spinning(trolley7),n0).  [xx_res(972,a)].
0.84/1.58	2507 holdsAt(spinning(trolley7),n1).  [resolve(2482,a,69,a),rewrite([136(10)]),unit_del(a,616)].
0.84/1.58	2508 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2412),unit_del(d,2507)].
0.84/1.58	2581 initiates(pull(agent8,trolley8),spinning(trolley8),n0).  [xx_res(1005,a)].
0.84/1.58	2606 holdsAt(spinning(trolley8),n1).  [resolve(2581,a,69,a),rewrite([136(10)]),unit_del(a,630)].
0.84/1.58	2607 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2508),unit_del(e,2606)].
0.84/1.58	2684 initiates(pull(agent9,trolley9),spinning(trolley9),n0).  [xx_res(1014,a)].
0.84/1.58	2709 holdsAt(spinning(trolley9),n1).  [resolve(2684,a,69,a),rewrite([136(10)]),unit_del(a,629)].
0.84/1.58	2710 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2607),unit_del(d,2709)].
0.84/1.58	2787 initiates(pull(agent5,trolley5),spinning(trolley5),n0).  [xx_res(1048,a)].
0.84/1.58	2812 holdsAt(spinning(trolley5),n1).  [resolve(2787,a,69,a),rewrite([136(10)]),unit_del(a,636)].
0.84/1.58	2813 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2710),unit_del(c,2812)].
0.84/1.58	2894 initiates(pull(agent4,trolley4),spinning(trolley4),n0).  [xx_res(1073,a)].
0.84/1.58	2919 holdsAt(spinning(trolley4),n1).  [resolve(2894,a,69,a),rewrite([136(10)]),unit_del(a,611)].
0.84/1.58	2920 -holdsAt(spinning(trolley3),n1) | -holdsAt(spinning(trolley1),n1).  [back_unit_del(2813),unit_del(b,2919)].
0.84/1.58	2994 initiates(pull(agent3,trolley3),spinning(trolley3),n0).  [xx_res(1081,a)].
0.84/1.58	3019 holdsAt(spinning(trolley3),n1).  [resolve(2994,a,69,a),rewrite([136(10)]),unit_del(a,645)].
0.84/1.58	3020 -holdsAt(spinning(trolley1),n1).  [back_unit_del(2920),unit_del(a,3019)].
0.84/1.58	3872 initiates(pull(agent1,trolley1),spinning(trolley1),n0).  [xx_res(1121,a)].
0.84/1.58	3897 $F.  [resolve(3872,a,69,a),rewrite([136(10)]),unit_del(a,651),unit_del(b,3020)].
0.84/1.58	
0.84/1.58	% SZS output end Refutation
0.84/1.58	============================== end of proof ==========================
0.84/1.58	
0.84/1.58	============================== STATISTICS ============================
0.84/1.58	
0.84/1.58	Given=910. Generated=10343. Kept=3790. proofs=1.
0.84/1.58	Usable=902. Sos=2842. Demods=11. Limbo=24, Disabled=293. Hints=0.
0.84/1.58	Megabytes=8.53.
0.84/1.58	User_CPU=0.44, System_CPU=0.03, Wall_clock=1.
0.84/1.58	
0.84/1.58	============================== end of statistics =====================
0.84/1.58	
0.84/1.58	============================== end of search =========================
0.84/1.58	
0.84/1.58	THEOREM PROVED
0.84/1.58	% SZS status Theorem
0.84/1.58	
0.84/1.58	Exiting with 1 proof.
0.84/1.58	
0.84/1.58	Process 29013 exit (max_proofs) Tue Jul 13 12:08:51 2021
0.84/1.58	Prover9 interrupted
1.31/1.58	EOF