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