TSTP Solution File: PLA031-1.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA031-1.002 : 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.91s 1.21s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n023.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 23:36:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 20926 was started by sandbox2 on n023.cluster.edu,
% 0.74/1.02 Tue May 31 23:36:42 2022
% 0.74/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20773_n023.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_20773_n023.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 (91 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 -neq(truck1,truck1) # label(neq1) # label(axiom). [assumption].
% 0.74/1.02 2 neq(truck1,truck2) # label(neq2) # label(axiom). [assumption].
% 0.74/1.02 3 neq(truck1,s0) # label(neq3) # label(axiom). [assumption].
% 0.74/1.02 4 neq(truck1,s1) # label(neq4) # label(axiom). [assumption].
% 0.74/1.02 5 neq(truck1,s2) # label(neq5) # label(axiom). [assumption].
% 0.74/1.02 6 neq(truck1,p1_0) # label(neq6) # label(axiom). [assumption].
% 0.74/1.02 7 neq(truck1,p2_1) # label(neq7) # label(axiom). [assumption].
% 0.74/1.02 8 neq(truck2,truck1) # label(neq8) # label(axiom). [assumption].
% 0.74/1.02 9 neq(truck2,s0) # label(neq10) # label(axiom). [assumption].
% 0.74/1.02 10 neq(truck2,s1) # label(neq11) # label(axiom). [assumption].
% 0.74/1.02 11 neq(truck2,s2) # label(neq12) # label(axiom). [assumption].
% 0.74/1.02 12 neq(truck2,p1_0) # label(neq13) # label(axiom). [assumption].
% 0.74/1.02 13 neq(truck2,p2_1) # label(neq14) # label(axiom). [assumption].
% 0.74/1.02 14 neq(s0,truck1) # label(neq15) # label(axiom). [assumption].
% 0.74/1.02 15 neq(s0,truck2) # label(neq16) # label(axiom). [assumption].
% 0.74/1.02 16 neq(s0,s1) # label(neq18) # label(axiom). [assumption].
% 0.74/1.02 17 neq(s0,s2) # label(neq19) # label(axiom). [assumption].
% 0.74/1.02 18 neq(s0,p1_0) # label(neq20) # label(axiom). [assumption].
% 0.74/1.02 19 neq(s0,p2_1) # label(neq21) # label(axiom). [assumption].
% 0.74/1.02 20 neq(s1,truck1) # label(neq22) # label(axiom). [assumption].
% 0.74/1.02 21 neq(s1,truck2) # label(neq23) # label(axiom). [assumption].
% 0.74/1.02 22 neq(s1,s0) # label(neq24) # label(axiom). [assumption].
% 0.74/1.02 23 neq(s1,s2) # label(neq26) # label(axiom). [assumption].
% 0.74/1.02 24 neq(s1,p1_0) # label(neq27) # label(axiom). [assumption].
% 0.74/1.02 25 neq(s1,p2_1) # label(neq28) # label(axiom). [assumption].
% 0.74/1.02 26 neq(s2,truck1) # label(neq29) # label(axiom). [assumption].
% 0.74/1.02 27 neq(s2,truck2) # label(neq30) # label(axiom). [assumption].
% 0.74/1.02 28 neq(s2,s0) # label(neq31) # label(axiom). [assumption].
% 0.74/1.02 29 neq(s2,s1) # label(neq32) # label(axiom). [assumption].
% 0.74/1.02 30 neq(s2,p1_0) # label(neq34) # label(axiom). [assumption].
% 0.74/1.02 31 neq(s2,p2_1) # label(neq35) # label(axiom). [assumption].
% 0.74/1.02 32 neq(p1_0,truck1) # label(neq36) # label(axiom). [assumption].
% 0.74/1.02 33 neq(p1_0,truck2) # label(neq37) # label(axiom). [assumption].
% 0.74/1.02 34 neq(p1_0,s0) # label(neq38) # label(axiom). [assumption].
% 0.74/1.02 35 neq(p1_0,s1) # label(neq39) # label(axiom). [assumption].
% 0.74/1.02 36 neq(p1_0,s2) # label(neq40) # label(axiom). [assumption].
% 0.74/1.02 37 neq(p1_0,p2_1) # label(neq42) # label(axiom). [assumption].
% 0.74/1.02 38 neq(p2_1,truck1) # label(neq43) # label(axiom). [assumption].
% 0.74/1.02 39 neq(p2_1,truck2) # label(neq44) # label(axiom). [assumption].
% 0.74/1.02 40 neq(p2_1,s0) # label(neq45) # label(axiom). [assumption].
% 0.74/1.02 41 neq(p2_1,s1) # label(neq46) # label(axiom). [assumption].
% 0.74/1.02 42 neq(p2_1,s2) # label(neq47) # label(axiom). [assumption].
% 0.74/1.02 43 neq(p2_1,p1_0) # label(neq48) # label(axiom). [assumption].
% 0.74/1.02 44 -neq(truck2,truck2) # label(neq9) # label(axiom). [assumption].
% 0.74/1.02 45 -neq(s0,s0) # label(neq17) # label(axiom). [assumption].
% 0.74/1.02 46 -neq(s1,s1) # label(neq25) # label(axiom). [assumption].
% 0.74/1.02 47 -neq(s2,s2) # label(neq33) # label(axiom). [assumption].
% 0.74/1.02 48 -neq(p1_0,p1_0) # label(neq41) # label(axiom). [assumption].
% 0.74/1.02 49 -neq(p2_1,p2_1) # label(neq49) # label(axiom). [assumption].
% 0.74/1.02 50 -s(A,B,C,D,E,D,F) | -neq(E,truck1) | s(A,B,C,truck1,E,D,F) # label(board1) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,D,truck2,D,E) | s(A,B,C,truck1,truck2,D,E). [resolve(50,b,8,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s0,D,E) | s(A,B,C,truck1,s0,D,E). [resolve(50,b,14,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s1,D,E) | s(A,B,C,truck1,s1,D,E). [resolve(50,b,20,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s2,D,E) | s(A,B,C,truck1,s2,D,E). [resolve(50,b,26,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p1_0,D,E) | s(A,B,C,truck1,p1_0,D,E). [resolve(50,b,32,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p2_1,D,E) | s(A,B,C,truck1,p2_1,D,E). [resolve(50,b,38,a)].
% 0.74/1.02 51 -s(A,B,C,D,E,F,D) | -neq(E,truck2) | s(A,B,C,truck2,E,F,D) # label(board3) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,E,D) | s(A,B,C,truck2,truck1,E,D). [resolve(51,b,2,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s0,E,D) | s(A,B,C,truck2,s0,E,D). [resolve(51,b,15,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s1,E,D) | s(A,B,C,truck2,s1,E,D). [resolve(51,b,21,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s2,E,D) | s(A,B,C,truck2,s2,E,D). [resolve(51,b,27,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p1_0,E,D) | s(A,B,C,truck2,p1_0,E,D). [resolve(51,b,33,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p2_1,E,D) | s(A,B,C,truck2,p2_1,E,D). [resolve(51,b,39,a)].
% 0.74/1.02 52 -s(A,B,C,D,E,E,F) | -neq(D,truck1) | s(A,B,C,D,truck1,E,F) # label(board5) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,D,E) | s(A,B,C,truck2,truck1,D,E). [resolve(52,b,8,a)].
% 0.74/1.02 Derived: -s(A,B,C,s0,D,D,E) | s(A,B,C,s0,truck1,D,E). [resolve(52,b,14,a)].
% 0.74/1.02 Derived: -s(A,B,C,s1,D,D,E) | s(A,B,C,s1,truck1,D,E). [resolve(52,b,20,a)].
% 0.74/1.02 Derived: -s(A,B,C,s2,D,D,E) | s(A,B,C,s2,truck1,D,E). [resolve(52,b,26,a)].
% 0.74/1.02 Derived: -s(A,B,C,p1_0,D,D,E) | s(A,B,C,p1_0,truck1,D,E). [resolve(52,b,32,a)].
% 0.74/1.02 Derived: -s(A,B,C,p2_1,D,D,E) | s(A,B,C,p2_1,truck1,D,E). [resolve(52,b,38,a)].
% 0.74/1.02 53 -s(A,B,C,D,E,F,E) | -neq(D,truck2) | s(A,B,C,D,truck2,F,E) # label(board7) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,E,D) | s(A,B,C,truck1,truck2,E,D). [resolve(53,b,2,a)].
% 0.74/1.02 Derived: -s(A,B,C,s0,D,E,D) | s(A,B,C,s0,truck2,E,D). [resolve(53,b,15,a)].
% 0.74/1.02 Derived: -s(A,B,C,s1,D,E,D) | s(A,B,C,s1,truck2,E,D). [resolve(53,b,21,a)].
% 0.74/1.02 Derived: -s(A,B,C,s2,D,E,D) | s(A,B,C,s2,truck2,E,D). [resolve(53,b,27,a)].
% 0.74/1.02 Derived: -s(A,B,C,p1_0,D,E,D) | s(A,B,C,p1_0,truck2,E,D). [resolve(53,b,33,a)].
% 0.74/1.02 Derived: -s(A,B,C,p2_1,D,E,D) | s(A,B,C,p2_1,truck2,E,D). [resolve(53,b,39,a)].
% 0.74/1.02 54 -s(A,B,C,D,E,F,V6) | -path(D,V7) | s(A,B,C,V7,E,F,V6) # label(walk1) # label(axiom). [assumption].
% 0.74/1.02 55 path(s1,p1_0) # label(map1) # label(axiom). [assumption].
% 0.74/1.02 56 path(p1_0,s1) # label(map2) # label(axiom). [assumption].
% 0.74/1.02 57 path(s0,p1_0) # label(map3) # label(axiom). [assumption].
% 0.74/1.02 58 path(p1_0,s0) # label(map4) # label(axiom). [assumption].
% 0.74/1.02 59 path(s2,p2_1) # label(map5) # label(axiom). [assumption].
% 0.74/1.02 60 path(p2_1,s2) # label(map6) # label(axiom). [assumption].
% 0.74/1.02 61 path(s1,p2_1) # label(map7) # label(axiom). [assumption].
% 0.74/1.02 62 path(p2_1,s1) # label(map8) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,s1,D,E,F) | s(A,B,C,p1_0,D,E,F). [resolve(54,b,55,a)].
% 0.74/1.02 Derived: -s(A,B,C,p1_0,D,E,F) | s(A,B,C,s1,D,E,F). [resolve(54,b,56,a)].
% 0.74/1.02 Derived: -s(A,B,C,s0,D,E,F) | s(A,B,C,p1_0,D,E,F). [resolve(54,b,57,a)].
% 0.74/1.02 Derived: -s(A,B,C,p1_0,D,E,F) | s(A,B,C,s0,D,E,F). [resolve(54,b,58,a)].
% 0.74/1.02 Derived: -s(A,B,C,s2,D,E,F) | s(A,B,C,p2_1,D,E,F). [resolve(54,b,59,a)].
% 0.74/1.02 Derived: -s(A,B,C,p2_1,D,E,F) | s(A,B,C,s2,D,E,F). [resolve(54,b,60,a)].
% 0.74/1.02 Derived: -s(A,B,C,s1,D,E,F) | s(A,B,C,p2_1,D,E,F). [resolve(54,b,61,a)].
% 0.74/1.02 Derived: -s(A,B,C,p2_1,D,E,F) | s(A,B,C,s1,D,E,F). [resolve(54,b,62,a)].
% 0.74/1.02 63 -s(A,B,C,D,E,F,V6) | -path(E,V7) | s(A,B,C,D,V7,F,V6) # label(walk2) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,D,s1,E,F) | s(A,B,C,D,p1_0,E,F). [resolve(63,b,55,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p1_0,E,F) | s(A,B,C,D,s1,E,F). [resolve(63,b,56,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s0,E,F) | s(A,B,C,D,p1_0,E,F). [resolve(63,b,57,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p1_0,E,F) | s(A,B,C,D,s0,E,F). [resolve(63,b,58,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s2,E,F) | s(A,B,C,D,p2_1,E,F). [resolve(63,b,59,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p2_1,E,F) | s(A,B,C,D,s2,E,F). [resolve(63,b,60,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,s1,E,F) | s(A,B,C,D,p2_1,E,F). [resolve(63,b,61,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,p2_1,E,F) | s(A,B,C,D,s1,E,F). [resolve(63,b,62,a)].
% 0.74/1.02 64 -s(A,B,C,truck1,D,E,F) | -link(E,V6) | s(A,B,C,truck1,D,V6,F) # label(drive1) # label(axiom). [assumption].
% 0.74/1.02 65 link(s0,s1) # label(map9) # label(axiom). [assumption].
% 0.74/1.02 66 link(s1,s0) # label(map10) # label(axiom). [assumption].
% 0.74/1.02 67 link(s1,s2) # label(map11) # label(axiom). [assumption].
% 0.74/1.02 68 link(s2,s1) # label(map12) # label(axiom). [assumption].
% 0.74/1.02 69 link(s2,s0) # label(map13) # label(axiom). [assumption].
% 0.74/1.02 70 link(s0,s2) # label(map14) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s0,E) | s(A,B,C,truck1,D,s1,E). [resolve(64,b,65,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s1,E) | s(A,B,C,truck1,D,s0,E). [resolve(64,b,66,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s1,E) | s(A,B,C,truck1,D,s2,E). [resolve(64,b,67,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s2,E) | s(A,B,C,truck1,D,s1,E). [resolve(64,b,68,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s2,E) | s(A,B,C,truck1,D,s0,E). [resolve(64,b,69,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck1,D,s0,E) | s(A,B,C,truck1,D,s2,E). [resolve(64,b,70,a)].
% 0.74/1.02 71 -s(A,B,C,truck2,D,E,F) | -link(F,V6) | s(A,B,C,truck2,D,E,V6) # label(drive2) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s0) | s(A,B,C,truck2,D,E,s1). [resolve(71,b,65,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s1) | s(A,B,C,truck2,D,E,s0). [resolve(71,b,66,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s1) | s(A,B,C,truck2,D,E,s2). [resolve(71,b,67,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s2) | s(A,B,C,truck2,D,E,s1). [resolve(71,b,68,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s2) | s(A,B,C,truck2,D,E,s0). [resolve(71,b,69,a)].
% 0.74/1.02 Derived: -s(A,B,C,truck2,D,E,s0) | s(A,B,C,truck2,D,E,s2). [resolve(71,b,70,a)].
% 0.74/1.02 72 -s(A,B,C,D,truck1,E,F) | -link(E,V6) | s(A,B,C,D,truck1,V6,F) # label(drive3) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s0,E) | s(A,B,C,D,truck1,s1,E). [resolve(72,b,65,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s1,E) | s(A,B,C,D,truck1,s0,E). [resolve(72,b,66,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s1,E) | s(A,B,C,D,truck1,s2,E). [resolve(72,b,67,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s2,E) | s(A,B,C,D,truck1,s1,E). [resolve(72,b,68,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s2,E) | s(A,B,C,D,truck1,s0,E). [resolve(72,b,69,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck1,s0,E) | s(A,B,C,D,truck1,s2,E). [resolve(72,b,70,a)].
% 0.74/1.02 73 -s(A,B,C,D,truck2,E,F) | -link(F,V6) | s(A,B,C,D,truck2,E,V6) # label(drive4) # label(axiom). [assumption].
% 0.74/1.02 Derived: -s(A,B,C,D,truck2,E,s0) | s(A,B,C,D,truck2,E,s1). [resolve(73,b,65,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck2,E,s1) | s(A,B,C,D,truck2,E,s0). [resolve(73,b,66,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck2,E,s1) | s(A,B,C,D,truck2,E,s2). [resolve(73,b,67,a)].
% 0.74/1.02 Derived: -s(A,B,C,D,truck2,E,s2) | s(A,B,C,D,truck2,E,s1). [resolve(73,b,68,a)].
% 0.91/1.21 Derived: -s(A,B,C,D,truck2,E,s2) | s(A,B,C,D,truck2,E,s0). [resolve(73,b,69,a)].
% 0.91/1.21 Derived: -s(A,B,C,D,truck2,E,s0) | s(A,B,C,D,truck2,E,s2). [resolve(73,b,70,a)].
% 0.91/1.21
% 0.91/1.21 ============================== end predicate elimination =============
% 0.91/1.21
% 0.91/1.21 Auto_denials:
% 0.91/1.21 % copying label goal to answer in negative clause
% 0.91/1.21
% 0.91/1.21 Term ordering decisions:
% 0.91/1.21 Function symbol KB weights: truck1=1. truck2=1. s1=1. s0=1. s2=1. p1_0=1. p2_1=1.
% 0.91/1.21
% 0.91/1.21 ============================== end of process initial clauses ========
% 0.91/1.21
% 0.91/1.21 ============================== CLAUSES FOR SEARCH ====================
% 0.91/1.21
% 0.91/1.21 ============================== end of clauses for search =============
% 0.91/1.21
% 0.91/1.21 ============================== SEARCH ================================
% 0.91/1.21
% 0.91/1.21 % Starting search at 0.02 seconds.
% 0.91/1.21
% 0.91/1.21 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 34 (0.00 of 0.12 sec).
% 0.91/1.21
% 0.91/1.21 ============================== PROOF =================================
% 0.91/1.21 % SZS status Unsatisfiable
% 0.91/1.21 % SZS output start Refutation
% 0.91/1.21
% 0.91/1.21 % Proof 1 at 0.18 (+ 0.02) seconds: goal.
% 0.91/1.21 % Length of proof is 38.
% 0.91/1.21 % Level of proof is 10.
% 0.91/1.21 % Maximum clause weight is 16.000.
% 0.91/1.21 % Given clauses 973.
% 0.91/1.21
% 0.91/1.21 20 neq(s1,truck1) # label(neq22) # label(axiom). [assumption].
% 0.91/1.21 50 -s(A,B,C,D,E,D,F) | -neq(E,truck1) | s(A,B,C,truck1,E,D,F) # label(board1) # label(axiom). [assumption].
% 0.91/1.21 54 -s(A,B,C,D,E,F,V6) | -path(D,V7) | s(A,B,C,V7,E,F,V6) # label(walk1) # label(axiom). [assumption].
% 0.91/1.21 60 path(p2_1,s2) # label(map6) # label(axiom). [assumption].
% 0.91/1.21 61 path(s1,p2_1) # label(map7) # label(axiom). [assumption].
% 0.91/1.21 64 -s(A,B,C,truck1,D,E,F) | -link(E,V6) | s(A,B,C,truck1,D,V6,F) # label(drive1) # label(axiom). [assumption].
% 0.91/1.21 66 link(s1,s0) # label(map10) # label(axiom). [assumption].
% 0.91/1.21 68 link(s2,s1) # label(map12) # label(axiom). [assumption].
% 0.91/1.21 70 link(s0,s2) # label(map14) # label(axiom). [assumption].
% 0.91/1.21 74 s(s1,s1,s1,s1,s1,s2,s0) # label(init) # label(axiom). [assumption].
% 0.91/1.21 75 -s(s0,s0,s2,s2,A,s2,B) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.91/1.21 76 -s(A,B,C,D,E,A,F) | s(truck1,B,C,D,E,A,F) # label(load1) # label(axiom). [assumption].
% 0.91/1.21 77 s(A,B,C,D,E,A,F) | -s(truck1,B,C,D,E,A,F) # label(load2) # label(axiom). [assumption].
% 0.91/1.21 80 -s(A,B,C,D,E,B,F) | s(A,truck1,C,D,E,B,F) # label(load5) # label(axiom). [assumption].
% 0.91/1.21 81 s(A,B,C,D,E,B,F) | -s(A,truck1,C,D,E,B,F) # label(load6) # label(axiom). [assumption].
% 0.91/1.21 84 -s(A,B,C,D,E,C,F) | s(A,B,truck1,D,E,C,F) # label(load9) # label(axiom). [assumption].
% 0.91/1.21 85 s(A,B,C,D,E,C,F) | -s(A,B,truck1,D,E,C,F) # label(load10) # label(axiom). [assumption].
% 0.91/1.21 88 s(A,B,C,D,E,D,F) | -s(A,B,C,truck1,E,D,F) # label(board2) # label(axiom). [assumption].
% 0.91/1.21 94 -s(A,B,C,D,s1,D,E) | s(A,B,C,truck1,s1,D,E). [resolve(50,b,20,a)].
% 0.91/1.21 121 -s(A,B,C,p2_1,D,E,F) | s(A,B,C,s2,D,E,F). [resolve(54,b,60,a)].
% 0.91/1.21 122 -s(A,B,C,s1,D,E,F) | s(A,B,C,p2_1,D,E,F). [resolve(54,b,61,a)].
% 0.91/1.21 133 -s(A,B,C,truck1,D,s1,E) | s(A,B,C,truck1,D,s0,E). [resolve(64,b,66,a)].
% 0.91/1.21 135 -s(A,B,C,truck1,D,s2,E) | s(A,B,C,truck1,D,s1,E). [resolve(64,b,68,a)].
% 0.91/1.21 137 -s(A,B,C,truck1,D,s0,E) | s(A,B,C,truck1,D,s2,E). [resolve(64,b,70,a)].
% 0.91/1.21 158 -s(s0,s0,truck1,s2,A,s2,B) # answer(goal). [resolve(85,a,75,a)].
% 0.91/1.21 164 s(s1,s1,s1,p2_1,s1,s2,s0). [ur(122,a,74,a)].
% 0.91/1.21 188 -s(s0,s0,truck1,truck1,A,s2,B) # answer(goal). [resolve(158,a,88,a)].
% 0.91/1.21 207 s(s1,s1,s1,s2,s1,s2,s0). [ur(121,a,164,a)].
% 0.91/1.21 263 s(s1,s1,s1,truck1,s1,s2,s0). [ur(94,a,207,a)].
% 0.91/1.21 333 -s(s0,s0,truck1,truck1,A,s0,B) # answer(goal). [resolve(188,a,137,b)].
% 0.91/1.21 339 s(s1,s1,s1,truck1,s1,s1,s0). [ur(135,a,263,a)].
% 0.91/1.21 448 s(s1,s1,truck1,truck1,s1,s1,s0). [ur(84,a,339,a)].
% 0.91/1.21 697 s(s1,truck1,truck1,truck1,s1,s1,s0). [ur(80,a,448,a)].
% 0.91/1.21 888 -s(s0,truck1,truck1,truck1,A,s0,B) # answer(goal). [resolve(333,a,81,a)].
% 0.91/1.21 1297 s(truck1,truck1,truck1,truck1,s1,s1,s0). [ur(76,a,697,a)].
% 0.91/1.21 2513 -s(truck1,truck1,truck1,truck1,A,s0,B) # answer(goal). [resolve(888,a,77,a)].
% 0.91/1.21 2630 s(truck1,truck1,truck1,truck1,s1,s0,s0). [ur(133,a,1297,a)].
% 0.91/1.21 2631 $F # answer(goal). [resolve(2630,a,2513,a)].
% 0.91/1.21
% 0.91/1.21 % SZS output end Refutation
% 0.91/1.21 ============================== end of proof ==========================
% 0.91/1.21
% 0.91/1.21 ============================== STATISTICS ============================
% 0.91/1.21
% 0.91/1.21 Given=973. Generated=13830. Kept=2557. proofs=1.
% 0.91/1.21 Usable=965. Sos=1552. Demods=0. Limbo=1, Disabled=193. Hints=0.
% 0.91/1.21 Megabytes=1.34.
% 0.91/1.21 User_CPU=0.18, System_CPU=0.02, Wall_clock=0.
% 0.91/1.21
% 0.91/1.21 ============================== end of statistics =====================
% 0.91/1.21
% 0.91/1.21 ============================== end of search =========================
% 0.91/1.21
% 0.91/1.21 THEOREM PROVED
% 0.91/1.21 % SZS status Unsatisfiable
% 0.91/1.21
% 0.91/1.21 Exiting with 1 proof.
% 0.91/1.21
% 0.91/1.21 Process 20926 exit (max_proofs) Tue May 31 23:36:42 2022
% 0.91/1.21 Prover9 interrupted
%------------------------------------------------------------------------------