0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.32 % Computer : n005.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % DateTime : Thu Jul 2 07:37:51 EDT 2020 0.12/0.33 % CPUTime : 0.73/1.02 ============================== Prover9 =============================== 0.73/1.02 Prover9 (32) version 2009-11A, November 2009. 0.73/1.02 Process 10516 was started by sandbox2 on n005.cluster.edu, 0.73/1.02 Thu Jul 2 07:37:51 2020 0.73/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_10330_n005.cluster.edu". 0.73/1.02 ============================== end of head =========================== 0.73/1.02 0.73/1.02 ============================== INPUT ================================= 0.73/1.02 0.73/1.02 % Reading from file /tmp/Prover9_10330_n005.cluster.edu 0.73/1.02 0.73/1.02 set(prolog_style_variables). 0.73/1.02 set(auto2). 0.73/1.02 % set(auto2) -> set(auto). 0.73/1.02 % set(auto) -> set(auto_inference). 0.73/1.02 % set(auto) -> set(auto_setup). 0.73/1.02 % set(auto_setup) -> set(predicate_elim). 0.73/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.73/1.02 % set(auto) -> set(auto_limits). 0.73/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.73/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.73/1.02 % set(auto) -> set(auto_denials). 0.73/1.02 % set(auto) -> set(auto_process). 0.73/1.02 % set(auto2) -> assign(new_constants, 1). 0.73/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.73/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.73/1.02 % set(auto2) -> assign(max_hours, 1). 0.73/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.73/1.02 % set(auto2) -> assign(max_seconds, 0). 0.73/1.02 % set(auto2) -> assign(max_minutes, 5). 0.73/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.73/1.02 % set(auto2) -> set(sort_initial_sos). 0.73/1.02 % set(auto2) -> assign(sos_limit, -1). 0.73/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.73/1.02 % set(auto2) -> assign(max_megs, 400). 0.73/1.02 % set(auto2) -> assign(stats, some). 0.73/1.02 % set(auto2) -> clear(echo_input). 0.73/1.02 % set(auto2) -> set(quiet). 0.73/1.02 % set(auto2) -> clear(print_initial_clauses). 0.73/1.02 % set(auto2) -> clear(print_given). 0.73/1.02 assign(lrs_ticks,-1). 0.73/1.02 assign(sos_limit,10000). 0.73/1.02 assign(order,kbo). 0.73/1.02 set(lex_order_vars). 0.73/1.02 clear(print_given). 0.73/1.02 0.73/1.02 % formulas(sos). % not echoed (48 formulas) 0.73/1.02 0.73/1.02 ============================== end of input ========================== 0.73/1.02 0.73/1.02 % From the command line: assign(max_seconds, 960). 0.73/1.02 0.73/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.73/1.02 0.73/1.02 % Formulas that are not ordinary clauses: 0.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 16 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 17 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 18 (all X all Y (less(X,Y) | Y = X <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 19 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 20 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 21 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 22 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 23 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 24 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption]. 0.73/1.02 25 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 26 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 27 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 28 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 29 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 30 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 0.73/1.02 ============================== end of process non-clausal formulas === 0.73/1.02 0.73/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.73/1.02 0.73/1.02 ============================== PREDICATE ELIMINATION ================= 0.73/1.03 31 initiates(f1(A,B,C),C,f2(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.73/1.03 32 -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.73/1.03 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(31,a,32,b)]. 0.73/1.03 33 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.73/1.03 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(33,b,32,b)]. 0.73/1.03 34 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(3)]. 0.73/1.03 Derived: -happens(f1(A,B,C),f2(A,B,C)) | holdsAt(C,plus(f2(A,B,C),n1)) | -startedIn(A,C,B). [resolve(34,a,31,a)]. 0.73/1.03 35 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(6)]. 0.73/1.03 36 -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.73/1.03 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(36,a,31,a)]. 0.73/1.03 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(36,a,33,b)]. 0.73/1.03 37 -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.73/1.03 38 pull != A | spinning != B | -happens(push,C) | initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: pull != A | spinning != B | -happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | startedIn(D,B,E). [resolve(38,d,32,b)]. 0.73/1.03 Derived: pull != A | spinning != B | -happens(push,C) | -happens(A,C) | holdsAt(B,plus(C,n1)). [resolve(38,d,34,a)]. 0.73/1.03 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(38,d,36,a)]. 0.73/1.03 39 forwards != A | push != B | happens(pull,C) | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: forwards != A | push != B | happens(pull,C) | -less(D,C) | -less(C,E) | -happens(B,C) | startedIn(D,A,E). [resolve(39,d,32,b)]. 0.73/1.03 Derived: forwards != A | push != B | happens(pull,C) | -happens(B,C) | holdsAt(A,plus(C,n1)). [resolve(39,d,34,a)]. 0.73/1.03 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(39,d,36,a)]. 0.73/1.03 40 backwards != A | pull != B | happens(push,C) | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: backwards != A | pull != B | happens(push,C) | -less(D,C) | -less(C,E) | -happens(B,C) | startedIn(D,A,E). [resolve(40,d,32,b)]. 0.73/1.03 Derived: backwards != A | pull != B | happens(push,C) | -happens(B,C) | holdsAt(A,plus(C,n1)). [resolve(40,d,34,a)]. 0.73/1.03 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(40,d,36,a)]. 0.73/1.03 41 pull = A | forwards = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: pull = f1(A,B,C) | forwards = C | -startedIn(A,C,B). [resolve(41,c,31,a)]. 0.73/1.03 Derived: pull = f3(A,B) | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(41,c,33,b)]. 0.73/1.03 42 pull = A | push = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: pull = f1(A,B,C) | push = f1(A,B,C) | -startedIn(A,C,B). [resolve(42,c,31,a)]. 0.73/1.03 Derived: pull = f3(A,B) | push = f3(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(42,c,33,b)]. 0.73/1.03 43 pull = A | -happens(pull,B) | -initiates(A,C,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: pull = f1(A,B,C) | -happens(pull,f2(A,B,C)) | -startedIn(A,C,B). [resolve(43,c,31,a)]. 0.73/1.03 Derived: pull = f3(A,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(43,c,33,b)]. 0.73/1.03 44 spinning = A | forwards = A | backwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | forwards = A | backwards = A | -startedIn(B,A,C). [resolve(44,d,31,a)]. 0.73/1.03 Derived: spinning = A | forwards = A | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(44,d,33,b)]. 0.73/1.03 45 spinning = A | forwards = A | -happens(push,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | forwards = A | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(45,d,31,a)]. 0.73/1.03 Derived: spinning = A | forwards = A | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(45,d,33,b)]. 0.73/1.03 46 spinning = A | push = B | backwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | push = f1(B,C,A) | backwards = A | -startedIn(B,A,C). [resolve(46,d,31,a)]. 0.73/1.03 Derived: spinning = A | push = f3(A,B) | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(46,d,33,b)]. 0.73/1.03 47 spinning = A | push = B | -happens(push,C) | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | push = f1(B,C,A) | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(47,d,31,a)]. 0.73/1.03 Derived: spinning = A | push = f3(A,B) | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(47,d,33,b)]. 0.73/1.03 48 spinning = A | -happens(pull,B) | backwards = A | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | -happens(pull,f2(B,C,A)) | backwards = A | -startedIn(B,A,C). [resolve(48,d,31,a)]. 0.73/1.03 Derived: spinning = A | -happens(pull,B) | backwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(48,d,33,b)]. 0.73/1.03 49 spinning = A | -happens(pull,B) | -happens(push,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: spinning = A | -happens(pull,f2(B,C,A)) | -happens(push,f2(B,C,A)) | -startedIn(B,A,C). [resolve(49,d,31,a)]. 0.73/1.03 Derived: spinning = A | -happens(pull,B) | -happens(push,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(49,d,33,b)]. 0.73/1.03 50 happens(push,A) | forwards = B | backwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: happens(push,f2(A,B,C)) | forwards = C | backwards = C | -startedIn(A,C,B). [resolve(50,d,31,a)]. 0.73/1.03 Derived: happens(push,A) | forwards = B | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(50,d,33,b)]. 0.73/1.03 51 happens(push,A) | push = B | backwards = C | -initiates(B,C,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: happens(push,f2(A,B,C)) | push = f1(A,B,C) | backwards = C | -startedIn(A,C,B). [resolve(51,d,31,a)]. 0.73/1.03 Derived: happens(push,A) | push = f3(B,A) | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(51,d,33,b)]. 0.73/1.03 52 happens(push,A) | -happens(pull,A) | backwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.73/1.03 Derived: happens(push,f2(A,B,C)) | -happens(pull,f2(A,B,C)) | backwards = C | -startedIn(A,C,B). [resolve(52,d,31,a)]. 0.73/1.03 Derived: happens(push,A) | -happens(pull,A) | backwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(52,d,33,b)]. 0.73/1.03 53 terminates(f4(A,B,C),B,f5(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom). [clausify(8)]. 0.73/1.03 54 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(5)]. 0.73/1.03 55 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(6)]. 0.73/1.03 56 -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.73/1.03 Derived: -stoppedIn(A,B,C) | -happens(f4(A,B,C),f5(A,B,C)) | -holdsAt(B,plus(f5(A,B,C),n1)). [resolve(53,a,54,a)]. 0.73/1.03 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(53,a,56,b)]. 0.73/1.03 57 -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.73/1.03 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(57,b,56,b)]. 0.73/1.03 58 -terminates(A,B,C) | backwards = B | forwards = B | -happens(pull,C) | -happens(push,C) # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: backwards = A | forwards = A | -happens(pull,f5(B,A,C)) | -happens(push,f5(B,A,C)) | -stoppedIn(B,A,C). [resolve(58,a,53,a)]. 0.73/1.03 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(58,a,57,b)]. 0.73/1.03 59 -terminates(A,B,C) | backwards = B | forwards = B | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: backwards = A | forwards = A | spinning = A | -stoppedIn(B,A,C). [resolve(59,a,53,a)]. 0.73/1.03 Derived: backwards = A | forwards = A | spinning = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(59,a,57,b)]. 0.73/1.03 60 -terminates(A,B,C) | backwards = B | forwards = B | push = A | -happens(push,C) # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: backwards = A | forwards = A | push = f4(B,A,C) | -happens(push,f5(B,A,C)) | -stoppedIn(B,A,C). [resolve(60,a,53,a)]. 0.73/1.03 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(60,a,57,b)]. 0.73/1.03 61 -terminates(A,B,C) | backwards = B | pull = A | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: backwards = A | pull = f4(B,A,C) | spinning = A | -stoppedIn(B,A,C). [resolve(61,a,53,a)]. 0.73/1.03 Derived: backwards = A | pull = f8(A,B) | spinning = A | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(61,a,57,b)]. 0.73/1.03 62 -terminates(A,B,C) | -happens(pull,C) | forwards = B | happens(push,C) | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: -happens(pull,f5(A,B,C)) | forwards = B | happens(push,f5(A,B,C)) | spinning = B | -stoppedIn(A,B,C). [resolve(62,a,53,a)]. 0.73/1.03 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(62,a,57,b)]. 0.73/1.03 63 -terminates(A,B,C) | -happens(pull,C) | pull = A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: -happens(pull,f5(A,B,C)) | pull = f4(A,B,C) | -stoppedIn(A,B,C). [resolve(63,a,53,a)]. 0.73/1.03 Derived: -happens(pull,A) | pull = f8(B,A) | -holdsAt(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,plus(A,n1)). [resolve(63,a,57,b)]. 0.73/1.03 64 -terminates(A,B,C) | push = A | forwards = B | happens(push,C) | spinning = B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: push = f4(A,B,C) | forwards = B | happens(push,f5(A,B,C)) | spinning = B | -stoppedIn(A,B,C). [resolve(64,a,53,a)]. 0.73/1.03 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(64,a,57,b)]. 0.73/1.03 65 -terminates(A,B,C) | push = A | pull = A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.73/1.03 Derived: push = f4(A,B,C) | pull = f4(A,B,C) | -stoppedIn(A,B,C). [resolve(65,a,53,a)]. 0.73/1.03 Derived: push = f8(A,B) | pull = f8(A,B) | -holdsAt(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,plus(B,n1)). [resolve(65,a,57,b)]. 0.87/1.17 66 terminates(A,B,C) | backwards != B | happens(pull,C) | push != A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: backwards != A | happens(pull,B) | push != C | -happens(C,B) | -holdsAt(A,plus(B,n1)). [resolve(66,a,54,a)]. 0.87/1.17 Derived: backwards != A | happens(pull,B) | push != C | -less(D,B) | -less(B,E) | -happens(C,B) | stoppedIn(D,A,E). [resolve(66,a,56,b)]. 0.87/1.17 67 terminates(A,B,C) | happens(push,C) | forwards != B | pull != A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: happens(push,A) | forwards != B | pull != C | -happens(C,A) | -holdsAt(B,plus(A,n1)). [resolve(67,a,54,a)]. 0.87/1.17 Derived: happens(push,A) | forwards != B | pull != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E). [resolve(67,a,56,b)]. 0.87/1.17 68 terminates(A,B,C) | -happens(push,C) | pull != A | forwards != B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: -happens(push,A) | pull != B | forwards != C | -happens(B,A) | -holdsAt(C,plus(A,n1)). [resolve(68,a,54,a)]. 0.87/1.17 Derived: -happens(push,A) | pull != B | forwards != C | -less(D,A) | -less(A,E) | -happens(B,A) | stoppedIn(D,C,E). [resolve(68,a,56,b)]. 0.87/1.17 69 terminates(A,B,C) | pull != A | -happens(push,C) | backwards != B # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: pull != A | -happens(push,B) | backwards != C | -happens(A,B) | -holdsAt(C,plus(B,n1)). [resolve(69,a,54,a)]. 0.87/1.17 Derived: pull != A | -happens(push,B) | backwards != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E). [resolve(69,a,56,b)]. 0.87/1.17 70 terminates(A,B,C) | happens(pull,C) | spinning != B | push != A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: happens(pull,A) | spinning != B | push != C | -happens(C,A) | -holdsAt(B,plus(A,n1)). [resolve(70,a,54,a)]. 0.87/1.17 Derived: happens(pull,A) | spinning != B | push != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E). [resolve(70,a,56,b)]. 0.87/1.17 71 terminates(A,B,C) | spinning != B | happens(push,C) | pull != A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 0.87/1.17 Derived: spinning != A | happens(push,B) | pull != C | -happens(C,B) | -holdsAt(A,plus(B,n1)). [resolve(71,a,54,a)]. 0.87/1.17 Derived: spinning != A | happens(push,B) | pull != C | -less(D,B) | -less(B,E) | -happens(C,B) | stoppedIn(D,A,E). [resolve(71,a,56,b)]. 0.87/1.17 72 releases(f6(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(9)]. 0.87/1.17 73 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom). [clausify(7)]. 0.87/1.17 74 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(16)]. 0.87/1.17 0.87/1.17 ============================== end predicate elimination ============= 0.87/1.17 0.87/1.17 Auto_denials: (non-Horn, no changes). 0.87/1.17 0.87/1.17 Term ordering decisions: 0.87/1.17 Function symbol KB weights: n1=1. push=1. pull=1. spinning=1. backwards=1. forwards=1. n0=1. n2=1. n3=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f3=1. f6=1. f7=1. f8=1. f1=1. f2=1. f4=1. f5=1. 0.87/1.17 0.87/1.17 ============================== end of process initial clauses ======== 0.87/1.17 0.87/1.17 ============================== CLAUSES FOR SEARCH ==================== 0.87/1.17 0.87/1.17 ============================== end of clauses for search ============= 0.87/1.17 0.87/1.17 ============================== SEARCH ================================ 0.87/1.17 0.87/1.17 % Starting search at 0.04 seconds. 0.87/1.17 0.87/1.17 ============================== PROOF ================================= 0.87/1.17 % SZS status Theorem 0.87/1.17 % SZS output start Refutation 0.87/1.17 0.87/1.17 % Proof 1 at 0.15 (+ 0.01) seconds. 0.87/1.17 % Length of proof is 31. 0.87/1.17 % Level of proof is 6. 0.87/1.17 % Maximum clause weight is 17.000. 0.87/1.17 % Given clauses 343. 0.87/1.17 0.87/1.17 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.87/1.17 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.87/1.17 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.87/1.17 18 (all X all Y (less(X,Y) | Y = X <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.87/1.17 19 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.87/1.17 21 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.87/1.17 29 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.87/1.17 34 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(3)]. 0.87/1.17 40 backwards != A | pull != B | happens(push,C) | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(14)]. 0.87/1.17 89 n1 != A | pull != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(15)]. 0.87/1.17 91 n0 = A | n2 = A | pull = B | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(15)]. 0.87/1.17 94 push != pull # label(push_not_pull) # label(axiom). [assumption]. 0.87/1.17 95 pull != push. [copy(94),flip(a)]. 0.87/1.17 102 A != B | less_or_equal(B,A) # label(less_or_equal) # label(axiom). [clausify(18)]. 0.87/1.17 105 n2 = plus(n1,n1) # label(plus1_1) # label(axiom). [assumption]. 0.87/1.17 106 plus(n1,n1) = n2. [copy(105),flip(a)]. 0.87/1.17 117 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(19)]. 0.87/1.17 123 -less(A,B) | B != A # label(less_property) # label(axiom). [clausify(21)]. 0.87/1.17 140 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom). [clausify(29)]. 0.87/1.17 145 -holdsAt(backwards,n2) # label(backwards_2) # label(negated_conjecture). [assumption]. 0.87/1.17 162 backwards != A | pull != B | happens(push,C) | -happens(B,C) | holdsAt(A,plus(C,n1)). [resolve(40,d,34,a)]. 0.87/1.17 262 pull != A | happens(A,n1). [xx_res(89,a)]. 0.87/1.17 264 less_or_equal(A,A). [xx_res(102,a)]. 0.87/1.17 342 less(n0,n1). [resolve(264,a,140,a)]. 0.87/1.17 349 less(n1,n2). [resolve(264,a,117,b)]. 0.87/1.17 364 n0 != n1. [resolve(342,a,123,a),flip(a)]. 0.87/1.17 539 n2 != n1. [resolve(349,a,123,a)]. 0.87/1.17 628 happens(pull,n1). [xx_res(262,a)]. 0.87/1.17 760 backwards != A | happens(push,n1) | holdsAt(A,n2). [resolve(628,a,162,d),rewrite([106(11)]),xx(b)]. 0.87/1.17 1525 happens(push,n1). [xx_res(760,a),unit_del(b,145)]. 0.87/1.17 1565 $F. [resolve(1525,a,91,d),unit_del(a,364),unit_del(b,539),unit_del(c,95)]. 0.87/1.17 0.87/1.17 % SZS output end Refutation 0.87/1.17 ============================== end of proof ========================== 0.87/1.17 0.87/1.17 ============================== STATISTICS ============================ 0.87/1.17 0.87/1.17 Given=343. Generated=2473. Kept=1445. proofs=1. 0.87/1.17 Usable=340. Sos=993. Demods=11. Limbo=0, Disabled=289. Hints=0. 0.87/1.17 Megabytes=1.48. 0.87/1.17 User_CPU=0.15, System_CPU=0.01, Wall_clock=1. 0.87/1.17 0.87/1.17 ============================== end of statistics ===================== 0.87/1.17 0.87/1.17 ============================== end of search ========================= 0.87/1.17 0.87/1.17 THEOREM PROVED 0.87/1.17 % SZS status Theorem 0.87/1.17 0.87/1.17 Exiting with 1 proof. 0.87/1.17 0.87/1.17 Process 10516 exit (max_proofs) Thu Jul 2 07:37:52 2020 0.87/1.17 Prover9 interrupted 0.87/1.17 EOF