TSTP Solution File: KRS092+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS092+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:24:57 EDT 2022
% Result : Unsatisfiable 0.76s 1.00s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS092+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 12:26:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 1455 was started by sandbox on n018.cluster.edu,
% 0.45/1.00 Tue Jun 7 12:26:51 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_976_n018.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_976_n018.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (9 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 3 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cowlThing(Y))) & (all Y (rr(X,Y) -> cd(Y) & cc(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 4 (all X (cc(X) -> -cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 5 (all X (cc1(X) -> cd1(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 6 (all X (cc1(X) -> -cd1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 7 (all X (ce3(X) -> cc(X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 8 (all X (cf(X) -> cd(X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00 9 cUnsatisfiable(A) | -rr(A,B) | -cowlThing(B) | rr(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.45/1.00 10 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.45/1.00 11 -cUnsatisfiable(A) | cowlThing(f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.45/1.00 Derived: cUnsatisfiable(A) | -rr(A,B) | rr(A,f2(A)). [resolve(9,c,10,a)].
% 0.45/1.00 12 cUnsatisfiable(A) | -rr(A,B) | -cowlThing(B) | -cd(f2(A)) | -cc(f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.45/1.00 Derived: cUnsatisfiable(A) | -rr(A,B) | -cd(f2(A)) | -cc(f2(A)). [resolve(12,c,10,a)].
% 0.45/1.00 13 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.45/1.00 14 cUnsatisfiable(i2003_11_14_17_20_04172) # label(axiom_8) # label(axiom). [assumption].
% 0.45/1.00 Derived: rr(i2003_11_14_17_20_04172,f1(i2003_11_14_17_20_04172)). [resolve(13,a,14,a)].
% 0.45/1.00 15 -cUnsatisfiable(A) | -rr(A,B) | cd(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.76/1.00 Derived: -rr(i2003_11_14_17_20_04172,A) | cd(A). [resolve(15,a,14,a)].
% 0.76/1.00 16 -cUnsatisfiable(A) | -rr(A,B) | cc(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.76/1.00 Derived: -rr(i2003_11_14_17_20_04172,A) | cc(A). [resolve(16,a,14,a)].
% 0.76/1.00 17 cUnsatisfiable(A) | -rr(A,B) | rr(A,f2(A)). [resolve(9,c,10,a)].
% 0.76/1.00 Derived: -rr(A,B) | rr(A,f2(A)) | rr(A,f1(A)). [resolve(17,a,13,a)].
% 0.76/1.00 Derived: -rr(A,B) | rr(A,f2(A)) | -rr(A,C) | cd(C). [resolve(17,a,15,a)].
% 0.76/1.00 Derived: -rr(A,B) | rr(A,f2(A)) | -rr(A,C) | cc(C). [resolve(17,a,16,a)].
% 0.76/1.00 18 cUnsatisfiable(A) | -rr(A,B) | -cd(f2(A)) | -cc(f2(A)). [resolve(12,c,10,a)].
% 0.76/1.00 Derived: -rr(A,B) | -cd(f2(A)) | -cc(f2(A)) | rr(A,f1(A)). [resolve(18,a,13,a)].
% 0.76/1.00 Derived: -rr(A,B) | -cd(f2(A)) | -cc(f2(A)) | -rr(A,C) | cd(C). [resolve(18,a,15,a)].
% 0.76/1.00 Derived: -rr(A,B) | -cd(f2(A)) | -cc(f2(A)) | -rr(A,C) | cc(C). [resolve(18,a,16,a)].
% 0.76/1.00 19 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.76/1.00 20 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.76/1.00
% 0.76/1.00 ============================== end predicate elimination =============
% 0.76/1.00
% 0.76/1.00 Auto_denials: (non-Horn, no changes).
% 0.76/1.00
% 0.76/1.00 Term ordering decisions:
% 0.76/1.00 Function symbol KB weights: i2003_11_14_17_20_04172=1. f1=1. f2=1.
% 0.76/1.00
% 0.76/1.00 ============================== end of process initial clauses ========
% 0.76/1.00
% 0.76/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.00
% 0.76/1.00 ============================== end of clauses for search =============
% 0.76/1.00
% 0.76/1.00 ============================== SEARCH ================================
% 0.76/1.00
% 0.76/1.00 % Starting search at 0.01 seconds.
% 0.76/1.00
% 0.76/1.00 ============================== PROOF =================================
% 0.76/1.00 % SZS status Unsatisfiable
% 0.76/1.00 % SZS output start Refutation
% 0.76/1.00
% 0.76/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.00 % Length of proof is 13.
% 0.76/1.00 % Level of proof is 4.
% 0.76/1.00 % Maximum clause weight is 5.000.
% 0.76/1.00 % Given clauses 8.
% 0.76/1.00
% 0.76/1.00 3 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cowlThing(Y))) & (all Y (rr(X,Y) -> cd(Y) & cc(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 4 (all X (cc(X) -> -cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 13 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.76/1.00 14 cUnsatisfiable(i2003_11_14_17_20_04172) # label(axiom_8) # label(axiom). [assumption].
% 0.76/1.00 15 -cUnsatisfiable(A) | -rr(A,B) | cd(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.76/1.00 16 -cUnsatisfiable(A) | -rr(A,B) | cc(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.76/1.00 21 -cc(A) | -cd(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.76/1.00 22 rr(i2003_11_14_17_20_04172,f1(i2003_11_14_17_20_04172)). [resolve(13,a,14,a)].
% 0.76/1.00 23 -rr(i2003_11_14_17_20_04172,A) | cd(A). [resolve(15,a,14,a)].
% 0.76/1.00 24 -rr(i2003_11_14_17_20_04172,A) | cc(A). [resolve(16,a,14,a)].
% 0.76/1.00 30 cd(f1(i2003_11_14_17_20_04172)). [resolve(23,a,22,a)].
% 0.76/1.00 31 cc(f1(i2003_11_14_17_20_04172)). [resolve(24,a,22,a)].
% 0.76/1.00 32 $F. [resolve(30,a,21,b),unit_del(a,31)].
% 0.76/1.00
% 0.76/1.00 % SZS output end Refutation
% 0.76/1.00 ============================== end of proof ==========================
% 0.76/1.00
% 0.76/1.00 ============================== STATISTICS ============================
% 0.76/1.00
% 0.76/1.00 Given=8. Generated=18. Kept=11. proofs=1.
% 0.76/1.00 Usable=8. Sos=1. Demods=0. Limbo=0, Disabled=29. Hints=0.
% 0.76/1.00 Megabytes=0.04.
% 0.76/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.00
% 0.76/1.00 ============================== end of statistics =====================
% 0.76/1.00
% 0.76/1.00 ============================== end of search =========================
% 0.76/1.00
% 0.76/1.00 THEOREM PROVED
% 0.76/1.00 % SZS status Unsatisfiable
% 0.76/1.00
% 0.76/1.00 Exiting with 1 proof.
% 0.76/1.00
% 0.76/1.00 Process 1455 exit (max_proofs) Tue Jun 7 12:26:51 2022
% 0.76/1.00 Prover9 interrupted
%------------------------------------------------------------------------------