TSTP Solution File: PLA002-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:21 EDT 2022
% Result : Unsatisfiable 0.94s 1.21s
% Output : Refutation 0.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue May 31 19:44:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 28160 was started by sandbox2 on n028.cluster.edu,
% 0.74/1.02 Tue May 31 19:44:22 2022
% 0.74/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28007_n028.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_28007_n028.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (23 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.02
% 0.74/1.02 % Formulas that are not ordinary clauses:
% 0.74/1.02
% 0.74/1.02 ============================== end of process non-clausal formulas ===
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.02
% 0.74/1.02 ============================== PREDICATE ELIMINATION =================
% 0.74/1.02 1 -warm(A) | -at(b,A) | at(d,climb(d,A)) | -situation(A) # label(climb_mountain_b_to_d) # label(hypothesis). [assumption].
% 0.74/1.02 2 warm(A) | cold(B) | -situation(A) | -situation(B) # label(warm_or_cold) # label(hypothesis). [assumption].
% 0.74/1.02 Derived: -at(b,A) | at(d,climb(d,A)) | -situation(A) | cold(B) | -situation(A) | -situation(B). [resolve(1,a,2,a)].
% 0.74/1.02 3 -warm(A) | -at(d,A) | at(b,climb(b,A)) | -situation(A) # label(climb_mountain_d_to_b) # label(hypothesis). [assumption].
% 0.74/1.02 Derived: -at(d,A) | at(b,climb(b,A)) | -situation(A) | cold(B) | -situation(A) | -situation(B). [resolve(3,a,2,a)].
% 0.74/1.02 4 -at(b,A) | at(d,climb(d,A)) | -situation(A) | cold(B) | -situation(A) | -situation(B). [resolve(1,a,2,a)].
% 0.74/1.02 5 -cold(A) | -at(b,A) | at(c,skate(c,A)) | -situation(A) # label(cross_river_b_to_c) # label(hypothesis). [assumption].
% 0.74/1.02 6 -cold(A) | -at(c,A) | at(b,skate(b,A)) | -situation(A) # label(cross_river_c_to_b) # label(hypothesis). [assumption].
% 0.74/1.02 Derived: -at(b,A) | at(d,climb(d,A)) | -situation(A) | -situation(A) | -situation(B) | -at(b,B) | at(c,skate(c,B)) | -situation(B). [resolve(4,d,5,a)].
% 0.74/1.02 Derived: -at(b,A) | at(d,climb(d,A)) | -situation(A) | -situation(A) | -situation(B) | -at(c,B) | at(b,skate(b,B)) | -situation(B). [resolve(4,d,6,a)].
% 0.74/1.02 7 -at(d,A) | at(b,climb(b,A)) | -situation(A) | cold(B) | -situation(A) | -situation(B). [resolve(3,a,2,a)].
% 0.74/1.02 Derived: -at(d,A) | at(b,climb(b,A)) | -situation(A) | -situation(A) | -situation(B) | -at(b,B) | at(c,skate(c,B)) | -situation(B). [resolve(7,d,5,a)].
% 0.74/1.02 Derived: -at(d,A) | at(b,climb(b,A)) | -situation(A) | -situation(A) | -situation(B) | -at(c,B) | at(b,skate(b,B)) | -situation(B). [resolve(7,d,6,a)].
% 0.74/1.02
% 0.74/1.02 ============================== end predicate elimination =============
% 0.74/1.02
% 0.74/1.02 Auto_denials: (non-Horn, no changes).
% 0.94/1.21
% 0.94/1.21 Term ordering decisions:
% 0.94/1.21 Function symbol KB weights: b=1. c=1. d=1. a=1. f=1. e=1. s0=1. go=1. climb=1. skate=1. drive=1. walk=1.
% 0.94/1.21
% 0.94/1.21 ============================== end of process initial clauses ========
% 0.94/1.21
% 0.94/1.21 ============================== CLAUSES FOR SEARCH ====================
% 0.94/1.21
% 0.94/1.21 ============================== end of clauses for search =============
% 0.94/1.21
% 0.94/1.21 ============================== SEARCH ================================
% 0.94/1.21
% 0.94/1.21 % Starting search at 0.01 seconds.
% 0.94/1.21
% 0.94/1.21 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 89 (0.00 of 0.13 sec).
% 0.94/1.21
% 0.94/1.21 ============================== PROOF =================================
% 0.94/1.21 % SZS status Unsatisfiable
% 0.94/1.21 % SZS output start Refutation
% 0.94/1.21
% 0.94/1.21 % Proof 1 at 0.19 (+ 0.01) seconds.
% 0.94/1.21 % Length of proof is 32.
% 0.94/1.21 % Level of proof is 8.
% 0.94/1.21 % Maximum clause weight is 20.000.
% 0.94/1.21 % Given clauses 1244.
% 0.94/1.21
% 0.94/1.21 2 warm(A) | cold(B) | -situation(A) | -situation(B) # label(warm_or_cold) # label(hypothesis). [assumption].
% 0.94/1.21 3 -warm(A) | -at(d,A) | at(b,climb(b,A)) | -situation(A) # label(climb_mountain_d_to_b) # label(hypothesis). [assumption].
% 0.94/1.21 6 -cold(A) | -at(c,A) | at(b,skate(b,A)) | -situation(A) # label(cross_river_c_to_b) # label(hypothesis). [assumption].
% 0.94/1.21 7 -at(d,A) | at(b,climb(b,A)) | -situation(A) | cold(B) | -situation(A) | -situation(B). [resolve(3,a,2,a)].
% 0.94/1.21 8 situation(s0) # label(initial_situation) # label(hypothesis). [assumption].
% 0.94/1.21 9 at(f,s0) # label(initial) # label(hypothesis). [assumption].
% 0.94/1.21 10 -at(a,A) | -situation(A) # label(prove_you_can_get_to_a_in_a_situation) # label(negated_conjecture). [assumption].
% 0.94/1.21 12 -situation(A) | situation(drive(B,A)) # label(drive_situation) # label(hypothesis). [assumption].
% 0.94/1.21 13 -situation(A) | situation(climb(B,A)) # label(climb_situation) # label(hypothesis). [assumption].
% 0.94/1.21 14 -situation(A) | situation(skate(B,A)) # label(skate_situation) # label(hypothesis). [assumption].
% 0.94/1.21 15 -situation(A) | situation(go(B,A)) # label(go_situation) # label(hypothesis). [assumption].
% 0.94/1.21 17 -at(b,A) | at(a,drive(a,A)) | -situation(A) # label(drive_b_to_a) # label(hypothesis). [assumption].
% 0.94/1.21 19 -at(d,A) | at(c,go(c,A)) | -situation(A) # label(go_d_to_c) # label(hypothesis). [assumption].
% 0.94/1.21 23 -at(f,A) | at(d,go(d,A)) | -situation(A) # label(go_f_to_d) # label(hypothesis). [assumption].
% 0.94/1.21 30 -at(d,A) | at(b,climb(b,A)) | -situation(A) | -situation(A) | -situation(B) | -at(c,B) | at(b,skate(b,B)) | -situation(B). [resolve(7,d,6,a)].
% 0.94/1.21 31 -at(d,A) | at(b,climb(b,A)) | -situation(A) | -situation(B) | -at(c,B) | at(b,skate(b,B)). [copy(30),merge(d),merge(h)].
% 0.94/1.21 41 situation(go(A,s0)). [resolve(15,a,8,a)].
% 0.94/1.21 42 at(d,go(d,s0)). [resolve(23,a,9,a),unit_del(b,8)].
% 0.94/1.21 67 situation(go(A,go(B,s0))). [resolve(41,a,15,a)].
% 0.94/1.21 69 situation(climb(A,go(B,s0))). [resolve(41,a,13,a)].
% 0.94/1.21 76 at(b,climb(b,go(d,s0))) | -situation(A) | -at(c,A) | at(b,skate(b,A)). [resolve(42,a,31,a),unit_del(b,41)].
% 0.94/1.21 79 at(c,go(c,go(d,s0))). [resolve(42,a,19,a),unit_del(b,41)].
% 0.94/1.21 203 situation(skate(A,go(B,go(C,s0)))). [resolve(67,a,14,a)].
% 0.94/1.21 217 situation(drive(A,climb(B,go(C,s0)))). [resolve(69,a,12,a)].
% 0.94/1.21 294 at(b,climb(b,go(d,s0))) | at(b,skate(b,go(c,go(d,s0)))). [resolve(76,c,79,a),unit_del(b,67)].
% 0.94/1.21 863 situation(drive(A,skate(B,go(C,go(D,s0))))). [resolve(203,a,12,a)].
% 0.94/1.21 939 -at(a,drive(A,climb(B,go(C,s0)))). [ur(10,b,217,a)].
% 0.94/1.21 1307 at(b,climb(b,go(d,s0))) | at(a,drive(a,skate(b,go(c,go(d,s0))))). [resolve(294,b,17,a),unit_del(c,203)].
% 0.94/1.21 1309 -at(b,climb(A,go(B,s0))). [ur(17,b,939,a,c,69,a)].
% 0.94/1.21 1311 at(a,drive(a,skate(b,go(c,go(d,s0))))). [back_unit_del(1307),unit_del(a,1309)].
% 0.94/1.21 4155 -at(a,drive(A,skate(B,go(C,go(D,s0))))). [ur(10,b,863,a)].
% 0.94/1.21 4156 $F. [resolve(4155,a,1311,a)].
% 0.94/1.21
% 0.94/1.21 % SZS output end Refutation
% 0.94/1.21 ============================== end of proof ==========================
% 0.94/1.21
% 0.94/1.21 ============================== STATISTICS ============================
% 0.94/1.21
% 0.94/1.21 Given=1244. Generated=4245. Kept=4144. proofs=1.
% 0.94/1.21 Usable=1228. Sos=2884. Demods=0. Limbo=5, Disabled=55. Hints=0.
% 0.94/1.21 Megabytes=3.86.
% 0.94/1.21 User_CPU=0.19, System_CPU=0.01, Wall_clock=0.
% 0.94/1.21
% 0.94/1.21 ============================== end of statistics =====================
% 0.94/1.21
% 0.94/1.21 ============================== end of search =========================
% 0.94/1.21
% 0.94/1.21 THEOREM PROVED
% 0.94/1.21 % SZS status Unsatisfiable
% 0.94/1.21
% 0.94/1.21 Exiting with 1 proof.
% 0.94/1.21
% 0.94/1.21 Process 28160 exit (max_proofs) Tue May 31 19:44:22 2022
% 0.94/1.21 Prover9 interrupted
%------------------------------------------------------------------------------