TSTP Solution File: PLA024+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA024+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 17:31:25 EDT 2022
% Result : Unknown 20.51s 20.85s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PLA024+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 23:13:28 EDT 2022
% 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 1444 was started by sandbox2 on n025.cluster.edu,
% 0.73/1.02 Tue May 31 23:13:29 2022
% 0.73/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1290_n025.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_1290_n025.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 (53 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, 300).
% 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 I all X (nonfixed(X) -> (all Z (a_block(Z) & neq(X,Z) -> (time(I) & object(X,I) & destination(Z,I) -> on(X,Z,s(I))))))) # label(place_object_block_on_destination) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 2 (all I all X (nonfixed(X) -> (all Y (a_block(Y) & neq(X,Y) -> (time(I) & object(X,I) & source(Y,I) -> -on(X,Y,s(I))))))) # label(remove_object_block_from_source) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 3 (all I all Y (nonfixed(Y) -> (time(I) & source(Y,I) -> clear(Y,s(I))))) # label(clear_source_after_removal) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 4 (all I all Z (nonfixed(Z) -> (time(I) & destination(Z,I) -> -clear(Z,s(I))))) # label(not_clear_destination_after_placement) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 5 (all I all X (nonfixed(X) -> (all Y (a_block(Y) & neq(X,Y) -> (object(X,I) & source(Y,I) -> on(X,Y,I)))))) # label(object_block_on_source) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 6 (all I all X (nonfixed(X) -> (object(X,I) -> clear(X,I)))) # label(object_block_is_clear) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 7 (all I all Z (nonfixed(Z) -> (destination(Z,I) -> clear(Z,I)))) # label(destination_block_is_clear) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 8 (all I all W (nonfixed(W) -> (time(I) & -destination(W,I) & clear(W,I) -> clear(W,s(I))))) # label(non_destination_remains_clear) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 9 (all I all V (nonfixed(V) -> (all W (a_block(W) & neq(V,W) -> (time(I) & -object(V,I) & on(V,W,I) -> on(V,W,s(I))))))) # label(non_object_remains_on) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 10 (all I all W (nonfixed(W) -> (time(I) & -source(W,I) & -clear(W,I) -> -clear(W,s(I))))) # label(non_source_remains_not_clear) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 11 (all I all V (nonfixed(V) -> (all W (a_block(W) & neq(V,W) -> (time(I) & -object(V,I) & -on(V,W,I) -> -on(V,W,s(I))))))) # label(non_object_remains_not_on) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 12 (all I all V (nonfixed(V) -> (all W (a_block(W) & neq(V,W) -> (time(I) & -destination(W,I) & -on(V,W,I) -> -on(V,W,s(I))))))) # label(non_destination_remains_not_on) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 13 (all I all X1 (nonfixed(X1) -> (all X2 (a_block(X2) & neq(X1,X2) -> -(object(X1,I) & object(X2,I)))))) # label(only_one_object_block) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 14 (all I all Y1 (a_block(Y1) -> (all Y2 (a_block(Y2) & neq(Y1,Y2) -> -(source(Y1,I) & source(Y2,I)))))) # label(only_one_source_block) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 15 (all I all Z1 (a_block(Z1) -> (all Z2 (a_block(Z2) & neq(Z1,Z2) -> -(destination(Z1,I) & destination(Z2,I)))))) # label(only_one_destination_block) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 16 (all I all X (nonfixed(X) -> -(object(X,I) & source(X,I)))) # label(object_is_not_source) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 17 (all I all X (nonfixed(X) -> -(object(X,I) & destination(X,I)))) # label(object_is_not_destination) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 18 (all I all Y (a_block(Y) -> -(source(Y,I) & destination(Y,I)))) # label(source_is_not_destination) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 19 (all I all X (a_block(X) -> (all Y (a_block(Y) & neq(X,Y) -> -(on(X,Y,I) & on(Y,X,I)))))) # label(not_on_each_other) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 20 (all I all X (a_block(X) -> -on(X,X,I))) # label(not_on_self) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 21 (all I all X (nonfixed(X) -> (all Y (nonfixed(Y) & neq(X,Y) -> (all Z (nonfixed(Z) & neq(X,Z) & neq(Y,Z) -> -(on(X,Y,I) & on(Z,Y,I)))))))) # label(only_one_on) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 22 (all I all X (nonfixed(X) -> (all Y (a_block(Y) & neq(X,Y) -> (all Z (a_block(Z) & neq(X,Z) & neq(Y,Z) -> -(on(X,Y,I) & on(X,Z,I)))))))) # label(only_on_one_thing) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 23 (all I all X (nonfixed(X) -> (all Y (nonfixed(Y) -> -(on(X,Y,I) & clear(Y,I)))))) # label(not_clear_if_something_on) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 24 (all I all X (a_block(X) -> (all Y (fixed(Y) -> -on(Y,X,I))))) # label(fixed_not_on_anything) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.02 25 (all Y all X (different(X,Y) | different(Y,X) -> neq(X,Y))) # label(different_not_equal) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.02 26 (all I (time(I) -> source(block_1,I) | source(block_2,I) | source(block_3,I) | source(table,I))) # label(some_source) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.02 27 (all I (time(I) -> destination(block_1,I) | destination(block_2,I) | destination(block_3,I) | destination(table,I))) # label(some_destination) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.02 28 (all I (time(I) -> object(block_1,I) | object(block_2,I) | object(block_3,I))) # label(some_object) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.02 29 -(all S (goal_time(S) -> on(block_2,block_3,S) & clear(block_2,S) & on(block_3,block_1,S) & on(block_1,table,S))) # label(goal_state) # label(negated_conjecture) # 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.02 30 -a_block(A) | -fixed(B) | -on(B,A,C) # label(fixed_not_on_anything) # label(axiom). [clausify(24)].
% 0.73/1.02 31 fixed(table) # label(fixed_table) # label(hypothesis). [assumption].
% 0.73/1.02 Derived: -a_block(A) | -on(table,A,B). [resolve(30,b,31,a)].
% 0.73/1.02 32 -nonfixed(A) | -time(B) | -destination(A,B) | -clear(A,s(B)) # label(not_clear_destination_after_placement) # label(axiom). [clausify(4)].
% 0.73/1.02 33 time(time_0) # label(time_0) # label(hypothesis). [assumption].
% 0.73/1.02 34 time(s(time_0)) # label(time_1) # label(hypothesis). [assumption].
% 0.73/1.02 35 time(s(s(time_0))) # label(time_2) # label(hypothesis). [assumption].
% 0.73/1.02 36 time(s(s(s(time_0)))) # label(time_3) # label(hypothesis). [assumption].
% 0.73/1.02 Derived: -nonfixed(A) | -destination(A,time_0) | -clear(A,s(time_0)). [resolve(32,b,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -destination(A,s(time_0)) | -clear(A,s(s(time_0))). [resolve(32,b,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -destination(A,s(s(time_0))) | -clear(A,s(s(s(time_0)))). [resolve(32,b,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -destination(A,s(s(s(time_0)))) | -clear(A,s(s(s(s(time_0))))). [resolve(32,b,36,a)].
% 0.73/1.02 37 -nonfixed(A) | -a_block(B) | -neq(A,B) | -time(C) | -object(A,C) | -source(B,C) | -on(A,B,s(C)) # label(remove_object_block_from_source) # label(axiom). [clausify(2)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,time_0) | -source(B,time_0) | -on(A,B,s(time_0)). [resolve(37,d,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(time_0)) | -source(B,s(time_0)) | -on(A,B,s(s(time_0))). [resolve(37,d,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(s(time_0))) | -source(B,s(s(time_0))) | -on(A,B,s(s(s(time_0)))). [resolve(37,d,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(s(s(time_0)))) | -source(B,s(s(s(time_0)))) | -on(A,B,s(s(s(s(time_0))))). [resolve(37,d,36,a)].
% 0.73/1.02 38 -nonfixed(A) | -time(B) | -source(A,B) | clear(A,s(B)) # label(clear_source_after_removal) # label(axiom). [clausify(3)].
% 0.73/1.02 Derived: -nonfixed(A) | -source(A,time_0) | clear(A,s(time_0)). [resolve(38,b,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -source(A,s(time_0)) | clear(A,s(s(time_0))). [resolve(38,b,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -source(A,s(s(time_0))) | clear(A,s(s(s(time_0)))). [resolve(38,b,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -source(A,s(s(s(time_0)))) | clear(A,s(s(s(s(time_0))))). [resolve(38,b,36,a)].
% 0.73/1.02 39 -time(A) | object(block_1,A) | object(block_2,A) | object(block_3,A) # label(some_object) # label(hypothesis). [clausify(28)].
% 0.73/1.02 Derived: object(block_1,time_0) | object(block_2,time_0) | object(block_3,time_0). [resolve(39,a,33,a)].
% 0.73/1.02 Derived: object(block_1,s(time_0)) | object(block_2,s(time_0)) | object(block_3,s(time_0)). [resolve(39,a,34,a)].
% 0.73/1.02 Derived: object(block_1,s(s(time_0))) | object(block_2,s(s(time_0))) | object(block_3,s(s(time_0))). [resolve(39,a,35,a)].
% 0.73/1.02 Derived: object(block_1,s(s(s(time_0)))) | object(block_2,s(s(s(time_0)))) | object(block_3,s(s(s(time_0)))). [resolve(39,a,36,a)].
% 0.73/1.02 40 -nonfixed(A) | -time(B) | destination(A,B) | -clear(A,B) | clear(A,s(B)) # label(non_destination_remains_clear) # label(axiom). [clausify(8)].
% 0.73/1.02 Derived: -nonfixed(A) | destination(A,time_0) | -clear(A,time_0) | clear(A,s(time_0)). [resolve(40,b,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | destination(A,s(time_0)) | -clear(A,s(time_0)) | clear(A,s(s(time_0))). [resolve(40,b,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | destination(A,s(s(time_0))) | -clear(A,s(s(time_0))) | clear(A,s(s(s(time_0)))). [resolve(40,b,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | destination(A,s(s(s(time_0)))) | -clear(A,s(s(s(time_0)))) | clear(A,s(s(s(s(time_0))))). [resolve(40,b,36,a)].
% 0.73/1.02 41 -nonfixed(A) | -time(B) | source(A,B) | clear(A,B) | -clear(A,s(B)) # label(non_source_remains_not_clear) # label(axiom). [clausify(10)].
% 0.73/1.02 Derived: -nonfixed(A) | source(A,time_0) | clear(A,time_0) | -clear(A,s(time_0)). [resolve(41,b,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | source(A,s(time_0)) | clear(A,s(time_0)) | -clear(A,s(s(time_0))). [resolve(41,b,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | source(A,s(s(time_0))) | clear(A,s(s(time_0))) | -clear(A,s(s(s(time_0)))). [resolve(41,b,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | source(A,s(s(s(time_0)))) | clear(A,s(s(s(time_0)))) | -clear(A,s(s(s(s(time_0))))). [resolve(41,b,36,a)].
% 0.73/1.02 42 -time(A) | source(block_1,A) | source(block_2,A) | source(block_3,A) | source(table,A) # label(some_source) # label(hypothesis). [clausify(26)].
% 0.73/1.02 Derived: source(block_1,time_0) | source(block_2,time_0) | source(block_3,time_0) | source(table,time_0). [resolve(42,a,33,a)].
% 0.73/1.02 Derived: source(block_1,s(time_0)) | source(block_2,s(time_0)) | source(block_3,s(time_0)) | source(table,s(time_0)). [resolve(42,a,34,a)].
% 0.73/1.02 Derived: source(block_1,s(s(time_0))) | source(block_2,s(s(time_0))) | source(block_3,s(s(time_0))) | source(table,s(s(time_0))). [resolve(42,a,35,a)].
% 0.73/1.02 Derived: source(block_1,s(s(s(time_0)))) | source(block_2,s(s(s(time_0)))) | source(block_3,s(s(s(time_0)))) | source(table,s(s(s(time_0)))). [resolve(42,a,36,a)].
% 0.73/1.02 43 -time(A) | destination(block_1,A) | destination(block_2,A) | destination(block_3,A) | destination(table,A) # label(some_destination) # label(hypothesis). [clausify(27)].
% 0.73/1.02 Derived: destination(block_1,time_0) | destination(block_2,time_0) | destination(block_3,time_0) | destination(table,time_0). [resolve(43,a,33,a)].
% 0.73/1.02 Derived: destination(block_1,s(time_0)) | destination(block_2,s(time_0)) | destination(block_3,s(time_0)) | destination(table,s(time_0)). [resolve(43,a,34,a)].
% 0.73/1.02 Derived: destination(block_1,s(s(time_0))) | destination(block_2,s(s(time_0))) | destination(block_3,s(s(time_0))) | destination(table,s(s(time_0))). [resolve(43,a,35,a)].
% 0.73/1.02 Derived: destination(block_1,s(s(s(time_0)))) | destination(block_2,s(s(s(time_0)))) | destination(block_3,s(s(s(time_0)))) | destination(table,s(s(s(time_0)))). [resolve(43,a,36,a)].
% 0.73/1.02 44 -nonfixed(A) | -a_block(B) | -neq(A,B) | -time(C) | -object(A,C) | -destination(B,C) | on(A,B,s(C)) # label(place_object_block_on_destination) # label(axiom). [clausify(1)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,time_0) | -destination(B,time_0) | on(A,B,s(time_0)). [resolve(44,d,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(time_0)) | -destination(B,s(time_0)) | on(A,B,s(s(time_0))). [resolve(44,d,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(s(time_0))) | -destination(B,s(s(time_0))) | on(A,B,s(s(s(time_0)))). [resolve(44,d,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | -object(A,s(s(s(time_0)))) | -destination(B,s(s(s(time_0)))) | on(A,B,s(s(s(s(time_0))))). [resolve(44,d,36,a)].
% 0.73/1.02 45 -nonfixed(A) | -a_block(B) | -neq(A,B) | -time(C) | object(A,C) | -on(A,B,C) | on(A,B,s(C)) # label(non_object_remains_on) # label(axiom). [clausify(9)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,time_0) | -on(A,B,time_0) | on(A,B,s(time_0)). [resolve(45,d,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(time_0)) | -on(A,B,s(time_0)) | on(A,B,s(s(time_0))). [resolve(45,d,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(s(time_0))) | -on(A,B,s(s(time_0))) | on(A,B,s(s(s(time_0)))). [resolve(45,d,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(s(s(time_0)))) | -on(A,B,s(s(s(time_0)))) | on(A,B,s(s(s(s(time_0))))). [resolve(45,d,36,a)].
% 0.73/1.02 46 -nonfixed(A) | -a_block(B) | -neq(A,B) | -time(C) | object(A,C) | on(A,B,C) | -on(A,B,s(C)) # label(non_object_remains_not_on) # label(axiom). [clausify(11)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,time_0) | on(A,B,time_0) | -on(A,B,s(time_0)). [resolve(46,d,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(time_0)) | on(A,B,s(time_0)) | -on(A,B,s(s(time_0))). [resolve(46,d,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(s(time_0))) | on(A,B,s(s(time_0))) | -on(A,B,s(s(s(time_0)))). [resolve(46,d,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | object(A,s(s(s(time_0)))) | on(A,B,s(s(s(time_0)))) | -on(A,B,s(s(s(s(time_0))))). [resolve(46,d,36,a)].
% 0.73/1.02 47 -nonfixed(A) | -a_block(B) | -neq(A,B) | -time(C) | destination(B,C) | on(A,B,C) | -on(A,B,s(C)) # label(non_destination_remains_not_on) # label(axiom). [clausify(12)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | destination(B,time_0) | on(A,B,time_0) | -on(A,B,s(time_0)). [resolve(47,d,33,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | destination(B,s(time_0)) | on(A,B,s(time_0)) | -on(A,B,s(s(time_0))). [resolve(47,d,34,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | destination(B,s(s(time_0))) | on(A,B,s(s(time_0))) | -on(A,B,s(s(s(time_0)))). [resolve(47,d,35,a)].
% 0.73/1.02 Derived: -nonfixed(A) | -a_block(B) | -neq(A,B) | destination(B,s(s(s(time_0)))) | on(A,B,s(s(s(time_0)))) | -on(A,B,s(s(s(s(time_0))))). [resolve(47,d,36,a)].
% 0.73/1.02 48 -different(A,B) | neq(A,B) # label(different_not_equal) # label(hypothesis). [clausify(25)].
% 20.51/20.85 49 different(block_1,block_2) # label(block_1_not_block_2) # label(hypothesis). [assumption].
% 20.51/20.85 50 different(block_1,block_3) # label(block_1_not_block_3) # label(hypothesis). [assumption].
% 20.51/20.85 51 different(block_2,block_3) # label(block_2_not_block_3) # label(hypothesis). [assumption].
% 20.51/20.85 52 different(block_1,table) # label(block_1_not_table) # label(hypothesis). [assumption].
% 20.51/20.85 53 different(block_2,table) # label(block_2_not_table) # label(hypothesis). [assumption].
% 20.51/20.85 54 different(block_3,table) # label(block_3_not_table) # label(hypothesis). [assumption].
% 20.51/20.85 Derived: neq(block_1,block_2). [resolve(48,a,49,a)].
% 20.51/20.85 Derived: neq(block_1,block_3). [resolve(48,a,50,a)].
% 20.51/20.85 Derived: neq(block_2,block_3). [resolve(48,a,51,a)].
% 20.51/20.85 Derived: neq(block_1,table). [resolve(48,a,52,a)].
% 20.51/20.85 Derived: neq(block_2,table). [resolve(48,a,53,a)].
% 20.51/20.85 Derived: neq(block_3,table). [resolve(48,a,54,a)].
% 20.51/20.85 55 -different(A,B) | neq(B,A) # label(different_not_equal) # label(hypothesis). [clausify(25)].
% 20.51/20.85 Derived: neq(block_2,block_1). [resolve(55,a,49,a)].
% 20.51/20.85 Derived: neq(block_3,block_1). [resolve(55,a,50,a)].
% 20.51/20.85 Derived: neq(block_3,block_2). [resolve(55,a,51,a)].
% 20.51/20.85 Derived: neq(table,block_1). [resolve(55,a,52,a)].
% 20.51/20.85 Derived: neq(table,block_2). [resolve(55,a,53,a)].
% 20.51/20.85 Derived: neq(table,block_3). [resolve(55,a,54,a)].
% 20.51/20.85
% 20.51/20.85 ============================== end predicate elimination =============
% 20.51/20.85
% 20.51/20.85 Auto_denials: (non-Horn, no changes).
% 20.51/20.85
% 20.51/20.85 Term ordering decisions:
% 20.51/20.85
% 20.51/20.85 % Assigning unary symbol s kb_weight 0 and highest precedence (15).
% 20.51/20.85 Function symbol KB weights: time_0=1. block_1=1. block_2=1. block_3=1. table=1. c1=1. s=0.
% 20.51/20.85
% 20.51/20.85 ============================== end of process initial clauses ========
% 20.51/20.85
% 20.51/20.85 ============================== CLAUSES FOR SEARCH ====================
% 20.51/20.85
% 20.51/20.85 ============================== end of clauses for search =============
% 20.51/20.85
% 20.51/20.85 ============================== SEARCH ================================
% 20.51/20.85
% 20.51/20.85 % Starting search at 0.03 seconds.
% 20.51/20.85
% 20.51/20.85 ============================== STATISTICS ============================
% 20.51/20.85
% 20.51/20.85 Given=13037. Generated=507489. Kept=17160. proofs=0.
% 20.51/20.85 Usable=5199. Sos=0. Demods=0. Limbo=0, Disabled=12077. Hints=0.
% 20.51/20.85 Megabytes=30.51.
% 20.51/20.85 User_CPU=19.55, System_CPU=0.30, Wall_clock=20.
% 20.51/20.85
% 20.51/20.85 ============================== end of statistics =====================
% 20.51/20.85
% 20.51/20.85 ============================== end of search =========================
% 20.51/20.85
% 20.51/20.85 SEARCH FAILED
% 20.51/20.85
% 20.51/20.85 Exiting with failure.
% 20.51/20.85
% 20.51/20.85 Process 1444 exit (sos_empty) Tue May 31 23:13:49 2022
% 20.51/20.85 Prover9 interrupted
%------------------------------------------------------------------------------