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