0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.31 % Computer : n013.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Aug 9 02:12:30 EDT 2022 0.10/0.31 % CPUTime : 0.74/1.06 ============================== Prover9 =============================== 0.74/1.06 Prover9 (32) version 2009-11A, November 2009. 0.74/1.06 Process 7660 was started by sandbox2 on n013.cluster.edu, 0.74/1.06 Tue Aug 9 02:12:31 2022 0.74/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7501_n013.cluster.edu". 0.74/1.06 ============================== end of head =========================== 0.74/1.06 0.74/1.06 ============================== INPUT ================================= 0.74/1.06 0.74/1.06 % Reading from file /tmp/Prover9_7501_n013.cluster.edu 0.74/1.06 0.74/1.06 set(prolog_style_variables). 0.74/1.06 set(auto2). 0.74/1.06 % set(auto2) -> set(auto). 0.74/1.06 % set(auto) -> set(auto_inference). 0.74/1.06 % set(auto) -> set(auto_setup). 0.74/1.06 % set(auto_setup) -> set(predicate_elim). 0.74/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.74/1.06 % set(auto) -> set(auto_limits). 0.74/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.74/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.74/1.06 % set(auto) -> set(auto_denials). 0.74/1.06 % set(auto) -> set(auto_process). 0.74/1.06 % set(auto2) -> assign(new_constants, 1). 0.74/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.74/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.74/1.06 % set(auto2) -> assign(max_hours, 1). 0.74/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.74/1.06 % set(auto2) -> assign(max_seconds, 0). 0.74/1.06 % set(auto2) -> assign(max_minutes, 5). 0.74/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.74/1.06 % set(auto2) -> set(sort_initial_sos). 0.74/1.06 % set(auto2) -> assign(sos_limit, -1). 0.74/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.74/1.06 % set(auto2) -> assign(max_megs, 400). 0.74/1.06 % set(auto2) -> assign(stats, some). 0.74/1.06 % set(auto2) -> clear(echo_input). 0.74/1.06 % set(auto2) -> set(quiet). 0.74/1.06 % set(auto2) -> clear(print_initial_clauses). 0.74/1.06 % set(auto2) -> clear(print_given). 0.74/1.06 assign(lrs_ticks,-1). 0.74/1.06 assign(sos_limit,10000). 0.74/1.06 assign(order,kbo). 0.74/1.06 set(lex_order_vars). 0.74/1.06 clear(print_given). 0.74/1.06 0.74/1.06 % formulas(sos). % not echoed (48 formulas) 0.74/1.06 0.74/1.06 ============================== end of input ========================== 0.74/1.06 0.74/1.06 % From the command line: assign(max_seconds, 960). 0.74/1.06 0.74/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.74/1.06 0.74/1.06 % Formulas that are not ordinary clauses: 0.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 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.74/1.06 13 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> pull = Event & happens(push,Time) & Fluent = spinning | Event = pull & -happens(push,Time) & backwards = Fluent | Event = push & forwards = Fluent & -happens(pull,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 14 (all Event all Fluent all Time (-happens(push,Time) & forwards = Fluent & Event = pull | Fluent = forwards & happens(push,Time) & pull = Event | pull = Event & happens(push,Time) & Fluent = backwards | Event = push & Fluent = spinning & -happens(pull,Time) | Event = pull & -happens(push,Time) & spinning = Fluent | Fluent = backwards & -happens(pull,Time) & push = Event <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 15 (all Event all Time (n2 = Time & pull = Event | n2 = Time & Event = push | pull = Event & Time = n1 | Time = n0 & push = Event <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 16 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 17 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 18 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption]. 0.74/1.06 19 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 20 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 21 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 22 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 23 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 24 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 25 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 26 (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.74/1.06 27 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 28 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 29 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 30 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.74/1.06 31 --holdsAt(spinning,n1) # label(not_spinning_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.74/1.06 0.74/1.06 ============================== end of process non-clausal formulas === 0.74/1.07 0.74/1.07 ============================== PROCESS INITIAL CLAUSES =============== 0.74/1.07 0.74/1.07 ============================== PREDICATE ELIMINATION ================= 0.74/1.07 32 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.74/1.07 33 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.74/1.07 34 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.74/1.07 35 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.74/1.07 36 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.74/1.07 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | happens(f1(C,E,D),f2(C,E,D)). [resolve(32,a,33,a)]. 0.74/1.07 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(C,f2(C,E,D)). [resolve(32,a,34,a)]. 0.74/1.07 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(32,a,35,a)]. 0.74/1.07 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(f2(C,E,D),E). [resolve(32,a,36,a)]. 0.74/1.07 37 -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.74/1.07 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(37,e,33,a)]. 0.74/1.07 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(37,e,34,a)]. 0.74/1.07 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(37,e,35,a)]. 0.74/1.07 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(37,e,36,a)]. 0.74/1.07 38 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom). [clausify(9)]. 0.74/1.07 39 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(2)]. 0.74/1.07 40 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(16)]. 0.74/1.07 41 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.74/1.07 42 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.74/1.07 43 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.74/1.07 44 -stoppedIn(A,B,C) | terminates(f4(A,B,C),B,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.74/1.07 45 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.74/1.07 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | happens(f4(E,D,C),f5(E,D,C)). [resolve(41,a,42,a)]. 0.74/1.07 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(f5(E,D,C),C). [resolve(41,a,43,a)]. 0.74/1.07 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(41,a,44,a)]. 0.74/1.07 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(E,f5(E,D,C)). [resolve(41,a,45,a)]. 0.74/1.07 46 -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)]. 0.74/1.07 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(46,b,42,a)]. 0.74/1.07 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(46,b,43,a)]. 0.74/1.07 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))). [reAlarm clock 119.52/120.03 Prover9 interrupted 119.52/120.03 EOF