0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n019.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:39:55 CDT 2018 0.02/0.23 % CPUTime : 0.07/0.49 ============================== Prover9 =============================== 0.07/0.49 Prover9 (32) version 2009-11A, November 2009. 0.07/0.49 Process 53424 was started by sandbox on n019.star.cs.uiowa.edu, 0.07/0.49 Sat Jul 14 04:39:55 2018 0.07/0.49 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_53392_n019.star.cs.uiowa.edu". 0.07/0.49 ============================== end of head =========================== 0.07/0.49 0.07/0.49 ============================== INPUT ================================= 0.07/0.49 0.07/0.49 % Reading from file /tmp/Prover9_53392_n019.star.cs.uiowa.edu 0.07/0.49 0.07/0.49 set(prolog_style_variables). 0.07/0.49 set(auto2). 0.07/0.49 % set(auto2) -> set(auto). 0.07/0.49 % set(auto) -> set(auto_inference). 0.07/0.49 % set(auto) -> set(auto_setup). 0.07/0.49 % set(auto_setup) -> set(predicate_elim). 0.07/0.49 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.49 % set(auto) -> set(auto_limits). 0.07/0.49 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.49 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.49 % set(auto) -> set(auto_denials). 0.07/0.49 % set(auto) -> set(auto_process). 0.07/0.49 % set(auto2) -> assign(new_constants, 1). 0.07/0.49 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.49 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.49 % set(auto2) -> assign(max_hours, 1). 0.07/0.49 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.49 % set(auto2) -> assign(max_seconds, 0). 0.07/0.49 % set(auto2) -> assign(max_minutes, 5). 0.07/0.49 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.49 % set(auto2) -> set(sort_initial_sos). 0.07/0.49 % set(auto2) -> assign(sos_limit, -1). 0.07/0.49 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.49 % set(auto2) -> assign(max_megs, 400). 0.07/0.49 % set(auto2) -> assign(stats, some). 0.07/0.49 % set(auto2) -> clear(echo_input). 0.07/0.49 % set(auto2) -> set(quiet). 0.07/0.49 % set(auto2) -> clear(print_initial_clauses). 0.07/0.49 % set(auto2) -> clear(print_given). 0.07/0.49 assign(lrs_ticks,-1). 0.07/0.49 assign(sos_limit,10000). 0.07/0.49 assign(order,kbo). 0.07/0.49 set(lex_order_vars). 0.07/0.49 clear(print_given). 0.07/0.49 0.07/0.49 % formulas(sos). % not echoed (48 formulas) 0.07/0.49 0.07/0.49 ============================== end of input ========================== 0.07/0.49 0.07/0.49 % From the command line: assign(max_seconds, 300). 0.07/0.49 0.07/0.49 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.49 0.07/0.49 % Formulas that are not ordinary clauses: 0.07/0.49 1 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event ((terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) & happens(Event,Time))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 2 (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.07/0.49 3 (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.07/0.49 4 (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.07/0.49 5 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (initiates(Event,Fluent,Time) & happens(Event,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 6 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & trajectory(Fluent,Time,Fluent2,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 7 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 8 (all Time1 all Fluent all Time2 ((exists Event exists Time (less(Time1,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & happens(Event,Time))) <-> stoppedIn(Time1,Fluent,Time2))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 9 (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.07/0.49 10 (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.07/0.49 11 (all Fluent all Time (-releasedAt(Fluent,plus(Time,n1)) & -(exists Event (terminates(Event,Fluent,Time) & happens(Event,Time))) & holdsAt(Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 12 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & less(n0,Time2) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & terminates(Event,Fluent1,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 13 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 14 (all Event all Time (happens(Event,Time) <-> Event = pull & n2 = Time | Time = n2 & push = Event | n1 = Time & pull = Event | push = Event & n0 = Time)) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 15 (all Event all Fluent all Time (-happens(push,Time) & Fluent = backwards & pull = Event | Event = pull & spinning = Fluent & happens(push,Time) | push = Event & -happens(pull,Time) & forwards = Fluent <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 16 (all Event all Fluent all Time (Event = pull & forwards = Fluent & -happens(push,Time) | Event = pull & happens(push,Time) & Fluent = forwards | happens(push,Time) & backwards = Fluent & pull = Event | Event = push & -happens(pull,Time) & Fluent = spinning | pull = Event & -happens(push,Time) & spinning = Fluent | -happens(pull,Time) & backwards = Fluent & Event = push <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 17 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 18 (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.07/0.49 19 (all X all Y (-less(Y,X) & Y != X <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 20 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 21 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 22 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 23 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 24 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 25 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 26 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 27 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 28 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 29 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.07/0.49 30 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption]. 0.07/0.49 0.07/0.49 ============================== end of process non-clausal formulas === 0.07/0.49 0.07/0.49 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.49 0.07/0.49 ============================== PREDICATE ELIMINATION ================= 0.07/0.49 31 -terminates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(2)]. 0.07/0.49 32 -releasedAt(A,B) | terminates(f1(A,B),A,B) | initiates(f1(A,B),A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom). [clausify(1)]. 0.07/0.49 33 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(3)]. 0.07/0.49 34 -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | stoppedIn(A,E,C) # label(stoppedin_defn) # label(axiom). [clausify(8)]. 0.07/0.49 35 terminates(f5(A,B,C),B,f6(A,B,C)) | -stoppedIn(A,B,C) # label(stoppedin_defn) # label(axiom). [clausify(8)]. 0.07/0.49 Derived: -stoppedIn(A,B,C) | -happens(f5(A,B,C),f6(A,B,C)) | -holdsAt(B,plus(f6(A,B,C),n1)). [resolve(35,a,33,a)]. 0.07/0.49 Derived: -stoppedIn(A,B,C) | -less(D,f6(A,B,C)) | -less(f6(A,B,C),E) | -happens(f5(A,B,C),f6(A,B,C)) | stoppedIn(D,B,E). [resolve(35,a,34,c)]. 0.07/0.49 36 releasedAt(A,plus(B,n1)) | terminates(f8(A,B),A,B) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom). [clausify(11)]. 0.07/0.49 Derived: releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f8(A,B),B) | stoppedIn(C,A,D). [resolve(36,b,34,c)]. 0.07/0.49 37 -happens(A,B) | -less(n0,C) | -antitrajectory(D,B,E,C) | startedIn(B,D,plus(B,C)) | -terminates(A,D,B) | holdsAt(E,plus(B,C)) # label(antitrajectory) # label(axiom). [clausify(12)]. 0.07/0.49 Derived: -happens(f5(A,B,C),f6(A,B,C)) | -less(n0,D) | -antitrajectory(B,f6(A,B,C),E,D) | startedIn(f6(A,B,C),B,plus(f6(A,B,C),D)) | holdsAt(E,plus(f6(A,B,C),D)) | -stoppedIn(A,B,C). [resolve(37,e,35,a)]. 0.07/0.49 Derived: -happens(f8(A,B),B) | -less(n0,C) | -antitrajectory(A,B,D,C) | startedIn(B,A,plus(B,C)) | holdsAt(D,plus(B,C)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(37,e,36,b)]. 0.07/0.49 38 pull != A | forwards != B | happens(push,C) | terminates(A,B,C) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull != A | forwards != B | happens(push,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)). [resolve(38,d,33,a)]. 0.07/0.49 Derived: pull != A | forwards != B | happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | stoppedIn(D,B,E). [resolve(38,d,34,c)]. 0.07/0.49 Derived: pull != A | forwards != B | happens(push,C) | -happens(A,C) | -less(n0,D) | -antitrajectory(B,C,E,D) | startedIn(C,B,plus(C,D)) | holdsAt(E,plus(C,D)). [resolve(38,d,37,e)]. 0.07/0.49 39 pull != A | -happens(push,B) | forwards != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull != A | -happens(push,B) | forwards != C | -happens(A,B) | -holdsAt(C,plus(B,n1)). [resolve(39,d,33,a)]. 0.07/0.49 Derived: pull != A | -happens(push,B) | forwards != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E). [resolve(39,d,34,c)]. 0.07/0.49 Derived: pull != A | -happens(push,B) | forwards != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)). [resolve(39,d,37,e)]. 0.07/0.49 40 -happens(push,A) | backwards != B | pull != C | terminates(C,B,A) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: -happens(push,A) | backwards != B | pull != C | -happens(C,A) | -holdsAt(B,plus(A,n1)). [resolve(40,d,33,a)]. 0.07/0.49 Derived: -happens(push,A) | backwards != B | pull != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E). [resolve(40,d,34,c)]. 0.07/0.49 Derived: -happens(push,A) | backwards != B | pull != C | -happens(C,A) | -less(n0,D) | -antitrajectory(B,A,E,D) | startedIn(A,B,plus(A,D)) | holdsAt(E,plus(A,D)). [resolve(40,d,37,e)]. 0.07/0.49 41 push != A | happens(pull,B) | spinning != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: push != A | happens(pull,B) | spinning != C | -happens(A,B) | -holdsAt(C,plus(B,n1)). [resolve(41,d,33,a)]. 0.07/0.49 Derived: push != A | happens(pull,B) | spinning != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E). [resolve(41,d,34,c)]. 0.07/0.49 Derived: push != A | happens(pull,B) | spinning != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)). [resolve(41,d,37,e)]. 0.07/0.49 42 pull != A | happens(push,B) | spinning != C | terminates(A,C,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull != A | happens(push,B) | spinning != C | -happens(A,B) | -holdsAt(C,plus(B,n1)). [resolve(42,d,33,a)]. 0.07/0.49 Derived: pull != A | happens(push,B) | spinning != C | -less(D,B) | -less(B,E) | -happens(A,B) | stoppedIn(D,C,E). [resolve(42,d,34,c)]. 0.07/0.49 Derived: pull != A | happens(push,B) | spinning != C | -happens(A,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)). [resolve(42,d,37,e)]. 0.07/0.49 43 happens(pull,A) | backwards != B | push != C | terminates(C,B,A) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: happens(pull,A) | backwards != B | push != C | -happens(C,A) | -holdsAt(B,plus(A,n1)). [resolve(43,d,33,a)]. 0.07/0.49 Derived: happens(pull,A) | backwards != B | push != C | -less(D,A) | -less(A,E) | -happens(C,A) | stoppedIn(D,B,E). [resolve(43,d,34,c)]. 0.07/0.49 Derived: happens(pull,A) | backwards != B | push != C | -happens(C,A) | -less(n0,D) | -antitrajectory(B,A,E,D) | startedIn(A,B,plus(A,D)) | holdsAt(E,plus(A,D)). [resolve(43,d,37,e)]. 0.07/0.49 44 pull = A | push = A | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull = f5(A,B,C) | push = f5(A,B,C) | -stoppedIn(A,B,C). [resolve(44,c,35,a)]. 0.07/0.49 Derived: pull = f8(A,B) | push = f8(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(44,c,36,b)]. 0.07/0.49 45 pull = A | -happens(pull,B) | -terminates(A,C,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull = f5(A,B,C) | -happens(pull,f6(A,B,C)) | -stoppedIn(A,B,C). [resolve(45,c,35,a)]. 0.07/0.49 Derived: pull = f8(A,B) | -happens(pull,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(45,c,36,b)]. 0.07/0.49 46 pull = A | spinning = B | backwards = B | -terminates(A,B,C) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: pull = f5(A,B,C) | spinning = B | backwards = B | -stoppedIn(A,B,C). [resolve(46,d,35,a)]. 0.07/0.49 Derived: pull = f8(A,B) | spinning = A | backwards = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(46,d,36,b)]. 0.07/0.49 47 forwards = A | happens(push,B) | push = C | spinning = A | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: forwards = A | happens(push,f6(B,A,C)) | push = f5(B,A,C) | spinning = A | -stoppedIn(B,A,C). [resolve(47,e,35,a)]. 0.07/0.49 Derived: forwards = A | happens(push,B) | push = f8(A,B) | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(47,e,36,b)]. 0.07/0.49 48 forwards = A | happens(push,B) | -happens(pull,B) | spinning = A | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: forwards = A | happens(push,f6(B,A,C)) | -happens(pull,f6(B,A,C)) | spinning = A | -stoppedIn(B,A,C). [resolve(48,e,35,a)]. 0.07/0.49 Derived: forwards = A | happens(push,B) | -happens(pull,B) | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(48,e,36,b)]. 0.07/0.49 49 forwards = A | backwards = A | push = B | -happens(push,C) | -terminates(B,A,C) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: forwards = A | backwards = A | push = f5(B,A,C) | -happens(push,f6(B,A,C)) | -stoppedIn(B,A,C). [resolve(49,e,35,a)]. 0.07/0.49 Derived: forwards = A | backwards = A | push = f8(A,B) | -happens(push,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(49,e,36,b)]. 0.07/0.49 50 forwards = A | backwards = A | -happens(pull,B) | -happens(push,B) | -terminates(C,A,B) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: forwards = A | backwards = A | -happens(pull,f6(B,A,C)) | -happens(push,f6(B,A,C)) | -stoppedIn(B,A,C). [resolve(50,e,35,a)]. 0.07/0.49 Derived: forwards = A | backwards = A | -happens(pull,B) | -happens(push,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(50,e,36,b)]. 0.07/0.49 51 forwards = A | backwards = A | spinning = A | -terminates(B,A,C) # label(terminates_all_defn) # label(axiom). [clausify(16)]. 0.07/0.49 Derived: forwards = A | backwards = A | spinning = A | -stoppedIn(B,A,C). [resolve(51,d,35,a)]. 0.07/0.49 Derived: forwards = A | backwards = A | spinning = A | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(51,d,36,b)]. 0.07/0.49 52 initiates(f2(A,B,C),C,f3(A,B,C)) | -startedIn(A,C,B) # label(startedin_defn) # label(axiom). [clausify(4)]. 0.07/0.49 53 -initiates(A,B,C) | -happens(A,C) | -releasedAt(B,plus(C,n1)) # label(happens_not_released) # label(axiom). [clausify(2)]. 0.07/0.49 54 -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | startedIn(A,D,E) # label(startedin_defn) # label(axiom). [clausify(4)]. 0.07/0.49 Derived: -startedIn(A,B,C) | -less(D,f3(A,C,B)) | -less(f3(A,C,B),E) | -happens(f2(A,C,B),f3(A,C,B)) | startedIn(D,B,E). [resolve(52,a,54,b)]. 0.07/0.49 55 holdsAt(A,B) | releasedAt(A,plus(B,n1)) | initiates(f4(A,B),A,B) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom). [clausify(5)]. 0.07/0.49 Derived: holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)) | -less(C,B) | -less(B,D) | -happens(f4(A,B),B) | startedIn(C,A,D). [resolve(55,c,54,b)]. 0.07/0.49 56 -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) # label(change_holding) # label(axiom). [clausify(6)]. 0.07/0.49 Derived: -less(n0,A) | -trajectory(B,f3(C,D,B),E,A) | stoppedIn(f3(C,D,B),B,plus(f3(C,D,B),A)) | -happens(f2(C,D,B),f3(C,D,B)) | holdsAt(E,plus(f3(C,D,B),A)) | -startedIn(C,B,D). [resolve(56,d,52,a)]. 0.07/0.49 Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -happens(f4(B,C),C) | holdsAt(D,plus(C,A)) | holdsAt(B,C) | releasedAt(B,plus(C,n1)) | -holdsAt(B,plus(C,n1)). [resolve(56,d,55,c)]. 0.07/0.49 57 -happens(A,B) | -initiates(A,C,B) | holdsAt(C,plus(B,n1)) # label(happens_holds) # label(axiom). [clausify(7)]. 0.07/0.49 Derived: -happens(f2(A,B,C),f3(A,B,C)) | holdsAt(C,plus(f3(A,B,C),n1)) | -startedIn(A,C,B). [resolve(57,b,52,a)]. 0.07/0.49 58 happens(push,A) | backwards != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.49 Derived: happens(push,A) | backwards != B | pull != C | -less(D,A) | -less(A,E) | -happens(C,A) | startedIn(D,B,E). [resolve(58,d,54,b)]. 0.07/0.49 Derived: happens(push,A) | backwards != B | pull != C | -less(n0,D) | -trajectory(B,A,E,D) | stoppedIn(A,B,plus(A,D)) | -happens(C,A) | holdsAt(E,plus(A,D)). [resolve(58,d,56,d)]. 0.07/0.49 Derived: happens(push,A) | backwards != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)). [resolve(58,d,57,b)]. 0.07/0.49 59 pull != A | spinning != B | -happens(push,C) | initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.49 Derived: pull != A | spinning != B | -happens(push,C) | -less(D,C) | -less(C,E) | -happens(A,C) | startedIn(D,B,E). [resolve(59,d,54,b)]. 0.07/0.49 Derived: pull != A | spinning != B | -happens(push,C) | -less(n0,D) | -trajectory(B,C,E,D) | stoppedIn(C,B,plus(C,D)) | -happens(A,C) | holdsAt(E,plus(C,D)). [resolve(59,d,56,d)]. 0.07/0.49 Derived: pull != A | spinning != B | -happens(push,C) | -happens(A,C) | holdsAt(B,plus(C,n1)). [resolve(59,d,57,b)]. 0.07/0.49 60 push != A | happens(pull,B) | forwards != C | initiates(A,C,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.49 Derived: push != A | happens(pull,B) | forwards != C | -less(D,B) | -less(B,E) | -happens(A,B) | startedIn(D,C,E). [resolve(60,d,54,b)]. 0.07/0.49 Derived: push != A | happens(pull,B) | forwards != C | -less(n0,D) | -trajectory(C,B,E,D) | stoppedIn(B,C,plus(B,D)) | -happens(A,B) | holdsAt(E,plus(B,D)). [resolve(60,d,56,d)]. 0.07/0.49 Derived: push != A | happens(pull,B) | forwards != C | -happens(A,B) | holdsAt(C,plus(B,n1)). [resolve(60,d,57,b)]. 0.07/0.49 61 -happens(push,A) | spinning = B | push = C | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.49 Derived: -happens(push,f3(A,B,C)) | spinning = C | push = f2(A,B,C) | -startedIn(A,C,B). [resolve(61,d,52,a)]. 0.07/0.49 Derived: -happens(push,A) | spinning = B | push = f4(B,A) | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(61,d,55,c)]. 0.07/0.49 62 -happens(push,A) | spinning = B | -happens(pull,A) | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: -happens(push,f3(A,B,C)) | spinning = C | -happens(pull,f3(A,B,C)) | -startedIn(A,C,B). [resolve(62,d,52,a)]. 0.07/0.50 Derived: -happens(push,A) | spinning = B | -happens(pull,A) | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(62,d,55,c)]. 0.07/0.50 63 -happens(push,A) | spinning = B | forwards = B | -initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: -happens(push,f3(A,B,C)) | spinning = C | forwards = C | -startedIn(A,C,B). [resolve(63,d,52,a)]. 0.07/0.50 Derived: -happens(push,A) | spinning = B | forwards = B | holdsAt(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,plus(A,n1)). [resolve(63,d,55,c)]. 0.07/0.50 64 backwards = A | spinning = A | push = B | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | spinning = A | push = f2(B,C,A) | -startedIn(B,A,C). [resolve(64,d,52,a)]. 0.07/0.50 Derived: backwards = A | spinning = A | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(64,d,55,c)]. 0.07/0.50 65 backwards = A | spinning = A | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | spinning = A | -happens(pull,f3(B,C,A)) | -startedIn(B,A,C). [resolve(65,d,52,a)]. 0.07/0.50 Derived: backwards = A | spinning = A | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(65,d,55,c)]. 0.07/0.50 66 backwards = A | spinning = A | forwards = A | -initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | spinning = A | forwards = A | -startedIn(B,A,C). [resolve(66,d,52,a)]. 0.07/0.50 Derived: backwards = A | spinning = A | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(66,d,55,c)]. 0.07/0.50 67 backwards = A | happens(push,B) | push = C | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | happens(push,f3(B,C,A)) | push = f2(B,C,A) | -startedIn(B,A,C). [resolve(67,d,52,a)]. 0.07/0.50 Derived: backwards = A | happens(push,B) | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(67,d,55,c)]. 0.07/0.50 68 backwards = A | happens(push,B) | -happens(pull,B) | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | happens(push,f3(B,C,A)) | -happens(pull,f3(B,C,A)) | -startedIn(B,A,C). [resolve(68,d,52,a)]. 0.07/0.50 Derived: backwards = A | happens(push,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(68,d,55,c)]. 0.07/0.50 69 backwards = A | happens(push,B) | forwards = A | -initiates(C,A,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: backwards = A | happens(push,f3(B,C,A)) | forwards = A | -startedIn(B,A,C). [resolve(69,d,52,a)]. 0.07/0.50 Derived: backwards = A | happens(push,B) | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(69,d,55,c)]. 0.07/0.50 70 pull = A | push = A | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: pull = f2(A,B,C) | push = f2(A,B,C) | -startedIn(A,C,B). [resolve(70,c,52,a)]. 0.07/0.50 Derived: pull = f4(A,B) | push = f4(A,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(70,c,55,c)]. 0.07/0.50 71 pull = A | -happens(pull,B) | -initiates(A,C,B) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: pull = f2(A,B,C) | -happens(pull,f3(A,B,C)) | -startedIn(A,C,B). [resolve(71,c,52,a)]. 0.07/0.50 Derived: pull = f4(A,B) | -happens(pull,B) | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(71,c,55,c)]. 0.07/0.50 72 pull = A | forwards = B | -initiates(A,B,C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.07/0.50 Derived: pull = f2(A,B,C) | forwards = C | -startedIn(A,C,B). [resolve(72,c,52,a)]. 0.07/0.50 Derived: pull = f4(A,B) | forwards = A | holdsAt(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,plus(B,n1)). [resolve(72,c,55,c)]. 0.07/0.50 73 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom). [clausify(10)]. 0.31/0.59 74 releases(f7(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(9)]. 0.31/0.59 75 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(13)]. 0.31/0.59 0.31/0.59 ============================== end predicate elimination ============= 0.31/0.59 0.31/0.59 Auto_denials: (non-Horn, no changes). 0.31/0.59 0.31/0.59 Term ordering decisions: 0.31/0.59 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. f1=1. f4=1. f7=1. f8=1. f2=1. f3=1. f5=1. f6=1. 0.31/0.59 0.31/0.59 ============================== end of process initial clauses ======== 0.31/0.59 0.31/0.59 ============================== CLAUSES FOR SEARCH ==================== 0.31/0.59 0.31/0.59 ============================== end of clauses for search ============= 0.31/0.59 0.31/0.59 ============================== SEARCH ================================ 0.31/0.59 0.31/0.59 % Starting search at 0.03 seconds. 0.31/0.59 0.31/0.59 ============================== PROOF ================================= 0.31/0.59 % SZS status Theorem 0.31/0.59 % SZS output start Refutation 0.31/0.59 0.31/0.59 % Proof 1 at 0.11 (+ 0.00) seconds. 0.31/0.59 % Length of proof is 29. 0.31/0.59 % Level of proof is 6. 0.31/0.59 % Maximum clause weight is 17.000. 0.31/0.59 % Given clauses 351. 0.31/0.59 0.31/0.59 7 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 14 (all Event all Time (happens(Event,Time) <-> Event = pull & n2 = Time | Time = n2 & push = Event | n1 = Time & pull = Event | push = Event & n0 = Time)) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 15 (all Event all Fluent all Time (-happens(push,Time) & Fluent = backwards & pull = Event | Event = pull & spinning = Fluent & happens(push,Time) | push = Event & -happens(pull,Time) & forwards = Fluent <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 17 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 18 (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.31/0.59 19 (all X all Y (-less(Y,X) & Y != X <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 26 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.31/0.59 57 -happens(A,B) | -initiates(A,C,B) | holdsAt(C,plus(B,n1)) # label(happens_holds) # label(axiom). [clausify(7)]. 0.31/0.59 58 happens(push,A) | backwards != B | pull != C | initiates(C,B,A) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 0.31/0.59 90 -happens(A,B) | n2 = B | pull = A | n0 = B # label(happens_all_defn) # label(axiom). [clausify(14)]. 0.31/0.59 93 happens(A,B) | n1 != B | pull != A # label(happens_all_defn) # label(axiom). [clausify(14)]. 0.31/0.59 98 pull != push # label(push_not_pull) # label(axiom). [assumption]. 0.31/0.59 102 less(A,n1) | -less_or_equal(A,n0) # label(less1) # label(axiom). [clausify(17)]. 0.31/0.59 107 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom). [clausify(18)]. 0.31/0.59 111 plus(n1,n1) = n2 # label(plus1_1) # label(axiom). [assumption]. 0.31/0.59 114 A != B | -less(B,A) # label(less_property) # label(axiom). [clausify(19)]. 0.31/0.59 132 -less_or_equal(A,n1) | less(A,n2) # label(less2) # label(axiom). [clausify(26)]. 0.31/0.59 143 -holdsAt(backwards,n2) # label(backwards_2) # label(negated_conjecture). [assumption]. 0.31/0.59 211 happens(push,A) | backwards != B | pull != C | -happens(C,A) | holdsAt(B,plus(A,n1)). [resolve(58,d,57,b)]. 0.31/0.59 269 happens(A,n1) | pull != A. [xx_res(93,b)]. 0.31/0.59 275 less_or_equal(A,A). [xx_res(107,b)]. 0.31/0.59 354 less(n1,n2). [resolve(275,a,132,a)]. 0.31/0.59 361 less(n0,n1). [resolve(275,a,102,b)]. 0.31/0.59 406 n2 != n1. [resolve(354,a,114,b)]. 0.31/0.59 578 n0 != n1. [resolve(361,a,114,b),flip(a)]. 0.31/0.59 585 happens(pull,n1). [xx_res(269,b)]. 0.31/0.59 711 happens(push,n1) | backwards != A | holdsAt(A,n2). [resolve(585,a,211,d),rewrite([111(11)]),xx(c)]. 0.31/0.59 1496 happens(push,n1). [xx_res(711,b),unit_del(b,143)]. 0.31/0.59 1528 $F. [resolve(1496,a,90,a),unit_del(a,406),unit_del(b,98),unit_del(c,578)]. 0.31/0.59 0.31/0.59 % SZS output end Refutation 0.31/0.59 ============================== end of proof ========================== 0.31/0.59 0.31/0.59 ============================== STATISTICS ============================ 0.31/0.59 0.31/0.59 Given=351. Generated=2389. Kept=1408. proofs=1. 0.31/0.59 Usable=345. Sos=956. Demods=11. Limbo=0, Disabled=292. Hints=0. 0.31/0.59 Megabytes=1.46. 0.31/0.59 User_CPU=0.11, System_CPU=0.00, Wall_clock=0. 0.31/0.59 0.31/0.59 ============================== end of statistics ===================== 0.31/0.59 0.31/0.59 ============================== end of search ========================= 0.31/0.59 0.31/0.59 THEOREM PROVED 0.31/0.59 % SZS status Theorem 0.31/0.59 0.31/0.59 Exiting with 1 proof. 0.31/0.59 0.31/0.59 Process 53424 exit (max_proofs) Sat Jul 14 04:39:55 2018 0.31/0.59 Prover9 interrupted 0.31/0.59 EOF