TSTP Solution File: PUZ030-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ030-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 18:23:53 EDT 2022
% Result : Unsatisfiable 0.73s 1.04s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ030-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat May 28 19:45:21 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 10780 was started by sandbox on n024.cluster.edu,
% 0.43/0.99 Sat May 28 19:45:22 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10419_n024.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_10419_n024.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (43 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 1 -neither(A) | -salt(A) # label(neither2) # label(axiom). [assumption].
% 0.43/0.99 2 salt(A) | mustard(A) | neither(A) # label(neither4) # label(axiom). [assumption].
% 0.43/0.99 3 -oneof(A) | -salt(A) | -mustard(A) # label(oneof4) # label(axiom). [assumption].
% 0.43/0.99 4 -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -salt(mill) | -mustard(lang) | -oneof(mill) # label(prove_who_takes_what) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | -oneof(mill) | mustard(mill) | neither(mill). [resolve(4,e,2,a)].
% 0.43/0.99 5 -both(A) | salt(A) # label(both1) # label(axiom). [assumption].
% 0.43/0.99 Derived: -both(A) | -neither(A). [resolve(5,b,1,b)].
% 0.43/0.99 Derived: -both(A) | -oneof(A) | -mustard(A). [resolve(5,b,3,b)].
% 0.43/0.99 Derived: -both(mill) | -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | -oneof(mill). [resolve(5,b,4,e)].
% 0.43/0.99 6 -oneof(cole) | salt(barry) # label(rule1_2) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -oneof(cole) | -neither(barry). [resolve(6,b,1,b)].
% 0.43/0.99 Derived: -oneof(cole) | -oneof(barry) | -mustard(barry). [resolve(6,b,3,b)].
% 0.43/0.99 7 -oneof(lang) | salt(barry) # label(rule1_3) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -oneof(lang) | -neither(barry). [resolve(7,b,1,b)].
% 0.43/0.99 Derived: -oneof(lang) | -oneof(barry) | -mustard(barry). [resolve(7,b,3,b)].
% 0.43/0.99 8 -oneof(barry) | salt(cole) # label(rule3_2) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -oneof(barry) | -neither(cole). [resolve(8,b,1,b)].
% 0.43/0.99 Derived: -oneof(barry) | -oneof(cole) | -mustard(cole). [resolve(8,b,3,b)].
% 0.43/0.99 9 -neither(mill) | salt(cole) # label(rule3_3) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -neither(mill) | -neither(cole). [resolve(9,b,1,b)].
% 0.43/0.99 Derived: -neither(mill) | -oneof(cole) | -mustard(cole). [resolve(9,b,3,b)].
% 0.43/0.99 10 -neither(barry) | salt(dix) # label(rule5_2) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -neither(barry) | -neither(dix). [resolve(10,b,1,b)].
% 0.43/0.99 Derived: -neither(barry) | -oneof(dix) | -mustard(dix). [resolve(10,b,3,b)].
% 0.43/0.99 11 -both(cole) | salt(dix) # label(rule5_3) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -both(cole) | -neither(dix). [resolve(11,b,1,b)].
% 0.43/0.99 Derived: -both(cole) | -oneof(dix) | -mustard(dix). [resolve(11,b,3,b)].
% 0.43/0.99 12 -oneof(barry) | salt(lang) # label(rule7_2) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -oneof(barry) | -neither(lang). [resolve(12,b,1,b)].
% 0.43/0.99 Derived: -oneof(barry) | -oneof(lang) | -mustard(lang). [resolve(12,b,3,b)].
% 0.43/0.99 13 -oneof(dix) | salt(lang) # label(rule7_3) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -oneof(dix) | -neither(lang). [resolve(13,b,1,b)].
% 0.43/0.99 Derived: -oneof(dix) | -oneof(lang) | -mustard(lang). [resolve(13,b,3,b)].
% 0.43/0.99 14 -both(barry) | salt(mill) # label(rule9_2) # label(hypothesis). [assumption].
% 0.43/0.99 Derived: -both(barry) | -neither(mill). [resolve(14,b,1,b)].
% 0.43/1.00 Derived: -both(barry) | -oneof(mill) | -mustard(mill). [resolve(14,b,3,b)].
% 0.43/1.00 Derived: -both(barry) | -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | -oneof(mill). [resolve(14,b,4,e)].
% 0.43/1.00 15 -salt(A) | -mustard(A) | both(A) # label(both3) # label(axiom). [assumption].
% 0.43/1.00 Derived: -mustard(barry) | both(barry) | -oneof(cole). [resolve(15,a,6,b)].
% 0.43/1.00 Derived: -mustard(barry) | both(barry) | -oneof(lang). [resolve(15,a,7,b)].
% 0.43/1.00 Derived: -mustard(cole) | both(cole) | -oneof(barry). [resolve(15,a,8,b)].
% 0.43/1.00 Derived: -mustard(cole) | both(cole) | -neither(mill). [resolve(15,a,9,b)].
% 0.43/1.00 Derived: -mustard(dix) | both(dix) | -neither(barry). [resolve(15,a,10,b)].
% 0.43/1.00 Derived: -mustard(dix) | both(dix) | -both(cole). [resolve(15,a,11,b)].
% 0.43/1.00 Derived: -mustard(lang) | both(lang) | -oneof(barry). [resolve(15,a,12,b)].
% 0.43/1.00 Derived: -mustard(lang) | both(lang) | -oneof(dix). [resolve(15,a,13,b)].
% 0.43/1.00 Derived: -mustard(mill) | both(mill) | -both(barry). [resolve(15,a,14,b)].
% 0.43/1.00 16 -oneof(A) | salt(A) | mustard(A) # label(oneof1) # label(axiom). [assumption].
% 0.43/1.00 Derived: -oneof(A) | mustard(A) | -neither(A). [resolve(16,b,1,b)].
% 0.43/1.00 17 -salt(barry) | oneof(cole) | oneof(lang) # label(rule1_1) # label(hypothesis). [assumption].
% 0.43/1.00 Derived: oneof(cole) | oneof(lang) | mustard(barry) | neither(barry). [resolve(17,a,2,a)].
% 0.43/1.00 Derived: oneof(cole) | oneof(lang) | -both(barry). [resolve(17,a,5,b)].
% 0.43/1.00 Derived: oneof(cole) | oneof(lang) | -oneof(barry) | mustard(barry). [resolve(17,a,16,b)].
% 0.43/1.00 18 -salt(cole) | oneof(barry) | neither(mill) # label(rule3_1) # label(hypothesis). [assumption].
% 0.43/1.00 Derived: oneof(barry) | neither(mill) | mustard(cole) | neither(cole). [resolve(18,a,2,a)].
% 0.43/1.00 Derived: oneof(barry) | neither(mill) | -both(cole). [resolve(18,a,5,b)].
% 0.43/1.00 Derived: oneof(barry) | neither(mill) | -oneof(cole) | mustard(cole). [resolve(18,a,16,b)].
% 0.43/1.00 19 -salt(dix) | neither(barry) | both(cole) # label(rule5_1) # label(hypothesis). [assumption].
% 0.43/1.00 Derived: neither(barry) | both(cole) | mustard(dix) | neither(dix). [resolve(19,a,2,a)].
% 0.43/1.00 Derived: neither(barry) | both(cole) | -both(dix). [resolve(19,a,5,b)].
% 0.43/1.00 Derived: neither(barry) | both(cole) | -oneof(dix) | mustard(dix). [resolve(19,a,16,b)].
% 0.43/1.00 20 -salt(lang) | oneof(barry) | oneof(dix) # label(rule7_1) # label(hypothesis). [assumption].
% 0.43/1.00 Derived: oneof(barry) | oneof(dix) | mustard(lang) | neither(lang). [resolve(20,a,2,a)].
% 0.43/1.00 Derived: oneof(barry) | oneof(dix) | -both(lang). [resolve(20,a,5,b)].
% 0.43/1.00 Derived: oneof(barry) | oneof(dix) | -oneof(lang) | mustard(lang). [resolve(20,a,16,b)].
% 0.43/1.00 21 -salt(mill) | both(barry) | both(lang) # label(rule9_1) # label(hypothesis). [assumption].
% 0.43/1.00 Derived: both(barry) | both(lang) | mustard(mill) | neither(mill). [resolve(21,a,2,a)].
% 0.43/1.00 Derived: both(barry) | both(lang) | -both(mill). [resolve(21,a,5,b)].
% 0.43/1.00 Derived: both(barry) | both(lang) | -oneof(mill) | mustard(mill). [resolve(21,a,16,b)].
% 0.43/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 0.43/1.00
% 0.43/1.00 Auto_denials: (non-Horn, no changes).
% 0.43/1.00
% 0.43/1.00 Term ordering decisions:
% 0.73/1.04 Function symbol KB weights: barry=1. lang=1. cole=1. mill=1. dix=1.
% 0.73/1.04
% 0.73/1.04 ============================== end of process initial clauses ========
% 0.73/1.04
% 0.73/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.04
% 0.73/1.04 ============================== end of clauses for search =============
% 0.73/1.04
% 0.73/1.04 ============================== SEARCH ================================
% 0.73/1.04
% 0.73/1.04 % Starting search at 0.02 seconds.
% 0.73/1.04
% 0.73/1.04 ============================== PROOF =================================
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04 % SZS output start Refutation
% 0.73/1.04
% 0.73/1.04 % Proof 1 at 0.05 (+ 0.01) seconds.
% 0.73/1.04 % Length of proof is 187.
% 0.73/1.04 % Level of proof is 49.
% 0.73/1.04 % Maximum clause weight is 18.000.
% 0.73/1.04 % Given clauses 399.
% 0.73/1.04
% 0.73/1.04 1 -neither(A) | -salt(A) # label(neither2) # label(axiom). [assumption].
% 0.73/1.04 2 salt(A) | mustard(A) | neither(A) # label(neither4) # label(axiom). [assumption].
% 0.73/1.04 3 -oneof(A) | -salt(A) | -mustard(A) # label(oneof4) # label(axiom). [assumption].
% 0.73/1.04 4 -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -salt(mill) | -mustard(lang) | -oneof(mill) # label(prove_who_takes_what) # label(negated_conjecture). [assumption].
% 0.73/1.04 5 -both(A) | salt(A) # label(both1) # label(axiom). [assumption].
% 0.73/1.04 6 -oneof(cole) | salt(barry) # label(rule1_2) # label(hypothesis). [assumption].
% 0.73/1.04 7 -oneof(lang) | salt(barry) # label(rule1_3) # label(hypothesis). [assumption].
% 0.73/1.04 8 -oneof(barry) | salt(cole) # label(rule3_2) # label(hypothesis). [assumption].
% 0.73/1.04 9 -neither(mill) | salt(cole) # label(rule3_3) # label(hypothesis). [assumption].
% 0.73/1.04 11 -both(cole) | salt(dix) # label(rule5_3) # label(hypothesis). [assumption].
% 0.73/1.04 12 -oneof(barry) | salt(lang) # label(rule7_2) # label(hypothesis). [assumption].
% 0.73/1.04 13 -oneof(dix) | salt(lang) # label(rule7_3) # label(hypothesis). [assumption].
% 0.73/1.04 14 -both(barry) | salt(mill) # label(rule9_2) # label(hypothesis). [assumption].
% 0.73/1.04 15 -salt(A) | -mustard(A) | both(A) # label(both3) # label(axiom). [assumption].
% 0.73/1.04 16 -oneof(A) | salt(A) | mustard(A) # label(oneof1) # label(axiom). [assumption].
% 0.73/1.04 17 -salt(barry) | oneof(cole) | oneof(lang) # label(rule1_1) # label(hypothesis). [assumption].
% 0.73/1.04 18 -salt(cole) | oneof(barry) | neither(mill) # label(rule3_1) # label(hypothesis). [assumption].
% 0.73/1.04 19 -salt(dix) | neither(barry) | both(cole) # label(rule5_1) # label(hypothesis). [assumption].
% 0.73/1.04 21 -salt(mill) | both(barry) | both(lang) # label(rule9_1) # label(hypothesis). [assumption].
% 0.73/1.04 22 both(A) | neither(A) | oneof(A) # label(one_condition_holds1) # label(axiom). [assumption].
% 0.73/1.04 23 -oneof(A) | -both(A) # label(oneof2) # label(axiom). [assumption].
% 0.73/1.04 24 -oneof(A) | -neither(A) # label(oneof3) # label(axiom). [assumption].
% 0.73/1.04 25 -both(A) | -neither(A) # label(neither1) # label(axiom). [assumption].
% 0.73/1.04 26 -neither(A) | -mustard(A) # label(neither3) # label(axiom). [assumption].
% 0.73/1.04 27 -both(A) | mustard(A) # label(both2) # label(axiom). [assumption].
% 0.73/1.04 28 -neither(dix) | mustard(barry) # label(rule2_2) # label(hypothesis). [assumption].
% 0.73/1.04 30 -both(dix) | mustard(cole) # label(rule4_2) # label(hypothesis). [assumption].
% 0.73/1.04 31 -both(lang) | mustard(cole) # label(rule4_3) # label(hypothesis). [assumption].
% 0.73/1.04 32 -neither(lang) | mustard(dix) # label(rule6_2) # label(hypothesis). [assumption].
% 0.73/1.04 33 -neither(mill) | mustard(dix) # label(rule6_3) # label(hypothesis). [assumption].
% 0.73/1.04 34 -neither(cole) | mustard(lang) # label(rule8_2) # label(hypothesis). [assumption].
% 0.73/1.04 35 -neither(mill) | mustard(lang) # label(rule8_3) # label(hypothesis). [assumption].
% 0.73/1.04 36 -both(lang) | mustard(mill) # label(rule9_3) # label(hypothesis). [assumption].
% 0.73/1.04 37 -oneof(cole) | mustard(mill) # label(rule10_2) # label(hypothesis). [assumption].
% 0.73/1.04 38 -oneof(dix) | mustard(mill) # label(rule10_3) # label(hypothesis). [assumption].
% 0.73/1.04 39 -mustard(barry) | neither(dix) | both(mill) # label(rule2_1) # label(hypothesis). [assumption].
% 0.73/1.04 40 -mustard(cole) | both(dix) | both(lang) # label(rule4_1) # label(hypothesis). [assumption].
% 0.73/1.04 41 -mustard(dix) | neither(lang) | neither(mill) # label(rule6_1) # label(hypothesis). [assumption].
% 0.73/1.04 42 -mustard(lang) | neither(cole) | neither(mill) # label(rule8_1) # label(hypothesis). [assumption].
% 0.73/1.04 43 -mustard(mill) | oneof(cole) | oneof(dix) # label(rule10_1) # label(hypothesis). [assumption].
% 0.73/1.04 45 -oneof(cole) | -neither(barry). [resolve(6,b,1,b)].
% 0.73/1.04 47 -oneof(lang) | -neither(barry). [resolve(7,b,1,b)].
% 0.73/1.04 48 -oneof(lang) | -oneof(barry) | -mustard(barry). [resolve(7,b,3,b)].
% 0.73/1.04 49 -oneof(barry) | -neither(cole). [resolve(8,b,1,b)].
% 0.73/1.04 55 -both(cole) | -neither(dix). [resolve(11,b,1,b)].
% 0.73/1.04 57 -oneof(barry) | -neither(lang). [resolve(12,b,1,b)].
% 0.73/1.04 59 -oneof(dix) | -neither(lang). [resolve(13,b,1,b)].
% 0.73/1.04 61 -both(barry) | -neither(mill). [resolve(14,b,1,b)].
% 0.73/1.04 63 -both(barry) | -neither(cole) | -neither(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | -oneof(mill). [resolve(14,b,4,e)].
% 0.73/1.04 64 -both(barry) | -neither(cole) | -neither(dix) | -oneof(lang) | -mustard(lang) | -oneof(mill). [copy(63),merge(d)].
% 0.73/1.04 65 -mustard(barry) | both(barry) | -oneof(cole). [resolve(15,a,6,b)].
% 0.73/1.04 67 -mustard(cole) | both(cole) | -oneof(barry). [resolve(15,a,8,b)].
% 0.73/1.04 68 -mustard(cole) | both(cole) | -neither(mill). [resolve(15,a,9,b)].
% 0.73/1.04 71 -mustard(lang) | both(lang) | -oneof(barry). [resolve(15,a,12,b)].
% 0.73/1.04 75 oneof(cole) | oneof(lang) | -both(barry). [resolve(17,a,5,b)].
% 0.73/1.04 77 oneof(barry) | neither(mill) | mustard(cole) | neither(cole). [resolve(18,a,2,a)].
% 0.73/1.04 78 oneof(barry) | neither(mill) | -both(cole). [resolve(18,a,5,b)].
% 0.73/1.04 80 neither(barry) | both(cole) | mustard(dix) | neither(dix). [resolve(19,a,2,a)].
% 0.73/1.04 81 neither(barry) | both(cole) | -both(dix). [resolve(19,a,5,b)].
% 0.73/1.04 82 neither(barry) | both(cole) | -oneof(dix) | mustard(dix). [resolve(19,a,16,b)].
% 0.73/1.04 86 both(barry) | both(lang) | mustard(mill) | neither(mill). [resolve(21,a,2,a)].
% 0.73/1.04 89 -mustard(A) | both(A) | oneof(A). [resolve(26,a,22,b)].
% 0.73/1.04 90 mustard(barry) | both(dix) | oneof(dix). [resolve(28,a,22,b)].
% 0.73/1.04 91 mustard(dix) | both(lang) | oneof(lang). [resolve(32,a,22,b)].
% 0.73/1.04 92 mustard(dix) | both(mill) | oneof(mill). [resolve(33,a,22,b)].
% 0.73/1.04 93 mustard(lang) | both(cole) | oneof(cole). [resolve(34,a,22,b)].
% 0.73/1.04 95 -oneof(cole) | both(barry) | oneof(barry). [resolve(45,b,22,b)].
% 0.73/1.04 96 -oneof(lang) | both(barry) | oneof(barry). [resolve(47,b,22,b)].
% 0.73/1.04 97 -oneof(barry) | both(cole) | oneof(cole). [resolve(49,b,22,b)].
% 0.73/1.04 103 -oneof(barry) | both(lang) | oneof(lang). [resolve(57,b,22,b)].
% 0.73/1.04 112 oneof(barry) | mustard(cole) | neither(cole) | mustard(lang). [resolve(77,b,35,a)].
% 0.73/1.04 113 oneof(barry) | mustard(cole) | neither(cole) | mustard(dix). [resolve(77,b,33,a)].
% 0.73/1.04 117 neither(barry) | both(cole) | mustard(dix) | -both(barry) | -neither(cole) | -oneof(lang) | -mustard(lang) | -oneof(mill). [resolve(80,d,64,c)].
% 0.73/1.04 118 neither(barry) | both(cole) | mustard(dix) | mustard(barry). [resolve(80,d,28,a)].
% 0.73/1.04 122 both(barry) | both(lang) | mustard(mill) | mustard(lang). [resolve(86,d,35,a)].
% 0.73/1.04 126 mustard(barry) | both(dix) | mustard(mill). [resolve(90,c,38,a)].
% 0.73/1.04 132 mustard(lang) | both(cole) | mustard(mill). [resolve(93,c,37,a)].
% 0.73/1.04 133 both(barry) | oneof(barry) | mustard(lang) | both(cole). [resolve(95,a,93,c)].
% 0.73/1.04 139 mustard(barry) | mustard(mill) | mustard(cole). [resolve(126,b,30,a)].
% 0.73/1.04 142 mustard(lang) | mustard(mill) | oneof(barry) | neither(mill). [resolve(132,b,78,c)].
% 0.73/1.04 150 oneof(barry) | mustard(cole) | mustard(lang). [resolve(112,c,34,a),merge(d)].
% 0.73/1.04 151 mustard(cole) | mustard(lang) | both(lang) | oneof(lang). [resolve(150,a,103,a)].
% 0.73/1.04 157 neither(barry) | both(cole) | mustard(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | -oneof(mill) | oneof(barry) | mustard(cole). [resolve(117,e,113,c),merge(j)].
% 0.73/1.04 159 both(cole) | mustard(dix) | mustard(barry) | -oneof(lang). [resolve(118,a,47,b)].
% 0.73/1.04 160 both(cole) | mustard(dix) | mustard(barry) | -oneof(cole). [resolve(118,a,45,b)].
% 0.73/1.04 166 both(barry) | mustard(mill) | mustard(lang). [resolve(122,b,36,a),merge(d)].
% 0.73/1.04 176 both(barry) | mustard(lang) | both(cole) | -mustard(cole). [resolve(133,b,67,c),merge(e)].
% 0.73/1.04 191 mustard(lang) | mustard(mill) | oneof(barry). [resolve(142,d,35,a),merge(d)].
% 0.73/1.04 193 mustard(lang) | mustard(mill) | -both(barry). [resolve(191,c,23,a)].
% 0.73/1.04 194 mustard(lang) | mustard(mill). [resolve(193,c,166,a),merge(c),merge(d)].
% 0.73/1.04 195 mustard(lang) | oneof(cole) | oneof(dix). [resolve(194,b,43,a)].
% 0.73/1.04 200 mustard(lang) | oneof(cole) | -both(dix). [resolve(195,c,23,a)].
% 0.73/1.04 210 mustard(cole) | mustard(lang) | both(lang) | -oneof(barry) | -mustard(barry). [resolve(151,d,48,a)].
% 0.73/1.04 215 both(cole) | mustard(dix) | mustard(barry) | both(lang). [resolve(159,d,91,c),merge(d)].
% 0.73/1.04 229 neither(barry) | both(cole) | mustard(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | oneof(barry) | mustard(cole) | both(mill). [resolve(157,g,92,c),merge(i)].
% 0.73/1.04 236 mustard(dix) | mustard(barry) | both(lang) | mustard(cole). [resolve(215,a,27,a)].
% 0.73/1.04 244 mustard(dix) | mustard(barry) | mustard(cole). [resolve(236,c,31,a),merge(d)].
% 0.73/1.04 250 mustard(barry) | mustard(cole) | neither(lang) | neither(mill). [resolve(244,a,41,a)].
% 0.73/1.04 256 mustard(barry) | mustard(cole) | neither(lang) | -mustard(mill). [resolve(250,d,26,a)].
% 0.73/1.04 268 mustard(barry) | mustard(cole) | neither(lang). [resolve(256,d,139,b),merge(d),merge(e)].
% 0.73/1.04 269 mustard(barry) | mustard(cole) | -oneof(dix). [resolve(268,c,59,b)].
% 0.73/1.04 275 mustard(barry) | mustard(cole) | both(dix). [resolve(269,c,90,c),merge(c)].
% 0.73/1.04 279 mustard(barry) | mustard(cole). [resolve(275,c,30,a),merge(c)].
% 0.73/1.04 280 mustard(barry) | both(barry) | mustard(lang) | both(cole). [resolve(279,b,176,d)].
% 0.73/1.04 282 mustard(barry) | both(cole) | oneof(cole). [resolve(279,b,89,a)].
% 0.73/1.04 283 mustard(barry) | both(dix) | both(lang). [resolve(279,b,40,a)].
% 0.73/1.04 284 mustard(barry) | both(cole) | mustard(dix). [resolve(282,c,160,d),merge(c),merge(e)].
% 0.73/1.04 289 mustard(barry) | both(lang) | mustard(dix). [resolve(283,b,27,a)].
% 0.73/1.04 290 mustard(barry) | mustard(dix) | oneof(barry) | neither(mill). [resolve(284,b,78,c)].
% 0.73/1.04 294 mustard(barry) | mustard(dix) | mustard(lang). [resolve(289,b,27,a)].
% 0.73/1.04 297 mustard(barry) | mustard(lang) | neither(lang) | neither(mill). [resolve(294,b,41,a)].
% 0.73/1.04 322 mustard(barry) | mustard(dix) | oneof(barry). [resolve(290,d,33,a),merge(d)].
% 0.73/1.04 331 mustard(barry) | mustard(lang) | neither(lang). [resolve(297,d,35,a),merge(d)].
% 0.73/1.04 332 mustard(cole) | mustard(lang) | both(lang) | -mustard(barry). [resolve(210,d,150,a),merge(e),merge(f)].
% 0.73/1.04 333 mustard(barry) | mustard(lang) | -oneof(dix). [resolve(331,c,59,b)].
% 0.73/1.04 336 mustard(barry) | mustard(lang) | oneof(cole). [resolve(333,c,195,c),merge(c)].
% 0.73/1.04 342 mustard(barry) | mustard(lang) | -both(cole). [resolve(336,c,23,a)].
% 0.73/1.04 344 mustard(barry) | mustard(lang) | both(barry). [resolve(342,c,280,d),merge(c),merge(e)].
% 0.73/1.04 346 mustard(barry) | mustard(lang). [resolve(344,c,27,a),merge(c)].
% 0.73/1.04 349 mustard(barry) | both(lang) | oneof(lang). [resolve(346,b,89,a)].
% 0.73/1.04 350 mustard(barry) | neither(cole) | neither(mill). [resolve(346,b,42,a)].
% 0.73/1.04 351 mustard(barry) | both(lang) | both(barry) | oneof(barry). [resolve(349,c,96,a)].
% 0.73/1.04 352 mustard(barry) | neither(cole) | -mustard(cole) | both(cole). [resolve(350,c,68,c)].
% 0.73/1.04 354 mustard(barry) | neither(cole) | mustard(dix). [resolve(350,c,33,a)].
% 0.73/1.04 357 mustard(barry) | mustard(dix) | -oneof(barry). [resolve(354,b,49,b)].
% 0.73/1.04 364 mustard(barry) | mustard(dix). [resolve(357,c,322,c),merge(c),merge(d)].
% 0.73/1.04 367 mustard(barry) | neither(lang) | neither(mill). [resolve(364,b,41,a)].
% 0.73/1.04 373 mustard(barry) | neither(lang) | -mustard(mill). [resolve(367,c,26,a)].
% 0.73/1.04 386 mustard(barry) | both(lang) | both(barry) | -mustard(lang). [resolve(351,d,71,c),merge(e)].
% 0.73/1.04 388 mustard(barry) | neither(cole) | both(cole). [resolve(352,c,279,b),merge(d)].
% 0.73/1.04 391 mustard(barry) | both(cole) | -mustard(cole). [resolve(388,b,26,a)].
% 0.73/1.04 398 mustard(barry) | both(cole). [resolve(391,c,279,b),merge(c)].
% 0.73/1.04 399 mustard(barry) | oneof(barry) | neither(mill). [resolve(398,b,78,c)].
% 0.73/1.04 403 mustard(barry) | oneof(barry) | -mustard(mill). [resolve(399,c,26,a)].
% 0.73/1.04 410 mustard(barry) | both(lang) | both(barry). [resolve(386,d,346,b),merge(d)].
% 0.73/1.04 412 mustard(barry) | both(barry) | mustard(mill). [resolve(410,b,36,a)].
% 0.73/1.04 415 mustard(barry) | mustard(mill). [resolve(412,b,27,a),merge(c)].
% 0.73/1.04 417 mustard(barry) | oneof(barry). [resolve(415,b,403,c),merge(b)].
% 0.73/1.04 418 mustard(barry) | neither(lang). [resolve(415,b,373,c),merge(b)].
% 0.73/1.04 425 mustard(barry) | -oneof(barry). [resolve(418,b,57,b)].
% 0.73/1.04 433 mustard(barry). [resolve(425,b,417,b),merge(b)].
% 0.73/1.04 435 mustard(cole) | mustard(lang) | both(lang). [back_unit_del(332),unit_del(d,433)].
% 0.73/1.04 444 both(barry) | -oneof(cole). [back_unit_del(65),unit_del(a,433)].
% 0.73/1.04 447 neither(dix) | both(mill). [back_unit_del(39),unit_del(a,433)].
% 0.73/1.04 448 both(barry) | oneof(barry). [resolve(433,a,89,a)].
% 0.73/1.04 449 -neither(barry). [ur(26,b,433,a)].
% 0.73/1.04 456 both(cole) | mustard(dix) | -both(barry) | -oneof(lang) | -mustard(lang) | oneof(barry) | mustard(cole) | both(mill). [back_unit_del(229),unit_del(a,449)].
% 0.73/1.04 460 both(cole) | -oneof(dix) | mustard(dix). [back_unit_del(82),unit_del(a,449)].
% 0.73/1.04 461 both(cole) | -both(dix). [back_unit_del(81),unit_del(a,449)].
% 0.73/1.04 465 both(mill) | -both(cole). [resolve(447,a,55,b)].
% 0.73/1.04 470 both(barry) | both(cole) | oneof(cole). [resolve(448,b,97,a)].
% 0.73/1.04 481 mustard(cole) | mustard(lang). [resolve(435,c,31,a),merge(c)].
% 0.73/1.04 482 mustard(lang) | both(dix) | both(lang). [resolve(481,a,40,a)].
% 0.73/1.04 511 both(barry) | both(cole). [resolve(470,c,444,b),merge(c)].
% 0.73/1.04 512 both(barry) | both(mill). [resolve(511,b,465,b)].
% 0.73/1.04 519 mustard(lang) | both(lang) | both(cole). [resolve(482,b,461,b)].
% 0.73/1.04 520 mustard(lang) | both(lang) | oneof(cole). [resolve(482,b,200,c),merge(c)].
% 0.73/1.04 539 mustard(lang) | both(lang) | -both(cole). [resolve(520,c,23,a)].
% 0.73/1.04 545 mustard(lang) | both(lang). [resolve(539,c,519,c),merge(c),merge(d)].
% 0.73/1.04 547 mustard(lang). [resolve(545,b,27,a),merge(b)].
% 0.73/1.04 561 both(cole) | mustard(dix) | -both(barry) | -oneof(lang) | oneof(barry) | mustard(cole) | both(mill). [back_unit_del(456),unit_del(e,547)].
% 0.73/1.04 573 neither(cole) | neither(mill). [back_unit_del(42),unit_del(a,547)].
% 0.73/1.04 575 -neither(lang). [ur(26,b,547,a)].
% 0.73/1.04 576 -mustard(dix) | neither(mill). [back_unit_del(41),unit_del(b,575)].
% 0.73/1.04 578 neither(cole) | -both(barry). [resolve(573,b,61,b)].
% 0.73/1.04 580 neither(cole) | mustard(dix). [resolve(573,b,33,a)].
% 0.73/1.04 582 neither(cole) | -both(mill). [resolve(573,b,25,b)].
% 0.73/1.04 589 mustard(dix) | -mustard(cole). [resolve(580,a,26,a)].
% 0.73/1.04 591 mustard(dix) | -oneof(cole). [resolve(580,a,24,b)].
% 0.73/1.04 593 neither(cole) | both(barry). [resolve(582,b,512,b)].
% 0.73/1.04 602 both(barry) | -oneof(barry). [resolve(593,a,49,b)].
% 0.73/1.04 609 both(barry). [resolve(602,b,448,b),merge(b)].
% 0.73/1.04 611 neither(cole). [back_unit_del(578),unit_del(b,609)].
% 0.73/1.04 617 both(cole) | mustard(dix) | -oneof(lang) | oneof(barry) | mustard(cole) | both(mill). [back_unit_del(561),unit_del(c,609)].
% 0.73/1.04 624 oneof(cole) | oneof(lang). [back_unit_del(75),unit_del(c,609)].
% 0.73/1.04 627 -neither(mill). [back_unit_del(61),unit_del(a,609)].
% 0.73/1.04 628 -oneof(barry). [back_unit_del(49),unit_del(b,611)].
% 0.73/1.04 629 -mustard(dix). [back_unit_del(576),unit_del(b,627)].
% 0.73/1.04 630 -both(cole). [back_unit_del(78),unit_del(a,628),unit_del(b,627)].
% 0.73/1.04 632 -oneof(lang) | mustard(cole) | both(mill). [back_unit_del(617),unit_del(a,630),unit_del(b,629),unit_del(d,628)].
% 0.73/1.04 640 -oneof(cole). [back_unit_del(591),unit_del(a,629)].
% 0.73/1.04 641 -mustard(cole). [back_unit_del(589),unit_del(a,629)].
% 0.73/1.04 643 -oneof(dix). [back_unit_del(460),unit_del(a,630),unit_del(c,629)].
% 0.73/1.04 648 oneof(lang). [back_unit_del(624),unit_del(a,640)].
% 0.73/1.04 649 -mustard(mill). [back_unit_del(43),unit_del(b,640),unit_del(c,643)].
% 0.73/1.04 650 both(mill). [back_unit_del(632),unit_del(a,648),unit_del(b,641)].
% 0.73/1.04 653 $F. [resolve(650,a,27,a),unit_del(a,649)].
% 0.73/1.04
% 0.73/1.04 % SZS output end Refutation
% 0.73/1.04 ============================== end of proof ==========================
% 0.73/1.04
% 0.73/1.04 ============================== STATISTICS ============================
% 0.73/1.04
% 0.73/1.04 Given=399. Generated=1640. Kept=630. proofs=1.
% 0.73/1.04 Usable=20. Sos=7. Demods=0. Limbo=0, Disabled=694. Hints=0.
% 0.73/1.04 Megabytes=0.33.
% 0.73/1.04 User_CPU=0.05, System_CPU=0.01, Wall_clock=0.
% 0.73/1.04
% 0.73/1.04 ============================== end of statistics =====================
% 0.73/1.04
% 0.73/1.04 ============================== end of search =========================
% 0.73/1.04
% 0.73/1.04 THEOREM PROVED
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04
% 0.73/1.04 Exiting with 1 proof.
% 0.73/1.04
% 0.73/1.04 Process 10780 exit (max_proofs) Sat May 28 19:45:22 2022
% 0.73/1.04 Prover9 interrupted
%------------------------------------------------------------------------------