TSTP Solution File: PLA001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:20 EDT 2022
% Result : Unsatisfiable 0.43s 0.95s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PLA001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 19:36:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.95 ============================== Prover9 ===============================
% 0.43/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.95 Process 20890 was started by sandbox2 on n018.cluster.edu,
% 0.43/0.95 Tue May 31 19:36:44 2022
% 0.43/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20654_n018.cluster.edu".
% 0.43/0.95 ============================== end of head ===========================
% 0.43/0.95
% 0.43/0.95 ============================== INPUT =================================
% 0.43/0.95
% 0.43/0.95 % Reading from file /tmp/Prover9_20654_n018.cluster.edu
% 0.43/0.95
% 0.43/0.95 set(prolog_style_variables).
% 0.43/0.95 set(auto2).
% 0.43/0.95 % set(auto2) -> set(auto).
% 0.43/0.95 % set(auto) -> set(auto_inference).
% 0.43/0.95 % set(auto) -> set(auto_setup).
% 0.43/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.95 % set(auto) -> set(auto_limits).
% 0.43/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.95 % set(auto) -> set(auto_denials).
% 0.43/0.95 % set(auto) -> set(auto_process).
% 0.43/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.95 % set(auto2) -> assign(stats, some).
% 0.43/0.95 % set(auto2) -> clear(echo_input).
% 0.43/0.95 % set(auto2) -> set(quiet).
% 0.43/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.95 % set(auto2) -> clear(print_given).
% 0.43/0.95 assign(lrs_ticks,-1).
% 0.43/0.95 assign(sos_limit,10000).
% 0.43/0.95 assign(order,kbo).
% 0.43/0.95 set(lex_order_vars).
% 0.43/0.95 clear(print_given).
% 0.43/0.95
% 0.43/0.95 % formulas(sos). % not echoed (16 formulas)
% 0.43/0.95
% 0.43/0.95 ============================== end of input ==========================
% 0.43/0.95
% 0.43/0.95 % From the command line: assign(max_seconds, 300).
% 0.43/0.95
% 0.43/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.95
% 0.43/0.95 % Formulas that are not ordinary clauses:
% 0.43/0.95
% 0.43/0.95 ============================== end of process non-clausal formulas ===
% 0.43/0.95
% 0.43/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.95
% 0.43/0.95 ============================== PREDICATE ELIMINATION =================
% 0.43/0.95 1 -at(A,B,C,D) | -next_to(A,E) | at(E,B,s(s(C)),drive(E,D)) # label(drive1) # label(axiom). [assumption].
% 0.43/0.95 2 next_to(winnemucca,elko) # label(map1) # label(hypothesis). [assumption].
% 0.43/0.95 3 next_to(elko,saltLakeCity) # label(map2) # label(hypothesis). [assumption].
% 0.43/0.95 4 next_to(saltLakeCity,rockSprings) # label(map3) # label(hypothesis). [assumption].
% 0.43/0.95 5 next_to(rockSprings,laramie) # label(map4) # label(hypothesis). [assumption].
% 0.43/0.95 6 next_to(laramie,cheyenne) # label(map5) # label(hypothesis). [assumption].
% 0.43/0.95 7 next_to(cheyenne,northPlatte) # label(map6) # label(hypothesis). [assumption].
% 0.43/0.95 8 next_to(northPlatte,grandIsland) # label(map7) # label(hypothesis). [assumption].
% 0.43/0.95 9 next_to(grandIsland,lincoln) # label(map8) # label(hypothesis). [assumption].
% 0.43/0.95 10 next_to(lincoln,omaha) # label(map9) # label(hypothesis). [assumption].
% 0.43/0.95 11 next_to(omaha,desMoines) # label(map10) # label(hypothesis). [assumption].
% 0.43/0.95 Derived: -at(winnemucca,A,B,C) | at(elko,A,s(s(B)),drive(elko,C)). [resolve(1,b,2,a)].
% 0.43/0.95 Derived: -at(elko,A,B,C) | at(saltLakeCity,A,s(s(B)),drive(saltLakeCity,C)). [resolve(1,b,3,a)].
% 0.43/0.95 Derived: -at(saltLakeCity,A,B,C) | at(rockSprings,A,s(s(B)),drive(rockSprings,C)). [resolve(1,b,4,a)].
% 0.43/0.95 Derived: -at(rockSprings,A,B,C) | at(laramie,A,s(s(B)),drive(laramie,C)). [resolve(1,b,5,a)].
% 0.43/0.95 Derived: -at(laramie,A,B,C) | at(cheyenne,A,s(s(B)),drive(cheyenne,C)). [resolve(1,b,6,a)].
% 0.43/0.95 Derived: -at(cheyenne,A,B,C) | at(northPlatte,A,s(s(B)),drive(northPlatte,C)). [resolve(1,b,7,a)].
% 0.43/0.95 Derived: -at(northPlatte,A,B,C) | at(grandIsland,A,s(s(B)),drive(grandIsland,C)). [resolve(1,b,8,a)].
% 0.43/0.95 Derived: -at(grandIsland,A,B,C) | at(lincoln,A,s(s(B)),drive(lincoln,C)). [resolve(1,b,9,a)].
% 0.43/0.95 Derived: -at(lincoln,A,B,C) | at(omaha,A,s(s(B)),drive(omaha,C)). [resolve(1,b,10,a)].
% 0.43/0.95 Derived: -at(omaha,A,B,C) | at(desMoines,A,s(s(B)),drive(desMoines,C)). [resolve(1,b,11,a)].
% 0.43/0.95 12 -at(A,B,C,D) | -next_to(E,A) | at(E,B,s(s(C)),drive(E,D)) # label(drive2) # label(axiom). [assumption].
% 0.43/0.95 Derived: -at(elko,A,B,C) | at(winnemucca,A,s(s(B)),drive(winnemucca,C)). [resolve(12,b,2,a)].
% 0.43/0.95 Derived: -at(saltLakeCity,A,B,C) | at(elko,A,s(s(B)),drive(elko,C)). [resolve(12,b,3,a)].
% 0.43/0.95 Derived: -at(rockSprings,A,B,C) | at(saltLakeCity,A,s(s(B)),drive(saltLakeCity,C)). [resolve(12,b,4,a)].
% 0.43/0.95 Derived: -at(laramie,A,B,C) | at(rockSprings,A,s(s(B)),drive(rockSprings,C)). [resolve(12,b,5,a)].
% 0.43/0.95 Derived: -at(cheyenne,A,B,C) | at(laramie,A,s(s(B)),drive(laramie,C)). [resolve(12,b,6,a)].
% 0.43/0.95 Derived: -at(northPlatte,A,B,C) | at(cheyenne,A,s(s(B)),drive(cheyenne,C)). [resolve(12,b,7,a)].
% 0.43/0.95 Derived: -at(grandIsland,A,B,C) | at(northPlatte,A,s(s(B)),drive(northPlatte,C)). [resolve(12,b,8,a)].
% 0.43/0.95 Derived: -at(lincoln,A,B,C) | at(grandIsland,A,s(s(B)),drive(grandIsland,C)). [resolve(12,b,9,a)].
% 0.43/0.95 Derived: -at(omaha,A,B,C) | at(lincoln,A,s(s(B)),drive(lincoln,C)). [resolve(12,b,10,a)].
% 0.43/0.95 Derived: -at(desMoines,A,B,C) | at(omaha,A,s(s(B)),drive(omaha,C)). [resolve(12,b,11,a)].
% 0.43/0.95
% 0.43/0.95 ============================== end predicate elimination =============
% 0.43/0.95
% 0.43/0.95 Auto_denials:
% 0.43/0.95 % copying label prove_you_gat_get_there_with_bread to answer in negative clause
% 0.43/0.95
% 0.43/0.95 Term ordering decisions:
% 0.43/0.95 Function symbol KB weights: cheyenne=1. elko=1. grandIsland=1. laramie=1. lincoln=1. northPlatte=1. omaha=1. rockSprings=1. saltLakeCity=1. desMoines=1. winnemucca=1. initial_situation=1. none=1. start=1. drive=1. s=1. buy=1. wait_at=1.
% 0.43/0.95
% 0.43/0.95 ============================== end of process initial clauses ========
% 0.43/0.95
% 0.43/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.95
% 0.43/0.95 ============================== end of clauses for search =============
% 0.43/0.95
% 0.43/0.95 ============================== SEARCH ================================
% 0.43/0.95
% 0.43/0.95 % Starting search at 0.01 seconds.
% 0.43/0.95
% 0.43/0.95 ============================== PROOF =================================
% 0.43/0.95 % SZS status Unsatisfiable
% 0.43/0.95 % SZS output start Refutation
% 0.43/0.95
% 0.43/0.95 % Proof 1 at 0.01 (+ 0.00) seconds: prove_you_gat_get_there_with_bread.
% 0.43/0.95 % Length of proof is 23.
% 0.43/0.95 % Level of proof is 6.
% 0.43/0.95 % Maximum clause weight is 14.000.
% 0.43/0.95 % Given clauses 29.
% 0.43/0.95
% 0.43/0.95 1 -at(A,B,C,D) | -next_to(A,E) | at(E,B,s(s(C)),drive(E,D)) # label(drive1) # label(axiom). [assumption].
% 0.43/0.95 7 next_to(cheyenne,northPlatte) # label(map6) # label(hypothesis). [assumption].
% 0.43/0.95 8 next_to(northPlatte,grandIsland) # label(map7) # label(hypothesis). [assumption].
% 0.43/0.95 9 next_to(grandIsland,lincoln) # label(map8) # label(hypothesis). [assumption].
% 0.43/0.95 10 next_to(lincoln,omaha) # label(map9) # label(hypothesis). [assumption].
% 0.43/0.95 11 next_to(omaha,desMoines) # label(map10) # label(hypothesis). [assumption].
% 0.43/0.95 13 at(cheyenne,none,start,initial_situation) # label(initial) # label(hypothesis). [assumption].
% 0.43/0.95 14 -at(desMoines,s(none),A,B) # label(prove_you_gat_get_there_with_bread) # label(negated_conjecture) # answer(prove_you_gat_get_there_with_bread). [assumption].
% 0.43/0.95 15 -at(A,B,C,D) | at(A,B,s(C),wait_at(D)) # label(wait_in_city) # label(axiom). [assumption].
% 0.43/0.95 16 -at(A,B,C,D) | at(A,s(B),s(C),buy(D)) # label(buy_in_city) # label(axiom). [assumption].
% 0.43/0.95 22 -at(cheyenne,A,B,C) | at(northPlatte,A,s(s(B)),drive(northPlatte,C)). [resolve(1,b,7,a)].
% 0.43/0.95 23 -at(northPlatte,A,B,C) | at(grandIsland,A,s(s(B)),drive(grandIsland,C)). [resolve(1,b,8,a)].
% 0.43/0.95 24 -at(grandIsland,A,B,C) | at(lincoln,A,s(s(B)),drive(lincoln,C)). [resolve(1,b,9,a)].
% 0.43/0.95 25 -at(lincoln,A,B,C) | at(omaha,A,s(s(B)),drive(omaha,C)). [resolve(1,b,10,a)].
% 0.43/0.95 26 -at(omaha,A,B,C) | at(desMoines,A,s(s(B)),drive(desMoines,C)). [resolve(1,b,11,a)].
% 0.43/0.95 37 at(cheyenne,none,s(start),wait_at(initial_situation)). [ur(15,a,13,a)].
% 0.43/0.95 38 -at(desMoines,none,A,B) # answer(prove_you_gat_get_there_with_bread). [resolve(16,b,14,a)].
% 0.43/0.95 44 at(northPlatte,none,s(s(s(start))),drive(northPlatte,wait_at(initial_situation))). [ur(22,a,37,a)].
% 0.43/0.95 47 -at(omaha,none,A,B) # answer(prove_you_gat_get_there_with_bread). [resolve(38,a,26,b)].
% 0.43/0.95 48 -at(lincoln,none,A,B) # answer(prove_you_gat_get_there_with_bread). [resolve(47,a,25,b)].
% 0.43/0.95 49 -at(grandIsland,none,A,B) # answer(prove_you_gat_get_there_with_bread). [resolve(48,a,24,b)].
% 0.43/0.95 50 -at(northPlatte,none,A,B) # answer(prove_you_gat_get_there_with_bread). [resolve(49,a,23,b)].
% 0.43/0.95 51 $F # answer(prove_you_gat_get_there_with_bread). [resolve(50,a,44,a)].
% 0.43/0.95
% 0.43/0.95 % SZS output end Refutation
% 0.43/0.95 ============================== end of proof ==========================
% 0.43/0.95
% 0.43/0.95 ============================== STATISTICS ============================
% 0.43/0.95
% 0.43/0.95 Given=29. Generated=56. Kept=38. proofs=1.
% 0.43/0.95 Usable=29. Sos=8. Demods=0. Limbo=0, Disabled=36. Hints=0.
% 0.43/0.95 Megabytes=0.07.
% 0.43/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.95
% 0.43/0.95 ============================== end of statistics =====================
% 0.43/0.95
% 0.43/0.95 ============================== end of search =========================
% 0.43/0.95
% 0.43/0.95 THEOREM PROVED
% 0.43/0.95 % SZS status Unsatisfiable
% 0.43/0.95
% 0.43/0.95 Exiting with 1 proof.
% 0.43/0.95
% 0.43/0.95 Process 20890 exit (max_proofs) Tue May 31 19:36:44 2022
% 0.43/0.95 Prover9 interrupted
%------------------------------------------------------------------------------