TSTP Solution File: KRS170+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS170+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : Sun Jul 17 03:25:17 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS170+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n018.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 Jun 7 15:04:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 32695 was started by sandbox2 on n018.cluster.edu,
% 0.44/0.99 Tue Jun 7 15:04:06 2022
% 0.44/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32312_n018.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_32312_n018.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (4 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all X all Y (rhasLeader(X,Y) <-> rhasHead(X,Y))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X all Y (rhasLeader(X,Y) -> rhasHead(X,Y))) & (all X all Y (rhasHead(X,Y) -> rhasLeader(X,Y)))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 5 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 6 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(5,a,6,a)].
% 0.44/0.99 7 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(7,a,6,a)].
% 0.44/0.99 8 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(8,a,6,a)].
% 0.44/0.99 9 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(9,a,6,a)].
% 0.44/0.99 10 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(10,a,6,a)].
% 0.44/0.99 11 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(11,a,6,a)].
% 0.44/0.99 12 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(12,a,6,a)].
% 0.44/0.99 13 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(13,a,6,a)].
% 0.44/0.99 14 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 15 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 16 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(5,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(16,b,14,a)].
% 0.44/0.99 17 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(7,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(17,b,14,a)].
% 0.44/0.99 18 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(8,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(18,b,14,a)].
% 0.44/0.99 19 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(9,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(19,b,14,a)].
% 0.44/0.99 20 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(10,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(20,b,15,a)].
% 0.44/0.99 21 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(11,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(21,b,15,a)].
% 0.44/0.99 22 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(12,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(22,b,15,a)].
% 0.44/0.99 23 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(13,a,6,a)].
% 0.44/0.99 Derived: cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(23,b,15,a)].
% 0.44/0.99 24 cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(16,b,14,a)].
% 0.44/0.99 25 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.44/0.99 Derived: -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(24,a,25,a)].
% 0.44/0.99 26 cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(17,b,14,a)].
% 0.44/0.99 Derived: -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(26,a,25,a)].
% 0.44/0.99 27 cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(18,b,14,a)].
% 0.44/0.99 Derived: -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(27,a,25,a)].
% 0.44/0.99 28 cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(19,b,14,a)].
% 0.44/0.99 Derived: -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(28,a,25,a)].
% 0.44/0.99 29 cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(20,b,15,a)].
% 0.44/0.99 Derived: xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(29,a,25,a)].
% 0.44/0.99 30 cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(21,b,15,a)].
% 0.44/0.99 Derived: xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(30,a,25,a)].
% 0.44/0.99 31 cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(22,b,15,a)].
% 0.44/0.99 Derived: xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(31,a,25,a)].
% 0.44/0.99 32 cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(23,b,15,a)].
% 0.44/0.99 Derived: xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(32,a,25,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: c2=1. c3=1. c4=1. c5=1. c6=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 69.
% 0.44/0.99 % Level of proof is 20.
% 0.44/0.99 % Maximum clause weight is 8.000.
% 0.44/0.99 % Given clauses 27.
% 0.44/0.99
% 0.44/0.99 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all X all Y (rhasLeader(X,Y) <-> rhasHead(X,Y))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X all Y (rhasLeader(X,Y) -> rhasHead(X,Y))) & (all X all Y (rhasHead(X,Y) -> rhasLeader(X,Y)))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 5 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 6 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.44/0.99 7 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 8 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 9 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 10 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 11 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 12 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 13 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.44/0.99 14 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 15 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 16 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(5,a,6,a)].
% 0.44/0.99 17 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(7,a,6,a)].
% 0.44/0.99 18 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(8,a,6,a)].
% 0.44/0.99 19 cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(9,a,6,a)].
% 0.44/0.99 20 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [resolve(10,a,6,a)].
% 0.44/0.99 21 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [resolve(11,a,6,a)].
% 0.44/0.99 22 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [resolve(12,a,6,a)].
% 0.44/0.99 23 cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [resolve(13,a,6,a)].
% 0.44/0.99 24 cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(16,b,14,a)].
% 0.44/0.99 25 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.44/0.99 26 cowlNothing(c1) | -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(17,b,14,a)].
% 0.44/0.99 27 cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(18,b,14,a)].
% 0.44/0.99 28 cowlNothing(c1) | -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(19,b,14,a)].
% 0.44/0.99 29 cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(20,b,15,a)].
% 0.44/0.99 30 cowlNothing(c1) | xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(21,b,15,a)].
% 0.44/0.99 31 cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(22,b,15,a)].
% 0.44/0.99 32 cowlNothing(c1) | xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(23,b,15,a)].
% 0.44/0.99 33 -rhasLeader(A,B) | rhasHead(A,B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.44/0.99 34 rhasLeader(A,B) | -rhasHead(A,B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.44/0.99 35 -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(24,a,25,a)].
% 0.44/0.99 36 -xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [copy(35),merge(d)].
% 0.44/0.99 37 -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(26,a,25,a)].
% 0.44/0.99 38 -xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [copy(37),merge(d)].
% 0.44/0.99 39 -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | -xsd_integer(c2). [resolve(27,a,25,a)].
% 0.44/0.99 40 -xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [copy(39),merge(d)].
% 0.44/0.99 41 -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | -xsd_integer(c2). [resolve(28,a,25,a)].
% 0.44/0.99 42 -xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [copy(41),merge(d)].
% 0.44/0.99 43 xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(29,a,25,a)].
% 0.44/0.99 44 xsd_integer(c2) | rhasLeader(c3,c4) | rhasHead(c5,c6). [copy(43),merge(d)].
% 0.44/0.99 45 xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(30,a,25,a)].
% 0.44/0.99 46 xsd_integer(c2) | rhasLeader(c3,c4) | -rhasLeader(c5,c6). [copy(45),merge(d)].
% 0.44/0.99 47 xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6) | xsd_integer(c2). [resolve(31,a,25,a)].
% 0.44/0.99 48 xsd_integer(c2) | -rhasHead(c3,c4) | rhasHead(c5,c6). [copy(47),merge(d)].
% 0.44/0.99 49 xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6) | xsd_integer(c2). [resolve(32,a,25,a)].
% 0.44/0.99 50 xsd_integer(c2) | -rhasHead(c3,c4) | -rhasLeader(c5,c6). [copy(49),merge(d)].
% 0.44/0.99 51 xsd_integer(c2) | rhasHead(c5,c6) | rhasHead(c3,c4). [resolve(44,b,33,a)].
% 0.44/0.99 52 xsd_integer(c2) | rhasHead(c3,c4) | rhasLeader(c5,c6). [resolve(51,b,34,b)].
% 0.44/0.99 53 xsd_integer(c2) | rhasHead(c3,c4) | rhasLeader(c3,c4). [resolve(52,c,46,c),merge(c)].
% 0.44/0.99 54 xsd_integer(c2) | rhasHead(c3,c4). [resolve(53,c,33,a),merge(c)].
% 0.44/0.99 55 xsd_integer(c2) | rhasHead(c5,c6). [resolve(54,b,48,b),merge(b)].
% 0.44/0.99 57 xsd_integer(c2) | rhasLeader(c5,c6). [resolve(55,b,34,b)].
% 0.44/0.99 58 xsd_integer(c2) | -rhasHead(c3,c4). [resolve(57,b,50,c),merge(b)].
% 0.44/0.99 59 xsd_integer(c2). [resolve(58,b,54,b),merge(b)].
% 0.44/0.99 60 -rhasHead(c3,c4) | -rhasLeader(c5,c6). [back_unit_del(42),unit_del(a,59)].
% 0.44/0.99 61 -rhasHead(c3,c4) | rhasHead(c5,c6). [back_unit_del(40),unit_del(a,59)].
% 0.44/0.99 62 rhasLeader(c3,c4) | -rhasLeader(c5,c6). [back_unit_del(38),unit_del(a,59)].
% 0.44/0.99 63 rhasLeader(c3,c4) | rhasHead(c5,c6). [back_unit_del(36),unit_del(a,59)].
% 0.44/0.99 64 rhasHead(c5,c6) | rhasHead(c3,c4). [resolve(63,a,33,a)].
% 0.44/0.99 65 rhasHead(c3,c4) | rhasLeader(c5,c6). [resolve(64,a,34,b)].
% 0.44/0.99 66 rhasHead(c3,c4) | rhasLeader(c3,c4). [resolve(65,b,62,b)].
% 0.44/0.99 67 rhasHead(c3,c4). [resolve(66,b,33,a),merge(b)].
% 0.44/0.99 68 rhasHead(c5,c6). [back_unit_del(61),unit_del(a,67)].
% 0.44/0.99 69 -rhasLeader(c5,c6). [back_unit_del(60),unit_del(a,67)].
% 0.44/0.99 70 $F. [ur(34,a,69,a),unit_del(a,68)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=27. Generated=41. Kept=29. proofs=1.
% 0.44/0.99 Usable=4. Sos=2. Demods=0. Limbo=0, Disabled=61. Hints=0.
% 0.44/0.99 Megabytes=0.06.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 32695 exit (max_proofs) Tue Jun 7 15:04:06 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------