TSTP Solution File: KRS169+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS169+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:16 EDT 2022
% Result : Theorem 0.71s 0.97s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS169+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 12:41:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.97 ============================== Prover9 ===============================
% 0.71/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.97 Process 5194 was started by sandbox on n017.cluster.edu,
% 0.71/0.97 Tue Jun 7 12:41:03 2022
% 0.71/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5040_n017.cluster.edu".
% 0.71/0.97 ============================== end of head ===========================
% 0.71/0.97
% 0.71/0.97 ============================== INPUT =================================
% 0.71/0.97
% 0.71/0.97 % Reading from file /tmp/Prover9_5040_n017.cluster.edu
% 0.71/0.97
% 0.71/0.97 set(prolog_style_variables).
% 0.71/0.97 set(auto2).
% 0.71/0.97 % set(auto2) -> set(auto).
% 0.71/0.97 % set(auto) -> set(auto_inference).
% 0.71/0.97 % set(auto) -> set(auto_setup).
% 0.71/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.97 % set(auto) -> set(auto_limits).
% 0.71/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.97 % set(auto) -> set(auto_denials).
% 0.71/0.97 % set(auto) -> set(auto_process).
% 0.71/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.97 % set(auto2) -> assign(stats, some).
% 0.71/0.97 % set(auto2) -> clear(echo_input).
% 0.71/0.97 % set(auto2) -> set(quiet).
% 0.71/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.97 % set(auto2) -> clear(print_given).
% 0.71/0.97 assign(lrs_ticks,-1).
% 0.71/0.97 assign(sos_limit,10000).
% 0.71/0.97 assign(order,kbo).
% 0.71/0.97 set(lex_order_vars).
% 0.71/0.97 clear(print_given).
% 0.71/0.97
% 0.71/0.97 % formulas(sos). % not echoed (7 formulas)
% 0.71/0.97
% 0.71/0.97 ============================== end of input ==========================
% 0.71/0.97
% 0.71/0.97 % From the command line: assign(max_seconds, 300).
% 0.71/0.97
% 0.71/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.97
% 0.71/0.97 % Formulas that are not ordinary clauses:
% 0.71/0.97 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 3 (all X all Y (rhasLeader(X,Y) <-> rhasHead(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 4 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & cowlThing(iX) & rhasHead(iX,iY) & cowlThing(iY)) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.97
% 0.71/0.97 ============================== end of process non-clausal formulas ===
% 0.71/0.97
% 0.71/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.97
% 0.71/0.97 ============================== PREDICATE ELIMINATION =================
% 0.71/0.97 5 -rhasLeader(A,B) | rhasHead(A,B) # label(axiom_5) # label(axiom). [clausify(3)].
% 0.71/0.97 6 rhasLeader(iX,iY) # label(axiom_3) # label(axiom). [assumption].
% 0.71/0.97 Derived: rhasHead(iX,iY). [resolve(5,a,6,a)].
% 0.71/0.97 7 rhasLeader(A,B) | -rhasHead(A,B) # label(axiom_5) # label(axiom). [clausify(3)].
% 0.71/0.97 8 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.71/0.97 9 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.71/0.97 10 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.71/0.97 Derived: -cowlThing(c1) | cowlNothing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(10,c,8,a)].
% 0.71/0.97 11 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.71/0.97 Derived: -cowlThing(c1) | cowlNothing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(11,c,9,a)].
% 0.71/0.97 12 -cowlThing(c1) | cowlNothing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(10,c,8,a)].
% 0.71/0.97 13 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.71/0.97 Derived: -cowlThing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(12,b,13,a)].
% 0.71/0.97 14 -cowlThing(c1) | cowlNothing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(11,c,9,a)].
% 0.71/0.97 Derived: -cowlThing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(14,b,13,a)].
% 0.71/0.97 15 -cowlThing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(12,b,13,a)].
% 0.71/0.97 16 rhasHead(iX,iY). [resolve(5,a,6,a)].
% 0.71/0.97 Derived: -cowlThing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -cowlThing(iY) | -xsd_integer(c2). [resolve(15,d,16,a)].
% 0.71/0.97 17 -cowlThing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(14,b,13,a)].
% 0.71/0.97 Derived: -cowlThing(c1) | xsd_integer(c2) | -cowlThing(iX) | -cowlThing(iY) | xsd_integer(c2). [resolve(17,d,16,a)].
% 0.71/0.97
% 0.71/0.97 ============================== end predicate elimination =============
% 0.71/0.97
% 0.71/0.97 Auto_denials: (non-Horn, no changes).
% 0.71/0.97
% 0.71/0.97 Term ordering decisions:
% 0.71/0.97 Function symbol KB weights: iX=1. iY=1. c1=1. c2=1.
% 0.71/0.97
% 0.71/0.97 ============================== PROOF =================================
% 0.71/0.97 % SZS status Theorem
% 0.71/0.97 % SZS output start Refutation
% 0.71/0.97
% 0.71/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.97 % Length of proof is 21.
% 0.71/0.97 % Level of proof is 6.
% 0.71/0.97 % Maximum clause weight is 2.000.
% 0.71/0.97 % Given clauses 0.
% 0.71/0.97
% 0.71/0.97 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 3 (all X all Y (rhasLeader(X,Y) <-> rhasHead(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.97 4 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & cowlThing(iX) & rhasHead(iX,iY) & cowlThing(iY)) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.97 5 -rhasLeader(A,B) | rhasHead(A,B) # label(axiom_5) # label(axiom). [clausify(3)].
% 0.71/0.97 6 rhasLeader(iX,iY) # label(axiom_3) # label(axiom). [assumption].
% 0.71/0.97 8 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.71/0.97 9 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.71/0.97 10 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.71/0.97 11 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) # label(the_axiom) # label(negated_conjecture). [clausify(4)].
% 0.71/0.97 12 -cowlThing(c1) | cowlNothing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(10,c,8,a)].
% 0.71/0.97 13 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.71/0.98 14 -cowlThing(c1) | cowlNothing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(11,c,9,a)].
% 0.71/0.98 15 -cowlThing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | -xsd_integer(c2). [resolve(12,b,13,a)].
% 0.71/0.98 16 rhasHead(iX,iY). [resolve(5,a,6,a)].
% 0.71/0.98 17 -cowlThing(c1) | xsd_integer(c2) | -cowlThing(iX) | -rhasHead(iX,iY) | -cowlThing(iY) | xsd_integer(c2). [resolve(14,b,13,a)].
% 0.71/0.98 18 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.71/0.98 19 -cowlThing(c1) | -xsd_integer(c2) | -cowlThing(iX) | -cowlThing(iY) | -xsd_integer(c2). [resolve(15,d,16,a)].
% 0.71/0.98 20 -xsd_integer(c2). [copy(19),merge(e),unit_del(a,18),unit_del(c,18),unit_del(d,18)].
% 0.71/0.98 21 -cowlThing(c1) | xsd_integer(c2) | -cowlThing(iX) | -cowlThing(iY) | xsd_integer(c2). [resolve(17,d,16,a)].
% 0.71/0.98 22 $F. [copy(21),merge(e),unit_del(a,18),unit_del(b,20),unit_del(c,18),unit_del(d,18)].
% 0.71/0.98
% 0.71/0.98 % SZS output end Refutation
% 0.71/0.98 ============================== end of proof ==========================
% 0.71/0.98
% 0.71/0.98 ============================== STATISTICS ============================
% 0.71/0.98
% 0.71/0.98 Given=0. Generated=5. Kept=2. proofs=1.
% 0.71/0.98 Usable=0. Sos=0. Demods=0. Limbo=2, Disabled=18. Hints=0.
% 0.71/0.98 Megabytes=0.03.
% 0.71/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.98
% 0.71/0.98 ============================== end of statistics =====================
% 0.71/0.98
% 0.71/0.98 ============================== end of search =========================
% 0.71/0.98
% 0.71/0.98 THEOREM PROVED
% 0.71/0.98 % SZS status Theorem
% 0.71/0.98
% 0.71/0.98 Exiting with 1 proof.
% 0.71/0.98
% 0.71/0.98 Process 5194 exit (max_proofs) Tue Jun 7 12:41:03 2022
% 0.71/0.98 Prover9 interrupted
%------------------------------------------------------------------------------