0.09/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.31 % Computer : n028.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 960 0.09/0.31 % WCLimit : 120 0.09/0.31 % DateTime : Tue Aug 9 04:35:20 EDT 2022 0.09/0.31 % CPUTime : 0.32/1.12 ============================== Prover9 =============================== 0.32/1.12 Prover9 (32) version 2009-11A, November 2009. 0.32/1.12 Process 12417 was started by sandbox on n028.cluster.edu, 0.32/1.12 Tue Aug 9 04:35:21 2022 0.32/1.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_12264_n028.cluster.edu". 0.32/1.12 ============================== end of head =========================== 0.32/1.12 0.32/1.12 ============================== INPUT ================================= 0.32/1.12 0.32/1.12 % Reading from file /tmp/Prover9_12264_n028.cluster.edu 0.32/1.12 0.32/1.12 set(prolog_style_variables). 0.32/1.12 set(auto2). 0.32/1.12 % set(auto2) -> set(auto). 0.32/1.12 % set(auto) -> set(auto_inference). 0.32/1.12 % set(auto) -> set(auto_setup). 0.32/1.12 % set(auto_setup) -> set(predicate_elim). 0.32/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.32/1.12 % set(auto) -> set(auto_limits). 0.32/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.32/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.32/1.12 % set(auto) -> set(auto_denials). 0.32/1.12 % set(auto) -> set(auto_process). 0.32/1.12 % set(auto2) -> assign(new_constants, 1). 0.32/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.32/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.32/1.12 % set(auto2) -> assign(max_hours, 1). 0.32/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.32/1.12 % set(auto2) -> assign(max_seconds, 0). 0.32/1.12 % set(auto2) -> assign(max_minutes, 5). 0.32/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.32/1.12 % set(auto2) -> set(sort_initial_sos). 0.32/1.12 % set(auto2) -> assign(sos_limit, -1). 0.32/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.32/1.12 % set(auto2) -> assign(max_megs, 400). 0.32/1.12 % set(auto2) -> assign(stats, some). 0.32/1.12 % set(auto2) -> clear(echo_input). 0.32/1.12 % set(auto2) -> set(quiet). 0.32/1.12 % set(auto2) -> clear(print_initial_clauses). 0.32/1.12 % set(auto2) -> clear(print_given). 0.32/1.12 assign(lrs_ticks,-1). 0.32/1.12 assign(sos_limit,10000). 0.32/1.12 assign(order,kbo). 0.32/1.12 set(lex_order_vars). 0.32/1.12 clear(print_given). 0.32/1.12 0.32/1.12 % formulas(sos). % not echoed (155 formulas) 0.32/1.12 0.32/1.12 ============================== end of input ========================== 0.32/1.12 0.32/1.12 % From the command line: assign(max_seconds, 960). 0.32/1.12 0.32/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.32/1.12 0.32/1.12 % Formulas that are not ordinary clauses: 0.32/1.12 1 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2))))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 2 (all Fluent all Time (-(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 3 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & less(Time1,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 4 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 5 (all Fluent all Time (-releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -holdsAt(Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 6 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 7 (all Event all Time all Fluent (terminates(Event,Fluent,Time) & happens(Event,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 8 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & terminates(Event,Fluent1,Time1) & less(n0,Time2) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 9 (all Event all Time all Fluent (happens(Event,Time) & releases(Event,Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 10 (all Event all Time all Fluent ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 11 (all Fluent all Time (holdsAt(Fluent,Time) & -(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 12 (all Fluent all Time (-(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) & releasedAt(Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 13 (all Agent all Trolley push(Agent,Trolley) != pull(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 14 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> (exists Agent exists Trolley (Event = push(Agent,Trolley) & backwards(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) | spinning(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) & push(Agent,Trolley) = Event | Fluent = spinning(Trolley) & -happens(push(Agent,Trolley),Time) & pull(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & backwards(Trolley) = Fluent & happens(push(Agent,Trolley),Time) | happens(push(Agent,Trolley),Time) & forwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(push(Agent,Trolley),Time))))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 15 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent2 != Agent1 & Trolley1 != Trolley2 -> push(Agent1,Trolley1) != push(Agent2,Trolley2))) # label(push_unique) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 16 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (push(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) | -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & Fluent = spinning(Trolley))))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 17 (all Trolley spinning(Trolley) != forwards(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 18 (all Trolley backwards(Trolley) != spinning(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 19 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent1 != Agent2 & Trolley2 != Trolley1 -> pull(Agent1,Trolley1) != pull(Agent2,Trolley2))) # label(pull_unique) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 20 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 21 (all Trolley backwards(Trolley) != forwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 22 (all Trolley spinning(Trolley) != forwards(Trolley)) # label(forwards_not_spinning) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 23 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 24 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 25 (all Trolley forwards(Trolley) != backwards(Trolley)) # label(forwards_not_backwards) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 26 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption]. 0.32/1.12 27 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 28 (all Trolley backwards(Trolley) != spinning(Trolley)) # label(spinning_not_backwards) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 29 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (Event = push(Agent,Trolley) & forwards(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) | Fluent = backwards(Trolley) & -happens(push(Agent,Trolley),Time) & pull(Agent,Trolley) = Event | pull(Agent,Trolley) = Event & spinning(Trolley) = Fluent & happens(push(Agent,Trolley),Time))))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 30 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 31 (all Event all Fluent all Time ((exists Agent exists Trolley (spinning(Trolley) = Fluent & -happens(pull(Agent,Trolley),Time) & Event = push(Agent,Trolley) | pull(Agent,Trolley) = Event & -happens(push(Agent,Trolley),Time) & spinning(Trolley) = Fluent | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent | Event = pull(Agent,Trolley) & forwards(Trolley) = Fluent & happens(push(Agent,Trolley),Time) | Event = pull(Agent,Trolley) & -happens(push(Agent,Trolley),Time) & Fluent = forwards(Trolley) | -happens(pull(Agent,Trolley),Time) & Fluent = backwards(Trolley) & push(Agent,Trolley) = Event)) <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 32 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 33 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Agent1 != Agent2 & Trolley2 != Trolley1 -> push(Agent1,Trolley1) != push(Agent2,Trolley2))) # label(push_unique) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 34 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 35 (all Agent all Trolley pull(Agent,Trolley) != push(Agent,Trolley)) # label(push_not_pull) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 36 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 37 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 38 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 39 (all Event all Time (push(agent1,trolley1) = Event & n0 = Time | n0 = Time & pull(agent3,trolley3) = Event | push(agent3,trolley3) = Event & n0 = Time | pull(agent4,trolley4) = Event & n0 = Time | Event = pull(agent5,trolley5) & n0 = Time | Event = push(agent5,trolley5) & Time = n0 | n0 = Time & Event = push(agent6,trolley6) | pull(agent7,trolley7) = Event & n0 = Time | Event = pull(agent8,trolley8) & n0 = Time | push(agent8,trolley8) = Event & Time = n0 | Time = n0 & pull(agent9,trolley9) = Event | Event = push(agent9,trolley9) & Time = n0 | Time = n0 & Event = push(agent7,trolley7) | pull(agent6,trolley6) = Event & Time = n0 | Event = push(agent4,trolley4) & n0 = Time | Event = push(agent2,trolley2) & n0 = Time | Time = n0 & Event = pull(agent2,trolley2) | Time = n0 & Event = pull(agent1,trolley1) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 40 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 41 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 42 (all Agent1 all Agent2 all Trolley1 all Trolley2 (Trolley1 != Trolley2 & Agent1 != Agent2 -> pull(Agent1,Trolley1) != pull(Agent2,Trolley2))) # label(pull_unique) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 43 (all X all Y (X = Y | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.32/1.12 44 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.32/1.13 45 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.32/1.13 46 -(holdsAt(spinning(trolley1),n1) & holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley3),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause). [assumption]. 0.32/1.13 0.32/1.13 ============================== end of process non-clausal formulas === 0.32/1.13 0.32/1.13 ============================== PROCESS INITIAL CLAUSES =============== 0.32/1.13 0.32/1.13 ============================== PREDICATE ELIMINATION ================= 0.32/1.13 47 startedIn(A,B,C) | -happens(D,E) | -less(A,E) | -initiates(D,B,E) | -less(E,C) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.32/1.13 48 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.32/1.13 49 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.32/1.13 50 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.32/1.13 51 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.32/1.13 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | happens(f1(C,E,D),f2(C,E,D)). [resolve(47,a,48,a)]. 0.32/1.13 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(C,f2(C,E,D)). [resolve(47,a,49,a)]. 0.32/1.13 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | initiates(f1(C,E,D),D,f2(C,E,D)). [resolve(47,a,50,a)]. 0.32/1.13 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(f2(C,E,D),E). [resolve(47,a,51,a)]. 0.32/1.13 52 -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)) # label(antitrajectory) # label(axiom). [clausify(8)]. 0.32/1.13 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,plus(B,D),C),f2(B,plus(B,D),C)). [resolve(52,e,48,a)]. 0.32/1.13 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,plus(B,D),C)). [resolve(52,e,49,a)]. 0.32/1.13 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | initiates(f1(B,plus(B,D),C),C,f2(B,plus(B,D),C)). [resolve(52,e,50,a)]. 0.32/1.13 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,plus(B,D),C),plus(B,D)). [resolve(52,e,51,a)]. 0.32/1.13 53 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom). [clausify(9)]. 0.32/1.13 54 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(2)]. 0.32/1.13 55 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(20)]. 0.32/1.13 56 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(44)]. 0.32/1.13 Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(56,a,54,a)]. 0.32/1.13 57 stoppedIn(A,B,C) | -happens(D,E) | -less(E,C) | -terminates(D,B,E) | -less(A,E) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.32/1.13 58 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.32/1.13 59 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.32/1.13 60 -stoppedIn(A,B,C) | terminates(f4(A,B,C),B,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.32/1.13 61 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.32/1.13 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | happens(f4(E,D,C),f5(E,D,C)). [resolve(57,a,58,a)]. 0.32/1.13 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(f5(E,D,C),C). [resolve(57,a,59,a)]. 0.32/1.13 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | terminates(f4(E,D,C),D,f5(E,D,C)). [resolve(57,a,60,a)]. 1.40/1.70 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(E,f5(E,D,C)). [resolve(57,a,61,a)]. 1.40/1.70 62 -less(n0,A) | stoppedIn(B,C,plus(B,A)) | -trajectory(C,B,D,A) | -initiates(E,C,B) | -happens(E,B) | holdsAt(D,plus(B,A)) # label(change_holding) # label(axiom). [clausify(4)]. 1.40/1.70 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | happens(f4(C,B,plus(C,A)),f5(C,B,plus(C,A))). [resolve(62,b,58,a)]. 1.40/1.70 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(f5(C,B,plus(C,A)),plus(C,A)). [resolve(62,b,59,a)]. 1.40/1.70 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | terminates(f4(C,B,plus(C,A)),B,f5(C,B,plus(C,A))). [resolve(62,b,60,a)]. 1.40/1.70 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(C,f5(C,B,plus(C,A))). [resolve(62,b,61,a)]. 1.40/1.70 1.40/1.70 ============================== end predicate elimination ============= 1.40/1.70 1.40/1.70 Auto_denials: (non-Horn, no changes). 1.40/1.70 1.40/1.70 Term ordering decisions: 1.40/1.70 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. f6=1. f7=1. f8=1. backwards=1. spinning=1. forwards=1. f1=1. f2=1. f4=1. f5=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. 1.40/1.70 1.40/1.70 ============================== end of process initial clauses ======== 1.40/1.70 1.40/1.70 ============================== CLAUSES FOR SEARCH ==================== 1.40/1.70 1.40/1.70 ============================== end of clauses for search ============= 1.40/1.70 1.40/1.70 ============================== SEARCH ================================ 1.40/1.70 1.40/1.70 % Starting search at 0.05 seconds. 1.40/1.70 1.40/1.70 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 33 (0.00 of 0.11 sec). 1.40/1.70 1.40/1.70 ============================== PROOF ================================= 1.40/1.70 % SZS status Theorem 1.40/1.70 % SZS output start Refutation 1.40/1.70 1.40/1.70 % Proof 1 at 0.58 (+ 0.02) seconds. 1.40/1.70 % Length of proof is 108. 1.40/1.70 % Level of proof is 16. 1.40/1.70 % Maximum clause weight is 36.000. 1.40/1.70 % Given clauses 901. 1.40/1.70 1.40/1.70 6 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 1.40/1.70 16 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Agent exists Trolley (push(Agent,Trolley) = Event & Fluent = forwards(Trolley) & -happens(pull(Agent,Trolley),Time) | -happens(push(Agent,Trolley),Time) & backwards(Trolley) = Fluent & pull(Agent,Trolley) = Event | Event = pull(Agent,Trolley) & happens(push(Agent,Trolley),Time) & Fluent = spinning(Trolley))))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.40/1.70 39 (all Event all Time (push(agent1,trolley1) = Event & n0 = Time | n0 = Time & pull(agent3,trolley3) = Event | push(agent3,trolley3) = Event & n0 = Time | pull(agent4,trolley4) = Event & n0 = Time | Event = pull(agent5,trolley5) & n0 = Time | Event = push(agent5,trolley5) & Time = n0 | n0 = Time & Event = push(agent6,trolley6) | pull(agent7,trolley7) = Event & n0 = Time | Event = pull(agent8,trolley8) & n0 = Time | push(agent8,trolley8) = Event & Time = n0 | Time = n0 & pull(agent9,trolley9) = Event | Event = push(agent9,trolley9) & Time = n0 | Time = n0 & Event = push(agent7,trolley7) | pull(agent6,trolley6) = Event & Time = n0 | Event = push(agent4,trolley4) & n0 = Time | Event = push(agent2,trolley2) & n0 = Time | Time = n0 & Event = pull(agent2,trolley2) | Time = n0 & Event = pull(agent1,trolley1) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.40/1.70 46 -(holdsAt(spinning(trolley1),n1) & holdsAt(spinning(trolley2),n1) & holdsAt(spinning(trolley4),n1) & holdsAt(spinning(trolley5),n1) & holdsAt(spinning(trolley8),n1) & holdsAt(spinning(trolley9),n1) & holdsAt(spinning(trolley7),n1) & holdsAt(spinning(trolley6),n1) & holdsAt(spinning(trolley3),n1)) # label(spinning_3) # label(negated_conjecture) # label(non_clause). [assumption]. 1.40/1.70 66 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(6)]. 1.40/1.70 104 initiates(A,B,C) | pull(D,E) != A | -happens(push(D,E),C) | spinning(E) != B # label(initiates_all_defn) # label(axiom). [clausify(16)]. 1.40/1.70 113 plus(n0,n0) = n0 # label(plus0_0) # label(axiom). [assumption]. 1.40/1.70 140 n1 = plus(n0,n1) # label(plus0_1) # label(axiom). [assumption]. 1.40/1.70 141 plus(n0,n1) = n1. [copy(140),flip(a)]. 1.40/1.70 156 push(agent1,trolley1) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 157 n0 != A | pull(agent3,trolley3) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 158 push(agent3,trolley3) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 159 pull(agent4,trolley4) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 160 pull(agent5,trolley5) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 161 push(agent5,trolley5) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 162 n0 != A | push(agent6,trolley6) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 163 pull(agent7,trolley7) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 164 pull(agent8,trolley8) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 165 push(agent8,trolley8) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 166 n0 != A | pull(agent9,trolley9) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 167 push(agent9,trolley9) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 168 n0 != A | push(agent7,trolley7) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 169 pull(agent6,trolley6) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 170 push(agent4,trolley4) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 171 push(agent2,trolley2) != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 172 n0 != A | pull(agent2,trolley2) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 173 n0 != A | pull(agent1,trolley1) != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(39)]. 1.40/1.70 321 -holdsAt(spinning(trolley1),n1) | -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley3),n1) # label(spinning_3) # label(negated_conjecture). [clausify(46)]. 1.40/1.70 358 n0 != A | happens(push(agent1,trolley1),A). [xx_res(156,a)]. 1.40/1.70 360 pull(agent3,trolley3) != A | happens(A,n0). [resolve(157,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 362 n0 != A | happens(push(agent3,trolley3),A). [xx_res(158,a)]. 1.40/1.70 364 n0 != A | happens(pull(agent4,trolley4),A). [xx_res(159,a)]. 1.40/1.70 366 n0 != A | happens(pull(agent5,trolley5),A). [xx_res(160,a)]. 1.40/1.70 368 n0 != A | happens(push(agent5,trolley5),A). [xx_res(161,a)]. 1.40/1.70 370 push(agent6,trolley6) != A | happens(A,n0). [resolve(162,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 372 n0 != A | happens(pull(agent7,trolley7),A). [xx_res(163,a)]. 1.40/1.70 374 n0 != A | happens(pull(agent8,trolley8),A). [xx_res(164,a)]. 1.40/1.70 376 n0 != A | happens(push(agent8,trolley8),A). [xx_res(165,a)]. 1.40/1.70 378 pull(agent9,trolley9) != A | happens(A,n0). [resolve(166,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 380 n0 != A | happens(push(agent9,trolley9),A). [xx_res(167,a)]. 1.40/1.70 382 push(agent7,trolley7) != A | happens(A,n0). [resolve(168,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 384 n0 != A | happens(pull(agent6,trolley6),A). [xx_res(169,a)]. 1.40/1.70 386 n0 != A | happens(push(agent4,trolley4),A). [xx_res(170,a)]. 1.40/1.70 388 n0 != A | happens(push(agent2,trolley2),A). [xx_res(171,a)]. 1.40/1.70 390 pull(agent2,trolley2) != A | happens(A,n0). [resolve(172,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 392 pull(agent1,trolley1) != A | happens(A,n0). [resolve(173,a,113,a(flip)),rewrite([113(7)])]. 1.40/1.70 585 happens(push(agent1,trolley1),n0). [resolve(358,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 600 happens(pull(agent3,trolley3),n0). [xx_res(360,a)]. 1.40/1.70 603 initiates(A,B,n0) | pull(agent1,trolley1) != A | spinning(trolley1) != B. [resolve(585,a,104,c)]. 1.40/1.70 606 happens(push(agent3,trolley3),n0). [resolve(362,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 607 initiates(A,B,n0) | pull(agent3,trolley3) != A | spinning(trolley3) != B. [resolve(606,a,104,c)]. 1.40/1.70 610 happens(pull(agent4,trolley4),n0). [resolve(364,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 611 happens(pull(agent5,trolley5),n0). [resolve(366,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 612 happens(push(agent5,trolley5),n0). [resolve(368,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 613 initiates(A,B,n0) | pull(agent5,trolley5) != A | spinning(trolley5) != B. [resolve(612,a,104,c)]. 1.40/1.70 616 happens(push(agent6,trolley6),n0). [xx_res(370,a)]. 1.40/1.70 617 initiates(A,B,n0) | pull(agent6,trolley6) != A | spinning(trolley6) != B. [resolve(616,a,104,c)]. 1.40/1.70 620 happens(pull(agent7,trolley7),n0). [resolve(372,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 621 happens(pull(agent8,trolley8),n0). [resolve(374,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 622 happens(push(agent8,trolley8),n0). [resolve(376,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 623 initiates(A,B,n0) | pull(agent8,trolley8) != A | spinning(trolley8) != B. [resolve(622,a,104,c)]. 1.40/1.70 626 happens(pull(agent9,trolley9),n0). [xx_res(378,a)]. 1.40/1.70 627 happens(push(agent9,trolley9),n0). [resolve(380,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 628 initiates(A,B,n0) | pull(agent9,trolley9) != A | spinning(trolley9) != B. [resolve(627,a,104,c)]. 1.40/1.70 631 happens(push(agent7,trolley7),n0). [xx_res(382,a)]. 1.40/1.70 632 initiates(A,B,n0) | pull(agent7,trolley7) != A | spinning(trolley7) != B. [resolve(631,a,104,c)]. 1.40/1.70 635 happens(pull(agent6,trolley6),n0). [resolve(384,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 636 happens(push(agent4,trolley4),n0). [resolve(386,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 637 initiates(A,B,n0) | pull(agent4,trolley4) != A | spinning(trolley4) != B. [resolve(636,a,104,c)]. 1.40/1.70 640 happens(push(agent2,trolley2),n0). [resolve(388,a,113,a(flip)),rewrite([113(6)])]. 1.40/1.70 641 initiates(A,B,n0) | pull(agent2,trolley2) != A | spinning(trolley2) != B. [resolve(640,a,104,c)]. 1.40/1.70 644 happens(pull(agent2,trolley2),n0). [xx_res(390,a)]. 1.40/1.70 645 happens(pull(agent1,trolley1),n0). [xx_res(392,a)]. 1.40/1.70 921 initiates(pull(agent1,trolley1),A,n0) | spinning(trolley1) != A. [xx_res(603,b)]. 1.40/1.70 933 initiates(pull(agent3,trolley3),A,n0) | spinning(trolley3) != A. [xx_res(607,b)]. 1.40/1.70 942 initiates(pull(agent5,trolley5),A,n0) | spinning(trolley5) != A. [xx_res(613,b)]. 1.40/1.70 997 initiates(pull(agent6,trolley6),A,n0) | spinning(trolley6) != A. [xx_res(617,b)]. 1.40/1.70 1008 initiates(pull(agent8,trolley8),A,n0) | spinning(trolley8) != A. [xx_res(623,b)]. 1.40/1.70 1016 initiates(pull(agent9,trolley9),A,n0) | spinning(trolley9) != A. [xx_res(628,b)]. 1.40/1.70 1067 initiates(pull(agent7,trolley7),A,n0) | spinning(trolley7) != A. [xx_res(632,b)]. 1.40/1.70 1075 initiates(pull(agent4,trolley4),A,n0) | spinning(trolley4) != A. [xx_res(637,b)]. 1.40/1.70 1091 initiates(pull(agent2,trolley2),A,n0) | spinning(trolley2) != A. [xx_res(641,b)]. 1.40/1.70 2229 initiates(pull(agent1,trolley1),spinning(trolley1),n0). [xx_res(921,b)]. 1.40/1.70 2258 holdsAt(spinning(trolley1),n1). [resolve(2229,a,66,a),rewrite([141(10)]),unit_del(a,645)]. 1.40/1.70 2259 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1) | -holdsAt(spinning(trolley3),n1). [back_unit_del(321),unit_del(a,2258)]. 1.40/1.70 2331 initiates(pull(agent3,trolley3),spinning(trolley3),n0). [xx_res(933,b)]. 1.40/1.70 2361 holdsAt(spinning(trolley3),n1). [resolve(2331,a,66,a),rewrite([141(10)]),unit_del(a,600)]. 1.40/1.70 2362 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley5),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1). [back_unit_del(2259),unit_del(h,2361)]. 1.40/1.70 2434 initiates(pull(agent5,trolley5),spinning(trolley5),n0). [xx_res(942,b)]. 1.40/1.70 2462 holdsAt(spinning(trolley5),n1). [resolve(2434,a,66,a),rewrite([141(10)]),unit_del(a,611)]. 1.40/1.70 2463 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1) | -holdsAt(spinning(trolley6),n1). [back_unit_del(2362),unit_del(c,2462)]. 1.40/1.70 2545 initiates(pull(agent6,trolley6),spinning(trolley6),n0). [xx_res(997,b)]. 1.40/1.70 2578 holdsAt(spinning(trolley6),n1). [resolve(2545,a,66,a),rewrite([141(10)]),unit_del(a,635)]. 1.40/1.70 2579 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley8),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1). [back_unit_del(2463),unit_del(f,2578)]. 1.40/1.70 2649 initiates(pull(agent8,trolley8),spinning(trolley8),n0). [xx_res(1008,b)]. 1.40/1.70 2676 holdsAt(spinning(trolley8),n1). [resolve(2649,a,66,a),rewrite([141(10)]),unit_del(a,621)]. 1.40/1.70 2677 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley9),n1) | -holdsAt(spinning(trolley7),n1). [back_unit_del(2579),unit_del(c,2676)]. 1.40/1.70 3005 initiates(pull(agent9,trolley9),spinning(trolley9),n0). [xx_res(1016,b)]. 1.40/1.70 3292 holdsAt(spinning(trolley9),n1). [resolve(3005,a,66,a),rewrite([141(10)]),unit_del(a,626)]. 1.40/1.70 3293 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1) | -holdsAt(spinning(trolley7),n1). [back_unit_del(2677),unit_del(c,3292)]. 1.40/1.70 3883 initiates(pull(agent7,trolley7),spinning(trolley7),n0). [xx_res(1067,b)]. 1.40/1.70 3908 holdsAt(spinning(trolley7),n1). [resolve(3883,a,66,a),rewrite([141(10)]),unit_del(a,620)]. 1.40/1.70 3909 -holdsAt(spinning(trolley2),n1) | -holdsAt(spinning(trolley4),n1). [back_unit_del(3293),unit_del(c,3908)]. 1.40/1.70 3990 initiates(pull(agent4,trolley4),spinning(trolley4),n0). [xx_res(1075,b)]. 1.40/1.70 4022 holdsAt(spinning(trolley4),n1). [resolve(3990,a,66,a),rewrite([141(10)]),unit_del(a,610)]. 1.40/1.70 4023 -holdsAt(spinning(trolley2),n1). [back_unit_del(3909),unit_del(b,4022)]. 1.40/1.70 4103 initiates(pull(agent2,trolley2),spinning(trolley2),n0). [xx_res(1091,b)]. 1.40/1.70 4136 $F. [resolve(4103,a,66,a),rewrite([141(10)]),unit_del(a,644),unit_del(b,4023)]. 1.40/1.70 1.40/1.70 % SZS output end Refutation 1.40/1.70 ============================== end of proof ========================== 1.40/1.70 1.40/1.70 ============================== STATISTICS ============================ 1.40/1.70 1.40/1.70 Given=901. Generated=10491. Kept=4036. proofs=1. 1.40/1.70 Usable=893. Sos=3089. Demods=11. Limbo=24, Disabled=301. Hints=0. 1.40/1.70 Megabytes=8.81. 1.40/1.70 User_CPU=0.58, System_CPU=0.02, Wall_clock=0. 1.40/1.70 1.40/1.70 ============================== end of statistics ===================== 1.40/1.70 1.40/1.70 ============================== end of search ========================= 1.40/1.70 1.40/1.70 THEOREM PROVED 1.40/1.70 % SZS status Theorem 1.40/1.70 1.40/1.70 Exiting with 1 proof. 1.40/1.70 1.40/1.70 Process 12417 exit (max_proofs) Tue Aug 9 04:35:21 2022 1.40/1.70 Prover9 interrupted 1.40/1.70 EOF