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