TSTP Solution File: PLA029+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA029+2 : TPTP v8.1.0. Released 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 0.68s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PLA029+2 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue May 31 18:18:43 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.68/0.99 ============================== Prover9 ===============================
% 0.68/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99 Process 17946 was started by sandbox on n025.cluster.edu,
% 0.68/0.99 Tue May 31 18:18:44 2022
% 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17792_n025.cluster.edu".
% 0.68/0.99 ============================== end of head ===========================
% 0.68/0.99
% 0.68/0.99 ============================== INPUT =================================
% 0.68/0.99
% 0.68/0.99 % Reading from file /tmp/Prover9_17792_n025.cluster.edu
% 0.68/0.99
% 0.68/0.99 set(prolog_style_variables).
% 0.68/0.99 set(auto2).
% 0.68/0.99 % set(auto2) -> set(auto).
% 0.68/0.99 % set(auto) -> set(auto_inference).
% 0.68/0.99 % set(auto) -> set(auto_setup).
% 0.68/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99 % set(auto) -> set(auto_limits).
% 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99 % set(auto) -> set(auto_denials).
% 0.68/0.99 % set(auto) -> set(auto_process).
% 0.68/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99 % set(auto2) -> assign(stats, some).
% 0.68/0.99 % set(auto2) -> clear(echo_input).
% 0.68/0.99 % set(auto2) -> set(quiet).
% 0.68/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99 % set(auto2) -> clear(print_given).
% 0.68/0.99 assign(lrs_ticks,-1).
% 0.68/0.99 assign(sos_limit,10000).
% 0.68/0.99 assign(order,kbo).
% 0.68/0.99 set(lex_order_vars).
% 0.68/0.99 clear(print_given).
% 0.68/0.99
% 0.68/0.99 % formulas(sos). % not echoed (24 formulas)
% 0.68/0.99
% 0.68/0.99 ============================== end of input ==========================
% 0.68/0.99
% 0.68/0.99 % From the command line: assign(max_seconds, 300).
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99
% 0.68/0.99 % Formulas that are not ordinary clauses:
% 0.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 20 (all I all X (a_block(X) -> -on(X,X,I))) # label(not_on_self) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99 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.68/0.99
% 0.68/0.99 ============================== end of process non-clausal formulas ===
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.99
% 0.68/0.99 ============================== PREDICATE ELIMINATION =================
% 0.68/0.99 25 -nonfixed(A) | -object(A,B) | clear(A,B) # label(object_block_is_clear) # label(axiom). [clausify(6)].
% 0.68/0.99 26 -nonfixed(A) | -nonfixed(B) | -on(A,B,C) | -clear(B,C) # label(not_clear_if_something_on) # label(axiom). [clausify(23)].
% 0.68/0.99 Derived: -nonfixed(A) | -object(A,B) | -nonfixed(C) | -nonfixed(A) | -on(C,A,B). [resolve(25,c,26,d)].
% 0.68/0.99 27 -nonfixed(A) | -destination(A,B) | clear(A,B) # label(destination_block_is_clear) # label(axiom). [clausify(7)].
% 0.68/0.99 Derived: -nonfixed(A) | -destination(A,B) | -nonfixed(C) | -nonfixed(A) | -on(C,A,B). [resolve(27,c,26,d)].
% 0.68/0.99
% 0.68/0.99 ============================== end predicate elimination =============
% 0.68/0.99
% 0.68/0.99 Auto_denials:
% 0.68/0.99 % copying label not_on_self to answer in negative clause
% 0.68/0.99 % copying label object_is_not_source to answer in negative clause
% 0.68/0.99 % copying label object_is_not_destination to answer in negative clause
% 0.68/0.99 % copying label source_is_not_destination to answer in negative clause
% 0.68/0.99 % copying label only_one_object_block to answer in negative clause
% 0.68/0.99 % copying label only_one_source_block to answer in negative clause
% 0.68/0.99 % copying label only_one_destination_block to answer in negative clause
% 0.68/0.99 % copying label not_on_each_other to answer in negative clause
% 0.68/0.99 % copying label only_one_on to answer in negative clause
% 0.68/0.99 % copying label only_on_one_thing to answer in negative clause
% 0.68/0.99 % assign(max_proofs, 12). % (Horn set with more than one neg. clause)
% 0.68/0.99
% 0.68/0.99 Term ordering decisions:
% 0.68/0.99 Function symbol KB weights:
% 0.68/0.99
% 0.68/0.99 ============================== end of process initial clauses ========
% 0.68/0.99
% 0.68/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99
% 0.68/0.99 ============================== end of clauses for search =============
% 0.68/0.99
% 0.68/0.99 ============================== SEARCH ================================
% 0.68/0.99
% 0.68/0.99 % Starting search at 0.01 seconds.
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=19. Generated=27. Kept=20. proofs=0.
% 0.68/0.99 Usable=19. Sos=0. Demods=0. Limbo=0, Disabled=27. Hints=0.
% 0.68/0.99 Megabytes=0.09.
% 0.68/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 SEARCH FAILED
% 0.68/0.99
% 0.68/0.99 Exiting with failure.
% 0.68/0.99
% 0.68/0.99 Process 17946 exit (sos_empty) Tue May 31 18:18:44 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------