TSTP Solution File: PLA031-1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA031-1.003 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:26 EDT 2022
% Result : Unsatisfiable 1.13s 1.48s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : PLA031-1.003 : TPTP v8.1.0. Released v3.5.0.
% 0.05/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.33 % Computer : n032.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 600
% 0.10/0.33 % DateTime : Tue May 31 20:40:44 EDT 2022
% 0.10/0.33 % CPUTime :
% 0.51/0.84 ============================== Prover9 ===============================
% 0.51/0.84 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.84 Process 20118 was started by sandbox2 on n032.cluster.edu,
% 0.51/0.84 Tue May 31 20:40:44 2022
% 0.51/0.84 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19965_n032.cluster.edu".
% 0.51/0.84 ============================== end of head ===========================
% 0.51/0.84
% 0.51/0.84 ============================== INPUT =================================
% 0.51/0.84
% 0.51/0.84 % Reading from file /tmp/Prover9_19965_n032.cluster.edu
% 0.51/0.84
% 0.51/0.84 set(prolog_style_variables).
% 0.51/0.84 set(auto2).
% 0.51/0.84 % set(auto2) -> set(auto).
% 0.51/0.84 % set(auto) -> set(auto_inference).
% 0.51/0.84 % set(auto) -> set(auto_setup).
% 0.51/0.84 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.84 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.84 % set(auto) -> set(auto_limits).
% 0.51/0.84 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.84 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.84 % set(auto) -> set(auto_denials).
% 0.51/0.84 % set(auto) -> set(auto_process).
% 0.51/0.84 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.84 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.84 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.84 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.84 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.84 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.84 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.84 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.84 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.84 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.84 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.84 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.84 % set(auto2) -> assign(stats, some).
% 0.51/0.84 % set(auto2) -> clear(echo_input).
% 0.51/0.84 % set(auto2) -> set(quiet).
% 0.51/0.84 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.84 % set(auto2) -> clear(print_given).
% 0.51/0.84 assign(lrs_ticks,-1).
% 0.51/0.84 assign(sos_limit,10000).
% 0.51/0.84 assign(order,kbo).
% 0.51/0.84 set(lex_order_vars).
% 0.51/0.84 clear(print_given).
% 0.51/0.84
% 0.51/0.84 % formulas(sos). % not echoed (112 formulas)
% 0.51/0.84
% 0.51/0.84 ============================== end of input ==========================
% 0.51/0.84
% 0.51/0.84 % From the command line: assign(max_seconds, 300).
% 0.51/0.84
% 0.51/0.84 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.84
% 0.51/0.84 % Formulas that are not ordinary clauses:
% 0.51/0.84
% 0.51/0.84 ============================== end of process non-clausal formulas ===
% 0.51/0.84
% 0.51/0.84 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/0.84
% 0.51/0.84 ============================== PREDICATE ELIMINATION =================
% 0.51/0.84 1 neq(truck1,truck2) # label(neq2) # label(axiom). [assumption].
% 0.51/0.84 2 -s(A,B,C,D,E,F,E,V6) | -neq(F,truck1) | s(A,B,C,D,truck1,F,E,V6) # label(board1) # label(axiom). [assumption].
% 0.51/0.84 3 -s(A,B,C,D,E,F,V6,E) | -neq(F,truck2) | s(A,B,C,D,truck2,F,V6,E) # label(board3) # label(axiom). [assumption].
% 0.51/0.84 4 -s(A,B,C,D,E,F,F,V6) | -neq(E,truck1) | s(A,B,C,D,E,truck1,F,V6) # label(board5) # label(axiom). [assumption].
% 0.51/0.84 5 -s(A,B,C,D,E,F,V6,F) | -neq(E,truck2) | s(A,B,C,D,E,truck2,V6,F) # label(board7) # label(axiom). [assumption].
% 0.51/0.84 6 -neq(truck1,truck1) # label(neq1) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck1,F,E) | s(A,B,C,D,truck2,truck1,F,E). [resolve(1,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck1,E,F,E) | s(A,B,C,D,truck1,truck2,F,E). [resolve(1,a,5,b)].
% 0.51/0.84 7 neq(truck1,s0) # label(neq3) # label(axiom). [assumption].
% 0.51/0.84 8 neq(truck1,s1) # label(neq4) # label(axiom). [assumption].
% 0.51/0.84 9 neq(truck1,s2) # label(neq5) # label(axiom). [assumption].
% 0.51/0.84 10 neq(truck1,p0_1) # label(neq6) # label(axiom). [assumption].
% 0.51/0.84 11 neq(truck1,p1_2) # label(neq7) # label(axiom). [assumption].
% 0.51/0.84 12 neq(truck1,p2_0) # label(neq8) # label(axiom). [assumption].
% 0.51/0.84 13 neq(truck2,truck1) # label(neq9) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck2,E,F) | s(A,B,C,D,truck1,truck2,E,F). [resolve(13,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck2,E,E,F) | s(A,B,C,D,truck2,truck1,E,F). [resolve(13,a,4,b)].
% 0.51/0.84 14 -neq(truck2,truck2) # label(neq10) # label(axiom). [assumption].
% 0.51/0.84 15 neq(truck2,s0) # label(neq11) # label(axiom). [assumption].
% 0.51/0.84 16 neq(truck2,s1) # label(neq12) # label(axiom). [assumption].
% 0.51/0.84 17 neq(truck2,s2) # label(neq13) # label(axiom). [assumption].
% 0.51/0.84 18 neq(truck2,p0_1) # label(neq14) # label(axiom). [assumption].
% 0.51/0.84 19 neq(truck2,p1_2) # label(neq15) # label(axiom). [assumption].
% 0.51/0.84 20 neq(truck2,p2_0) # label(neq16) # label(axiom). [assumption].
% 0.51/0.84 21 neq(s0,truck1) # label(neq17) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s0,E,F) | s(A,B,C,D,truck1,s0,E,F). [resolve(21,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s0,E,E,F) | s(A,B,C,D,s0,truck1,E,F). [resolve(21,a,4,b)].
% 0.51/0.84 22 neq(s0,truck2) # label(neq18) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s0,F,E) | s(A,B,C,D,truck2,s0,F,E). [resolve(22,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s0,E,F,E) | s(A,B,C,D,s0,truck2,F,E). [resolve(22,a,5,b)].
% 0.51/0.84 23 -neq(s0,s0) # label(neq19) # label(axiom). [assumption].
% 0.51/0.84 24 neq(s0,s1) # label(neq20) # label(axiom). [assumption].
% 0.51/0.84 25 neq(s0,s2) # label(neq21) # label(axiom). [assumption].
% 0.51/0.84 26 neq(s0,p0_1) # label(neq22) # label(axiom). [assumption].
% 0.51/0.84 27 neq(s0,p1_2) # label(neq23) # label(axiom). [assumption].
% 0.51/0.84 28 neq(s0,p2_0) # label(neq24) # label(axiom). [assumption].
% 0.51/0.84 29 neq(s1,truck1) # label(neq25) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s1,E,F) | s(A,B,C,D,truck1,s1,E,F). [resolve(29,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s1,E,E,F) | s(A,B,C,D,s1,truck1,E,F). [resolve(29,a,4,b)].
% 0.51/0.84 30 neq(s1,truck2) # label(neq26) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s1,F,E) | s(A,B,C,D,truck2,s1,F,E). [resolve(30,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s1,E,F,E) | s(A,B,C,D,s1,truck2,F,E). [resolve(30,a,5,b)].
% 0.51/0.84 31 neq(s1,s0) # label(neq27) # label(axiom). [assumption].
% 0.51/0.84 32 -neq(s1,s1) # label(neq28) # label(axiom). [assumption].
% 0.51/0.84 33 neq(s1,s2) # label(neq29) # label(axiom). [assumption].
% 0.51/0.84 34 neq(s1,p0_1) # label(neq30) # label(axiom). [assumption].
% 0.51/0.84 35 neq(s1,p1_2) # label(neq31) # label(axiom). [assumption].
% 0.51/0.84 36 neq(s1,p2_0) # label(neq32) # label(axiom). [assumption].
% 0.51/0.84 37 neq(s2,truck1) # label(neq33) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s2,E,F) | s(A,B,C,D,truck1,s2,E,F). [resolve(37,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s2,E,E,F) | s(A,B,C,D,s2,truck1,E,F). [resolve(37,a,4,b)].
% 0.51/0.84 38 neq(s2,truck2) # label(neq34) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s2,F,E) | s(A,B,C,D,truck2,s2,F,E). [resolve(38,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,s2,E,F,E) | s(A,B,C,D,s2,truck2,F,E). [resolve(38,a,5,b)].
% 0.51/0.84 39 neq(s2,s0) # label(neq35) # label(axiom). [assumption].
% 0.51/0.84 40 neq(s2,s1) # label(neq36) # label(axiom). [assumption].
% 0.51/0.84 41 -neq(s2,s2) # label(neq37) # label(axiom). [assumption].
% 0.51/0.84 42 neq(s2,p0_1) # label(neq38) # label(axiom). [assumption].
% 0.51/0.84 43 neq(s2,p1_2) # label(neq39) # label(axiom). [assumption].
% 0.51/0.84 44 neq(s2,p2_0) # label(neq40) # label(axiom). [assumption].
% 0.51/0.84 45 neq(p0_1,truck1) # label(neq41) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p0_1,E,F) | s(A,B,C,D,truck1,p0_1,E,F). [resolve(45,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p0_1,E,E,F) | s(A,B,C,D,p0_1,truck1,E,F). [resolve(45,a,4,b)].
% 0.51/0.84 46 neq(p0_1,truck2) # label(neq42) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p0_1,F,E) | s(A,B,C,D,truck2,p0_1,F,E). [resolve(46,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p0_1,E,F,E) | s(A,B,C,D,p0_1,truck2,F,E). [resolve(46,a,5,b)].
% 0.51/0.84 47 neq(p0_1,s0) # label(neq43) # label(axiom). [assumption].
% 0.51/0.84 48 neq(p0_1,s1) # label(neq44) # label(axiom). [assumption].
% 0.51/0.84 49 neq(p0_1,s2) # label(neq45) # label(axiom). [assumption].
% 0.51/0.84 50 -neq(p0_1,p0_1) # label(neq46) # label(axiom). [assumption].
% 0.51/0.84 51 neq(p0_1,p1_2) # label(neq47) # label(axiom). [assumption].
% 0.51/0.84 52 neq(p0_1,p2_0) # label(neq48) # label(axiom). [assumption].
% 0.51/0.84 53 neq(p1_2,truck1) # label(neq49) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p1_2,E,F) | s(A,B,C,D,truck1,p1_2,E,F). [resolve(53,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p1_2,E,E,F) | s(A,B,C,D,p1_2,truck1,E,F). [resolve(53,a,4,b)].
% 0.51/0.84 54 neq(p1_2,truck2) # label(neq50) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p1_2,F,E) | s(A,B,C,D,truck2,p1_2,F,E). [resolve(54,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p1_2,E,F,E) | s(A,B,C,D,p1_2,truck2,F,E). [resolve(54,a,5,b)].
% 0.51/0.84 55 neq(p1_2,s0) # label(neq51) # label(axiom). [assumption].
% 0.51/0.84 56 neq(p1_2,s1) # label(neq52) # label(axiom). [assumption].
% 0.51/0.84 57 neq(p1_2,s2) # label(neq53) # label(axiom). [assumption].
% 0.51/0.84 58 neq(p1_2,p0_1) # label(neq54) # label(axiom). [assumption].
% 0.51/0.84 59 -neq(p1_2,p1_2) # label(neq55) # label(axiom). [assumption].
% 0.51/0.84 60 neq(p1_2,p2_0) # label(neq56) # label(axiom). [assumption].
% 0.51/0.84 61 neq(p2_0,truck1) # label(neq57) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p2_0,E,F) | s(A,B,C,D,truck1,p2_0,E,F). [resolve(61,a,2,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p2_0,E,E,F) | s(A,B,C,D,p2_0,truck1,E,F). [resolve(61,a,4,b)].
% 0.51/0.84 62 neq(p2_0,truck2) # label(neq58) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p2_0,F,E) | s(A,B,C,D,truck2,p2_0,F,E). [resolve(62,a,3,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,p2_0,E,F,E) | s(A,B,C,D,p2_0,truck2,F,E). [resolve(62,a,5,b)].
% 0.51/0.84 63 neq(p2_0,s0) # label(neq59) # label(axiom). [assumption].
% 0.51/0.84 64 neq(p2_0,s1) # label(neq60) # label(axiom). [assumption].
% 0.51/0.84 65 neq(p2_0,s2) # label(neq61) # label(axiom). [assumption].
% 0.51/0.84 66 neq(p2_0,p0_1) # label(neq62) # label(axiom). [assumption].
% 0.51/0.84 67 neq(p2_0,p1_2) # label(neq63) # label(axiom). [assumption].
% 0.51/0.84 68 -neq(p2_0,p2_0) # label(neq64) # label(axiom). [assumption].
% 0.51/0.84 69 link(s1,s2) # label(map13) # label(axiom). [assumption].
% 0.51/0.84 70 -s(A,B,C,D,truck1,E,F,V6) | -link(F,V7) | s(A,B,C,D,truck1,E,V7,V6) # label(drive1) # label(axiom). [assumption].
% 0.51/0.84 71 -s(A,B,C,D,truck2,E,F,V6) | -link(V6,V7) | s(A,B,C,D,truck2,E,F,V7) # label(drive2) # label(axiom). [assumption].
% 0.51/0.84 72 -s(A,B,C,D,E,truck1,F,V6) | -link(F,V7) | s(A,B,C,D,E,truck1,V7,V6) # label(drive3) # label(axiom). [assumption].
% 0.51/0.84 73 -s(A,B,C,D,E,truck2,F,V6) | -link(V6,V7) | s(A,B,C,D,E,truck2,F,V7) # label(drive4) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,truck1,E,s1,F) | s(A,B,C,D,truck1,E,s2,F). [resolve(69,a,70,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck2,E,F,s1) | s(A,B,C,D,truck2,E,F,s2). [resolve(69,a,71,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck1,s1,F) | s(A,B,C,D,E,truck1,s2,F). [resolve(69,a,72,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck2,F,s1) | s(A,B,C,D,E,truck2,F,s2). [resolve(69,a,73,b)].
% 0.51/0.84 74 link(s2,s1) # label(map14) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,truck1,E,s2,F) | s(A,B,C,D,truck1,E,s1,F). [resolve(74,a,70,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck2,E,F,s2) | s(A,B,C,D,truck2,E,F,s1). [resolve(74,a,71,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck1,s2,F) | s(A,B,C,D,E,truck1,s1,F). [resolve(74,a,72,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck2,F,s2) | s(A,B,C,D,E,truck2,F,s1). [resolve(74,a,73,b)].
% 0.51/0.84 75 link(s2,s0) # label(map15) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,truck1,E,s2,F) | s(A,B,C,D,truck1,E,s0,F). [resolve(75,a,70,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck2,E,F,s2) | s(A,B,C,D,truck2,E,F,s0). [resolve(75,a,71,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck1,s2,F) | s(A,B,C,D,E,truck1,s0,F). [resolve(75,a,72,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck2,F,s2) | s(A,B,C,D,E,truck2,F,s0). [resolve(75,a,73,b)].
% 0.51/0.84 76 link(s0,s2) # label(map16) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,truck1,E,s0,F) | s(A,B,C,D,truck1,E,s2,F). [resolve(76,a,70,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,truck2,E,F,s0) | s(A,B,C,D,truck2,E,F,s2). [resolve(76,a,71,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck1,s0,F) | s(A,B,C,D,E,truck1,s2,F). [resolve(76,a,72,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,truck2,F,s0) | s(A,B,C,D,E,truck2,F,s2). [resolve(76,a,73,b)].
% 0.51/0.84 77 path(s0,p0_1) # label(map1) # label(axiom). [assumption].
% 0.51/0.84 78 -s(A,B,C,D,E,F,V6,V7) | -path(E,V8) | s(A,B,C,D,V8,F,V6,V7) # label(walk1) # label(axiom). [assumption].
% 0.51/0.84 79 -s(A,B,C,D,E,F,V6,V7) | -path(F,V8) | s(A,B,C,D,E,V8,V6,V7) # label(walk2) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,s0,E,F,V6) | s(A,B,C,D,p0_1,E,F,V6). [resolve(77,a,78,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s0,F,V6) | s(A,B,C,D,E,p0_1,F,V6). [resolve(77,a,79,b)].
% 0.51/0.84 80 path(p0_1,s0) # label(map2) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,p0_1,E,F,V6) | s(A,B,C,D,s0,E,F,V6). [resolve(80,a,78,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,p0_1,F,V6) | s(A,B,C,D,E,s0,F,V6). [resolve(80,a,79,b)].
% 0.51/0.84 81 path(s1,p0_1) # label(map3) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,s1,E,F,V6) | s(A,B,C,D,p0_1,E,F,V6). [resolve(81,a,78,b)].
% 0.51/0.84 Derived: -s(A,B,C,D,E,s1,F,V6) | s(A,B,C,D,E,p0_1,F,V6). [resolve(81,a,79,b)].
% 0.51/0.84 82 path(p0_1,s1) # label(map4) # label(axiom). [assumption].
% 0.51/0.84 Derived: -s(A,B,C,D,p0_1,E,F,V6) | s(A,B,C,D,s1,E,F,V6). [resolve(82,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,p0_1,F,V6) | s(A,B,C,D,E,s1,F,V6). [resolve(82,a,79,b)].
% 1.13/1.48 83 path(s1,p1_2) # label(map5) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,s1,E,F,V6) | s(A,B,C,D,p1_2,E,F,V6). [resolve(83,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,s1,F,V6) | s(A,B,C,D,E,p1_2,F,V6). [resolve(83,a,79,b)].
% 1.13/1.48 84 path(p1_2,s1) # label(map6) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,p1_2,E,F,V6) | s(A,B,C,D,s1,E,F,V6). [resolve(84,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,p1_2,F,V6) | s(A,B,C,D,E,s1,F,V6). [resolve(84,a,79,b)].
% 1.13/1.48 85 path(s2,p1_2) # label(map7) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,s2,E,F,V6) | s(A,B,C,D,p1_2,E,F,V6). [resolve(85,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,s2,F,V6) | s(A,B,C,D,E,p1_2,F,V6). [resolve(85,a,79,b)].
% 1.13/1.48 86 path(p1_2,s2) # label(map8) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,p1_2,E,F,V6) | s(A,B,C,D,s2,E,F,V6). [resolve(86,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,p1_2,F,V6) | s(A,B,C,D,E,s2,F,V6). [resolve(86,a,79,b)].
% 1.13/1.48 87 path(s2,p2_0) # label(map9) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,s2,E,F,V6) | s(A,B,C,D,p2_0,E,F,V6). [resolve(87,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,s2,F,V6) | s(A,B,C,D,E,p2_0,F,V6). [resolve(87,a,79,b)].
% 1.13/1.48 88 path(p2_0,s2) # label(map10) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,p2_0,E,F,V6) | s(A,B,C,D,s2,E,F,V6). [resolve(88,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,p2_0,F,V6) | s(A,B,C,D,E,s2,F,V6). [resolve(88,a,79,b)].
% 1.13/1.48 89 path(s0,p2_0) # label(map11) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,s0,E,F,V6) | s(A,B,C,D,p2_0,E,F,V6). [resolve(89,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,s0,F,V6) | s(A,B,C,D,E,p2_0,F,V6). [resolve(89,a,79,b)].
% 1.13/1.48 90 path(p2_0,s0) # label(map12) # label(axiom). [assumption].
% 1.13/1.48 Derived: -s(A,B,C,D,p2_0,E,F,V6) | s(A,B,C,D,s0,E,F,V6). [resolve(90,a,78,b)].
% 1.13/1.48 Derived: -s(A,B,C,D,E,p2_0,F,V6) | s(A,B,C,D,E,s0,F,V6). [resolve(90,a,79,b)].
% 1.13/1.48
% 1.13/1.48 ============================== end predicate elimination =============
% 1.13/1.48
% 1.13/1.48 Auto_denials:
% 1.13/1.48 % copying label goal to answer in negative clause
% 1.13/1.48
% 1.13/1.48 Term ordering decisions:
% 1.13/1.48 Function symbol KB weights: truck1=1. truck2=1. s2=1. s1=1. s0=1. p0_1=1. p1_2=1. p2_0=1.
% 1.13/1.48
% 1.13/1.48 ============================== end of process initial clauses ========
% 1.13/1.48
% 1.13/1.48 ============================== CLAUSES FOR SEARCH ====================
% 1.13/1.48
% 1.13/1.48 ============================== end of clauses for search =============
% 1.13/1.48
% 1.13/1.48 ============================== SEARCH ================================
% 1.13/1.48
% 1.13/1.48 % Starting search at 0.02 seconds.
% 1.13/1.48
% 1.13/1.48 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 143 (0.00 of 0.11 sec).
% 1.13/1.48
% 1.13/1.48 Low Water (keep): wt=9.000, iters=3335
% 1.13/1.48
% 1.13/1.48 ============================== PROOF =================================
% 1.13/1.48 % SZS status Unsatisfiable
% 1.13/1.48 % SZS output start Refutation
% 1.13/1.48
% 1.13/1.48 % Proof 1 at 0.62 (+ 0.04) seconds: goal.
% 1.13/1.48 % Length of proof is 44.
% 1.13/1.48 % Level of proof is 10.
% 1.13/1.48 % Maximum clause weight is 18.000.
% 1.13/1.48 % Given clauses 2907.
% 1.13/1.48
% 1.13/1.48 4 -s(A,B,C,D,E,F,F,V6) | -neq(E,truck1) | s(A,B,C,D,E,truck1,F,V6) # label(board5) # label(axiom). [assumption].
% 1.13/1.48 37 neq(s2,truck1) # label(neq33) # label(axiom). [assumption].
% 1.13/1.48 69 link(s1,s2) # label(map13) # label(axiom). [assumption].
% 1.13/1.48 72 -s(A,B,C,D,E,truck1,F,V6) | -link(F,V7) | s(A,B,C,D,E,truck1,V7,V6) # label(drive3) # label(axiom). [assumption].
% 1.13/1.48 75 link(s2,s0) # label(map15) # label(axiom). [assumption].
% 1.13/1.48 76 link(s0,s2) # label(map16) # label(axiom). [assumption].
% 1.13/1.48 77 path(s0,p0_1) # label(map1) # label(axiom). [assumption].
% 1.13/1.48 78 -s(A,B,C,D,E,F,V6,V7) | -path(E,V8) | s(A,B,C,D,V8,F,V6,V7) # label(walk1) # label(axiom). [assumption].
% 1.13/1.48 79 -s(A,B,C,D,E,F,V6,V7) | -path(F,V8) | s(A,B,C,D,E,V8,V6,V7) # label(walk2) # label(axiom). [assumption].
% 1.13/1.48 82 path(p0_1,s1) # label(map4) # label(axiom). [assumption].
% 1.13/1.48 84 path(p1_2,s1) # label(map6) # label(axiom). [assumption].
% 1.13/1.48 85 path(s2,p1_2) # label(map7) # label(axiom). [assumption].
% 1.13/1.48 91 -s(A,B,C,D,E,F,A,V6) | s(truck1,B,C,D,E,F,A,V6) # label(load1) # label(axiom). [assumption].
% 1.13/1.48 92 s(A,B,C,D,E,F,A,V6) | -s(truck1,B,C,D,E,F,A,V6) # label(load2) # label(axiom). [assumption].
% 1.13/1.48 99 -s(A,B,C,D,E,F,C,V6) | s(A,B,truck1,D,E,F,C,V6) # label(load9) # label(axiom). [assumption].
% 1.13/1.48 100 s(A,B,C,D,E,F,C,V6) | -s(A,B,truck1,D,E,F,C,V6) # label(load10) # label(axiom). [assumption].
% 1.13/1.48 103 -s(A,B,C,D,E,F,D,V6) | s(A,B,C,truck1,E,F,D,V6) # label(load13) # label(axiom). [assumption].
% 1.13/1.48 104 s(A,B,C,D,E,F,D,V6) | -s(A,B,C,truck1,E,F,D,V6) # label(load14) # label(axiom). [assumption].
% 1.13/1.48 111 s(s1,s2,s2,s0,s2,s0,s1,s1) # label(init) # label(axiom). [assumption].
% 1.13/1.48 112 -s(s2,s2,s0,s2,s1,A,s0,B) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 1.13/1.48 126 -s(A,B,C,D,s2,E,E,F) | s(A,B,C,D,s2,truck1,E,F). [resolve(37,a,4,b)].
% 1.13/1.48 143 -s(A,B,C,D,E,truck1,s1,F) | s(A,B,C,D,E,truck1,s2,F). [resolve(69,a,72,b)].
% 1.13/1.48 151 -s(A,B,C,D,E,truck1,s2,F) | s(A,B,C,D,E,truck1,s0,F). [resolve(75,a,72,b)].
% 1.13/1.48 155 -s(A,B,C,D,E,truck1,s0,F) | s(A,B,C,D,E,truck1,s2,F). [resolve(76,a,72,b)].
% 1.13/1.48 158 -s(A,B,C,D,E,s0,F,V6) | s(A,B,C,D,E,p0_1,F,V6). [resolve(77,a,79,b)].
% 1.13/1.48 164 -s(A,B,C,D,E,p0_1,F,V6) | s(A,B,C,D,E,s1,F,V6). [resolve(82,a,79,b)].
% 1.13/1.48 167 -s(A,B,C,D,p1_2,E,F,V6) | s(A,B,C,D,s1,E,F,V6). [resolve(84,a,78,b)].
% 1.13/1.48 169 -s(A,B,C,D,s2,E,F,V6) | s(A,B,C,D,p1_2,E,F,V6). [resolve(85,a,78,b)].
% 1.13/1.48 182 s(truck1,s2,s2,s0,s2,s0,s1,s1). [ur(91,a,111,a)].
% 1.13/1.48 186 -s(s2,s2,truck1,s2,s1,A,s0,B) # answer(goal). [resolve(112,a,100,a)].
% 1.13/1.48 216 -s(s2,s2,truck1,s2,p1_2,A,s0,B) # answer(goal). [resolve(186,a,167,b)].
% 1.13/1.48 225 s(truck1,s2,s2,s0,s2,p0_1,s1,s1). [ur(158,a,182,a)].
% 1.13/1.48 292 s(truck1,s2,s2,s0,s2,s1,s1,s1). [ur(164,a,225,a)].
% 1.13/1.48 353 -s(s2,s2,truck1,s2,s2,A,s0,B) # answer(goal). [resolve(216,a,169,b)].
% 1.13/1.48 464 s(truck1,s2,s2,s0,s2,truck1,s1,s1). [ur(126,a,292,a)].
% 1.13/1.48 713 s(truck1,s2,s2,s0,s2,truck1,s2,s1). [ur(143,a,464,a)].
% 1.13/1.48 813 -s(s2,s2,truck1,s2,s2,truck1,s2,A) # answer(goal). [resolve(353,a,151,b)].
% 1.13/1.48 1091 s(truck1,s2,s2,s0,s2,truck1,s0,s1). [ur(151,a,713,a)].
% 1.13/1.48 1852 s(truck1,s2,s2,truck1,s2,truck1,s0,s1). [ur(103,a,1091,a)].
% 1.13/1.48 2568 -s(s2,s2,s2,s2,s2,truck1,s2,A) # answer(goal). [resolve(813,a,99,b)].
% 1.13/1.48 3615 s(truck1,s2,s2,truck1,s2,truck1,s2,s1). [ur(155,a,1852,a)].
% 1.13/1.48 7483 -s(truck1,s2,s2,s2,s2,truck1,s2,A) # answer(goal). [resolve(2568,a,92,a)].
% 1.13/1.48 7547 s(truck1,s2,s2,s2,s2,truck1,s2,s1). [ur(104,b,3615,a)].
% 1.13/1.48 7548 $F # answer(goal). [resolve(7547,a,7483,a)].
% 1.13/1.48
% 1.13/1.48 % SZS output end Refutation
% 1.13/1.48 ============================== end of proof ==========================
% 1.13/1.48
% 1.13/1.48 ============================== STATISTICS ============================
% 1.13/1.48
% 1.13/1.48 Given=2907. Generated=42289. Kept=7457. proofs=1.
% 1.13/1.48 Usable=2907. Sos=4538. Demods=0. Limbo=2, Disabled=189. Hints=0.
% 1.13/1.48 Megabytes=4.01.
% 1.13/1.48 User_CPU=0.62, System_CPU=0.04, Wall_clock=1.
% 1.13/1.48
% 1.13/1.48 ============================== end of statistics =====================
% 1.13/1.48
% 1.13/1.48 ============================== end of search =========================
% 1.13/1.48
% 1.13/1.48 THEOREM PROVED
% 1.13/1.48 % SZS status Unsatisfiable
% 1.13/1.48
% 1.13/1.48 Exiting with 1 proof.
% 1.13/1.48
% 1.13/1.48 Process 20118 exit (max_proofs) Tue May 31 20:40:45 2022
% 1.13/1.48 Prover9 interrupted
%------------------------------------------------------------------------------