TSTP Solution File: MSC002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 : Sun Jul 17 22:56:29 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 : Fri Jul 1 15:04:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 13397 was started by sandbox2 on n008.cluster.edu,
% 0.43/0.99 Fri Jul 1 15:04:39 2022
% 0.43/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12990_n008.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_12990_n008.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (14 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 1 -red(A) | -put(A,there,B) | answer(B) # label(answer_if_red_and_put_there) # label(axiom). [assumption].
% 0.43/0.99 2 -answer(A) # label(prove_there_is_an_answer_situation) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -red(A) | -put(A,there,B). [resolve(1,c,2,a)].
% 0.43/0.99 3 -hand_at(A,B) | -at(C,A,B) | held(C,pick_up(B)) # label(thing_picked_up_by_hand) # label(axiom). [assumption].
% 0.43/0.99 4 -held(A,let_go(B)) # label(cant_hold_and_let_go) # label(axiom). [assumption].
% 0.43/0.99 5 -hand_at(A,B) | -held(C,B) | at(C,D,go(D,B)) # label(thing_goes_in_hand) # label(axiom). [assumption].
% 0.43/0.99 Derived: -hand_at(A,pick_up(B)) | at(C,D,go(D,pick_up(B))) | -hand_at(E,B) | -at(C,E,B). [resolve(5,b,3,c)].
% 0.43/0.99 6 held(A,B) | -at(A,C,B) | at(A,C,go(D,B)) # label(thing_either_held_or_went_there) # label(axiom). [assumption].
% 0.43/0.99 Derived: -at(A,B,let_go(C)) | at(A,B,go(D,let_go(C))). [resolve(6,a,4,a)].
% 0.43/0.99 Derived: -at(A,B,C) | at(A,B,go(D,C)) | -hand_at(E,C) | at(A,F,go(F,C)). [resolve(6,a,5,b)].
% 0.43/0.99 7 -red(A) | -put(A,there,B). [resolve(1,c,2,a)].
% 0.43/0.99 8 -at(A,here,B) | red(A) # label(everything_is_red) # label(axiom). [assumption].
% 0.43/0.99 Derived: -put(A,there,B) | -at(A,here,C). [resolve(7,a,8,b)].
% 0.43/0.99 9 -at(A,B,C) | -grabbed(A,C) | put(A,D,go(D,C)) # label(can_put_somewhere_if_grab_and_go_there) # label(axiom). [assumption].
% 0.43/0.99 10 -at(A,B,C) | grabbed(A,pick_up(go(B,let_go(C)))) # label(can_grab_if_previously_let_go) # label(axiom). [assumption].
% 0.43/0.99 Derived: -at(A,B,pick_up(go(C,let_go(D)))) | put(A,E,go(E,pick_up(go(C,let_go(D))))) | -at(A,C,D). [resolve(9,b,10,b)].
% 0.43/0.99 11 -at(A,B,pick_up(go(C,let_go(D)))) | put(A,E,go(E,pick_up(go(C,let_go(D))))) | -at(A,C,D). [resolve(9,b,10,b)].
% 0.43/0.99 12 -put(A,there,B) | -at(A,here,C). [resolve(7,a,8,b)].
% 0.43/0.99 Derived: -at(A,B,pick_up(go(C,let_go(D)))) | -at(A,C,D) | -at(A,here,E). [resolve(11,b,12,a)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (non-Horn, no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: here=1. now=1. something=1. go=1. let_go=1. pick_up=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 20.
% 0.43/0.99 % Level of proof is 6.
% 0.43/0.99 % Maximum clause weight is 16.000.
% 0.43/0.99 % Given clauses 14.
% 0.43/0.99
% 0.43/0.99 1 -red(A) | -put(A,there,B) | answer(B) # label(answer_if_red_and_put_there) # label(axiom). [assumption].
% 0.43/0.99 2 -answer(A) # label(prove_there_is_an_answer_situation) # label(negated_conjecture). [assumption].
% 0.43/0.99 4 -held(A,let_go(B)) # label(cant_hold_and_let_go) # label(axiom). [assumption].
% 0.43/0.99 6 held(A,B) | -at(A,C,B) | at(A,C,go(D,B)) # label(thing_either_held_or_went_there) # label(axiom). [assumption].
% 0.43/0.99 7 -red(A) | -put(A,there,B). [resolve(1,c,2,a)].
% 0.43/0.99 8 -at(A,here,B) | red(A) # label(everything_is_red) # label(axiom). [assumption].
% 0.43/0.99 9 -at(A,B,C) | -grabbed(A,C) | put(A,D,go(D,C)) # label(can_put_somewhere_if_grab_and_go_there) # label(axiom). [assumption].
% 0.43/0.99 10 -at(A,B,C) | grabbed(A,pick_up(go(B,let_go(C)))) # label(can_grab_if_previously_let_go) # label(axiom). [assumption].
% 0.43/0.99 11 -at(A,B,pick_up(go(C,let_go(D)))) | put(A,E,go(E,pick_up(go(C,let_go(D))))) | -at(A,C,D). [resolve(9,b,10,b)].
% 0.43/0.99 12 -put(A,there,B) | -at(A,here,C). [resolve(7,a,8,b)].
% 0.43/0.99 13 at(something,here,now) # label(something_is_here_now) # label(axiom). [assumption].
% 0.43/0.99 16 -at(A,B,C) | at(A,B,let_go(C)) # label(situation_let_go) # label(axiom). [assumption].
% 0.43/0.99 17 -at(A,B,C) | at(A,B,pick_up(C)) # label(situation_pick_up) # label(axiom). [assumption].
% 0.43/0.99 19 -at(A,B,let_go(C)) | at(A,B,go(D,let_go(C))). [resolve(6,a,4,a)].
% 0.43/0.99 21 -at(A,B,pick_up(go(C,let_go(D)))) | -at(A,C,D) | -at(A,here,E). [resolve(11,b,12,a)].
% 0.43/0.99 25 at(something,here,let_go(now)). [resolve(16,a,13,a)].
% 0.43/0.99 31 -at(something,A,pick_up(go(here,let_go(now)))). [ur(21,b,13,a,c,13,a)].
% 0.43/0.99 34 at(something,here,go(A,let_go(now))). [resolve(25,a,19,a)].
% 0.43/0.99 39 -at(something,A,go(here,let_go(now))). [ur(17,b,31,a)].
% 0.43/0.99 40 $F. [resolve(39,a,34,a)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=14. Generated=37. Kept=27. proofs=1.
% 0.43/0.99 Usable=14. Sos=10. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.43/0.99 Megabytes=0.05.
% 0.43/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 13397 exit (max_proofs) Fri Jul 1 15:04:39 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------