0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n032.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % DateTime : Thu Jul 2 10:22:04 EDT 2020 0.09/0.30 % CPUTime : 0.71/1.06 ============================== Prover9 =============================== 0.71/1.06 Prover9 (32) version 2009-11A, November 2009. 0.71/1.06 Process 14480 was started by sandbox2 on n032.cluster.edu, 0.71/1.06 Thu Jul 2 10:22:05 2020 0.71/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_14326_n032.cluster.edu". 0.71/1.06 ============================== end of head =========================== 0.71/1.06 0.71/1.06 ============================== INPUT ================================= 0.71/1.06 0.71/1.06 % Reading from file /tmp/Prover9_14326_n032.cluster.edu 0.71/1.06 0.71/1.06 set(prolog_style_variables). 0.71/1.06 set(auto2). 0.71/1.06 % set(auto2) -> set(auto). 0.71/1.06 % set(auto) -> set(auto_inference). 0.71/1.06 % set(auto) -> set(auto_setup). 0.71/1.06 % set(auto_setup) -> set(predicate_elim). 0.71/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.71/1.06 % set(auto) -> set(auto_limits). 0.71/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.71/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.71/1.06 % set(auto) -> set(auto_denials). 0.71/1.06 % set(auto) -> set(auto_process). 0.71/1.06 % set(auto2) -> assign(new_constants, 1). 0.71/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.71/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.71/1.06 % set(auto2) -> assign(max_hours, 1). 0.71/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.71/1.06 % set(auto2) -> assign(max_seconds, 0). 0.71/1.06 % set(auto2) -> assign(max_minutes, 5). 0.71/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.71/1.06 % set(auto2) -> set(sort_initial_sos). 0.71/1.06 % set(auto2) -> assign(sos_limit, -1). 0.71/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.71/1.06 % set(auto2) -> assign(max_megs, 400). 0.71/1.06 % set(auto2) -> assign(stats, some). 0.71/1.06 % set(auto2) -> clear(echo_input). 0.71/1.06 % set(auto2) -> set(quiet). 0.71/1.06 % set(auto2) -> clear(print_initial_clauses). 0.71/1.06 % set(auto2) -> clear(print_given). 0.71/1.06 assign(lrs_ticks,-1). 0.71/1.06 assign(sos_limit,10000). 0.71/1.06 assign(order,kbo). 0.71/1.06 set(lex_order_vars). 0.71/1.06 clear(print_given). 0.71/1.06 0.71/1.06 % formulas(sos). % not echoed (48 formulas) 0.71/1.06 0.71/1.06 ============================== end of input ========================== 0.71/1.06 0.71/1.06 % From the command line: assign(max_seconds, 960). 0.71/1.06 0.71/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.71/1.06 0.71/1.06 % Formulas that are not ordinary clauses: 0.71/1.06 1 (all Time1 all Time2 all Fluent ((exists Event exists Time (less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))) <-> startedIn(Time1,Fluent,Time2))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.06 2 (all Fluent all Time (-holdsAt(Fluent,Time) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption]. 0.71/1.06 3 (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.71/1.06 4 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & terminates(Event,Fluent1,Time1) & less(n0,Time2) & happens(Event,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption]. 0.71/1.06 5 (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.71/1.06 6 (all Event all Time all Fluent ((terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause). [assumption]. 0.71/1.06 7 (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.71/1.06 8 (all Time1 all Fluent all Time2 ((exists Event exists Time (less(Time1,Time) & terminates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))) <-> stoppedIn(Time1,Fluent,Time2))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 9 (all Fluent all Time (-(exists Event (releases(Event,Fluent,Time) & happens(Event,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 10 (all Event all Time all Fluent all Fluent2 all Offset (initiates(Event,Fluent,Time) & trajectory(Fluent,Time,Fluent2,Offset) & less(n0,Offset) & happens(Event,Time) & -stoppedIn(Time,Fluent,plus(Time,Offset)) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 11 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 12 (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.71/1.07 13 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> Fluent = backwards & -happens(pull,Time) & push = Event | -happens(push,Time) & forwards = Fluent & pull = Event | happens(push,Time) & Event = pull & forwards = Fluent | pull = Event & happens(push,Time) & Fluent = backwards | -happens(pull,Time) & Fluent = spinning & Event = push | Fluent = spinning & -happens(push,Time) & Event = pull)) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 14 (all Event all Fluent all Time (Event = pull & spinning = Fluent & happens(push,Time) | Fluent = forwards & push = Event & -happens(pull,Time) | Fluent = backwards & Event = pull & -happens(push,Time) <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 15 (all Event all Time (Time = n0 & Event = push | Time = n2 & push = Event | pull = Event & Time = n2 | n1 = Time & pull = Event <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 16 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 17 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 18 (all X all Y (less(X,Y) <-> Y != X & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 19 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 20 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption]. 0.71/1.07 21 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 22 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 23 (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.71/1.07 24 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 25 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 26 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 27 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 28 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 29 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 30 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.71/1.07 31 --holdsAt(backwards,n1) # label(not_backwards_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.71/1.07 0.71/1.07 ============================== end of process non-clausal formulas === 0.78/1.07 0.78/1.07 ============================== PROCESS INITIAL CLAUSES =============== 0.78/1.07 0.78/1.07 ============================== PREDICATE ELIMINATION ================= 0.78/1.07 32 initiates(f1(A,B,C),C,f2(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.78/1.07 33 -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | startedIn(A,D,E) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.78/1.07 Derived: -startedIn(A,B,C) | -less(D,f2(A,C,B)) | -less(f2(A,C,B),E) | -happens(f1(A,C,B),f2(A,C,B)) | startedIn(D,B,E). [resolve(32,a,33,b)]. 0.78/1.07 34 holdsAt(A,B) | initiates(f3(A,B),A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom). [clausify(2)]. 0.78/1.07 Derived: holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f3(A,B),B) | startedIn(C,A,D). [resolve(34,b,33,b)]. 0.78/1.07 35 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(3)]. 0.78/1.07 Derived: -happens(f1(A,B,C),f2(A,B,C)) | holdsAt(C,plus(f2(A,B,C),n1)) | -startedIn(A,C,B). [resolve(35,a,32,a)]. 0.78/1.07 36 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(6)]. 0.78/1.07 37 -initiates(A,B,C) | -trajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | stoppedIn(C,B,plus(C,E)) | holdsAt(D,plus(C,E)) # label(change_holding) # label(axiom). [clausify(10)]. 0.78/1.07 Derived: -trajectory(A,f2(B,C,A),D,E) | -less(n0,E) | -happens(f1(B,C,A),f2(B,C,A)) | stoppedIn(f2(B,C,A),A,plus(f2(B,C,A),E)) | holdsAt(D,plus(f2(B,C,A),E)) | -startedIn(B,A,C). [resolve(37,a,32,a)]. 0.78/1.07 Derived: -trajectory(A,B,C,D) | -less(n0,D) | -happens(f3(A,B),B) | stoppedIn(B,A,plus(B,D)) | holdsAt(C,plus(B,D)) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(37,a,34,b)]. 0.78/1.07 38 -releasedAt(A,B) | terminates(f7(A,B),A,B) | initiates(f7(A,B),A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom). [clausify(11)]. 0.78/1.07 39 pull != A | spinning != B | -happens(push,C) | initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: pull != A | spinning != B | -happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | startedIn(D,B,E). [resolve(39,d,33,b)]. 0.78/1.07 Derived: pull != A | spinning != B | -happens(push,C) | -happens(A,C) | holdsAt(B,plus(C,n1)). [resolve(39,d,35,a)]. 0.78/1.07 Derived: pull != A | spinning != B | -happens(push,C) | -trajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | stoppedIn(C,B,plus(C,E)) | holdsAt(D,plus(C,E)). [resolve(39,d,37,a)]. 0.78/1.07 40 forwards != A | push != B | happens(pull,C) | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: forwards != A | push != B | happens(pull,C) | -less(D,C) | -less(C,E) | -happens(B,C) | startedIn(D,A,E). [resolve(40,d,33,b)]. 0.78/1.07 Derived: forwards != A | push != B | happens(pull,C) | -happens(B,C) | holdsAt(A,plus(C,n1)). [resolve(40,d,35,a)]. 0.78/1.07 Derived: forwards != A | push != B | happens(pull,C) | -trajectory(A,C,D,E) | -less(n0,E) | -happens(B,C) | stoppedIn(C,A,plus(C,E)) | holdsAt(D,plus(C,E)). [resolve(40,d,37,a)]. 0.78/1.07 41 backwards != A | pull != B | happens(push,C) | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: backwards != A | pull != B | happens(push,C) | -less(D,C) | -less(C,E) | -happens(B,C) | startedIn(D,A,E). [resolve(41,d,33,b)]. 0.78/1.07 Derived: backwards != A | pull != B | happens(push,C) | -happens(B,C) | holdsAt(A,plus(C,n1)). [resolve(41,d,35,a)]. 0.78/1.07 Derived: backwards != A | pull != B | happens(push,C) | -trajectory(A,C,D,E) | -less(n0,E) | -happens(B,C) | stoppedIn(C,A,plus(C,E)) | holdsAt(D,plus(C,E)). [resolve(41,d,37,a)]. 0.78/1.07 42 pull = A | forwards = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: pull = f1(A,B,C) | forwards = C | -startedIn(A,C,B). [resolve(42,c,32,a)]. 0.78/1.07 Derived: pull = f3(A,B) | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(42,c,34,b)]. 0.78/1.07 43 pull = A | push = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: pull = f1(A,B,C) | push = f1(A,B,C) | -startedIn(A,C,B). [resolve(43,c,32,a)]. 0.78/1.07 Derived: pull = f3(A,B) | push = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(43,c,34,b)]. 0.78/1.07 44 pull = A | -happens(pull,B) | -initiates(A,C,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: pull = f1(A,B,C) | -happens(pull,f2(A,B,C)) | -startedIn(A,C,B). [resolve(44,c,32,a)]. 0.78/1.07 Derived: pull = f3(A,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(44,c,34,b)]. 0.78/1.07 45 spinning = A | forwards = A | backwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | forwards = A | backwards = A | -startedIn(B,A,C). [resolve(45,d,32,a)]. 0.78/1.07 Derived: spinning = A | forwards = A | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(45,d,34,b)]. 0.78/1.07 46 spinning = A | forwards = A | -happens(push,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | forwards = A | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(46,d,32,a)]. 0.78/1.07 Derived: spinning = A | forwards = A | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(46,d,34,b)]. 0.78/1.07 47 spinning = A | push = B | backwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | push = f1(B,C,A) | backwards = A | -startedIn(B,A,C). [resolve(47,d,32,a)]. 0.78/1.07 Derived: spinning = A | push = f3(A,B) | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(47,d,34,b)]. 0.78/1.07 48 spinning = A | push = B | -happens(push,C) | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | push = f1(B,C,A) | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(48,d,32,a)]. 0.78/1.07 Derived: spinning = A | push = f3(A,B) | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(48,d,34,b)]. 0.78/1.07 49 spinning = A | -happens(pull,B) | backwards = A | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | -happens(pull,f2(B,C,A)) | backwards = A | -startedIn(B,A,C). [resolve(49,d,32,a)]. 0.78/1.07 Derived: spinning = A | -happens(pull,B) | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(49,d,34,b)]. 0.78/1.07 50 spinning = A | -happens(pull,B) | -happens(push,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: spinning = A | -happens(pull,f2(B,C,A)) | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(50,d,32,a)]. 0.78/1.07 Derived: spinning = A | -happens(pull,B) | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(50,d,34,b)]. 0.78/1.07 51 happens(push,A) | forwards = B | backwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: happens(push,f2(A,B,C)) | forwards = C | backwards = C | -startedIn(A,C,B). [resolve(51,d,32,a)]. 0.78/1.07 Derived: happens(push,A) | forwards = B | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(51,d,34,b)]. 0.78/1.07 52 happens(push,A) | push = B | backwards = C | -initiates(B,C,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: happens(push,f2(A,B,C)) | push = f1(A,B,C) | backwards = C | -startedIn(A,C,B). [resolve(52,d,32,a)]. 0.78/1.07 Derived: happens(push,A) | push = f3(B,A) | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(52,d,34,b)]. 0.78/1.07 53 happens(push,A) | -happens(pull,A) | backwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.78/1.07 Derived: happens(push,f2(A,B,C)) | -happens(pull,f2(A,B,C)) | backwards = C | -startedIn(A,C,B). [resolve(53,d,32,a)]. 0.78/1.07 Derived: happens(push,A) | -happens(pull,A) | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(53,d,34,b)]. 0.78/1.07 54 terminates(f4(A,B,C),B,f5(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom). [clausify(8)]. 0.78/1.07 55 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(5)]. 0.78/1.07 56 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(6)]. 0.78/1.07 57 -less(A,B) | -terminates(C,D,B) | -less(B,E) | -happens(C,B) | stoppedIn(A,D,E) # label(stoppedin_defn) # label(axiom). [clausify(8)]. 0.78/1.07 Derived: -stoppedIn(A,B,C) | -happens(f4(A,B,C),f5(A,B,C)) | -holdsAt(B,plus(f5(A,B,C),n1)). [resolve(54,a,55,a)]. 0.78/1.07 Derived: -stoppedIn(A,B,C) | -less(D,f5(A,B,C)) | -less(f5(A,B,C),E) | -happens(f4(A,B,C),f5(A,B,C)) | stoppedIn(D,B,E). [resolve(54,a,57,b)]. 0.78/1.07 58 -holdsAt(A,B) | terminates(f8(A,B),A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom). [clausify(12)]. 0.78/1.07 Derived: -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f8(A,B),B) | stoppedIn(C,A,D). [resolve(58,b,57,b)]. 0.78/1.07 59 -terminates(A,B,C) | backwards = B | forwards = B | -happens(pull,C) | -happens(push,C) # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: backwards = A | forwards = A | -happens(pull,f5(B,A,C)) | -happens(push,f5(B,A,C)) | -stoppedIn(B,A,C). [resolve(59,a,54,a)]. 0.78/1.07 Derived: backwards = A | forwards = A | -happens(pull,B) | -happens(push,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(59,a,58,b)]. 0.78/1.07 60 -terminates(A,B,C) | backwards = B | forwards = B | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: backwards = A | forwards = A | spinning = A | -stoppedIn(B,A,C). [resolve(60,a,54,a)]. 0.78/1.07 Derived: backwards = A | forwards = A | spinning = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(60,a,58,b)]. 0.78/1.07 61 -terminates(A,B,C) | backwards = B | forwards = B | push = A | -happens(push,C) # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: backwards = A | forwards = A | push = f4(B,A,C) | -happens(push,f5(B,A,C)) | -stoppedIn(B,A,C). [resolve(61,a,54,a)]. 0.78/1.07 Derived: backwards = A | forwards = A | push = f8(A,B) | -happens(push,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(61,a,58,b)]. 0.78/1.07 62 -terminates(A,B,C) | backwards = B | pull = A | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: backwards = A | pull = f4(B,A,C) | spinning = A | -stoppedIn(B,A,C). [resolve(62,a,54,a)]. 0.78/1.07 Derived: backwards = A | pull = f8(A,B) | spinning = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(62,a,58,b)]. 0.78/1.07 63 -terminates(A,B,C) | -happens(pull,C) | forwards = B | happens(push,C) | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: -happens(pull,f5(A,B,C)) | forwards = B | happens(push,f5(A,B,C)) | spinning = B | -stoppedIn(A,B,C). [resolve(63,a,54,a)]. 0.78/1.07 Derived: -happens(pull,A) | forwards = B | happens(push,A) | spinning = B | -holdsAt(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,plus(A,n1)). [resolve(63,a,58,b)]. 0.78/1.07 64 -terminates(A,B,C) | -happens(pull,C) | pull = A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: -happens(pull,f5(A,B,C)) | pull = f4(A,B,C) | -stoppedIn(A,B,C). [resolve(64,a,54,a)]. 0.78/1.07 Derived: -happens(pull,A) | pull = f8(B,A) | -holdsAt(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,plus(A,n1)). [resolve(64,a,58,b)]. 0.78/1.07 65 -terminates(A,B,C) | push = A | forwards = B | happens(push,C) | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: push = f4(A,B,C) | forwards = B | happens(push,f5(A,B,C)) | spinning = B | -stoppedIn(A,B,C). [resolve(65,a,54,a)]. 0.78/1.07 Derived: push = f8(A,B) | forwards = A | happens(push,B) | spinning = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(65,a,58,b)]. 0.78/1.07 66 -terminates(A,B,C) | push = A | pull = A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.78/1.07 Derived: push = f4(A,B,C) | pull = f4(A,B,C) | -stoppedIn(A,B,C). [resolve(66,a,54,a)]. 0.78/1.07 DeriAlarm clock 119.72/120.02 Prover9 interrupted 119.72/120.03 EOF