TSTP Solution File: KRS082+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:55 EDT 2022
% Result : Unsatisfiable 0.72s 1.01s
% Output : Refutation 8.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 18:33:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.00 ============================== Prover9 ===============================
% 0.72/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.00 Process 4042 was started by sandbox on n025.cluster.edu,
% 0.72/1.00 Tue Jun 7 18:33:19 2022
% 0.72/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3888_n025.cluster.edu".
% 0.72/1.00 ============================== end of head ===========================
% 0.72/1.00
% 0.72/1.00 ============================== INPUT =================================
% 0.72/1.00
% 0.72/1.00 % Reading from file /tmp/Prover9_3888_n025.cluster.edu
% 0.72/1.00
% 0.72/1.00 set(prolog_style_variables).
% 0.72/1.00 set(auto2).
% 0.72/1.00 % set(auto2) -> set(auto).
% 0.72/1.00 % set(auto) -> set(auto_inference).
% 0.72/1.00 % set(auto) -> set(auto_setup).
% 0.72/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.00 % set(auto) -> set(auto_limits).
% 0.72/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.00 % set(auto) -> set(auto_denials).
% 0.72/1.00 % set(auto) -> set(auto_process).
% 0.72/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.00 % set(auto2) -> assign(stats, some).
% 0.72/1.00 % set(auto2) -> clear(echo_input).
% 0.72/1.00 % set(auto2) -> set(quiet).
% 0.72/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.00 % set(auto2) -> clear(print_given).
% 0.72/1.00 assign(lrs_ticks,-1).
% 0.72/1.00 assign(sos_limit,10000).
% 0.72/1.00 assign(order,kbo).
% 0.72/1.00 set(lex_order_vars).
% 0.72/1.00 clear(print_given).
% 0.72/1.00
% 0.72/1.00 % formulas(sos). % not echoed (10 formulas)
% 0.72/1.00
% 0.72/1.00 ============================== end of input ==========================
% 0.72/1.00
% 0.72/1.00 % From the command line: assign(max_seconds, 300).
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.00
% 0.72/1.00 % Formulas that are not ordinary clauses:
% 0.72/1.00 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 3 (all X (cUnsatisfiable(X) -> (exists Y (rs(X,Y) & (exists Z (rp(Y,Z) & cowlThing(Z))) & (all Z (rr(Y,Z) -> cc(Z))) & (all Z (rp(Y,Z) -> (exists W (rr(Z,W) & cowlThing(W))))) & (all Z (rp(Y,Z) -> (exists W (rp(Z,W) & cowlThing(W))))) & (all Z (rp(Y,Z) -> (all W (rr(Z,W) -> cc(W))))) & (exists Z (rr(Y,Z) & cowlThing(Z))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 4 (all X (cUnsatisfiable(X) -> ca(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 5 (all X (cc(X) <-> (all Y (rinvR(X,Y) -> (all Z (rinvP(Y,Z) -> (all W (rinvS(Z,W) -> -ca(W))))))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 6 (all X all Y (rinvP(X,Y) <-> rp(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 7 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 8 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00 9 (all X all Y all Z (rp(X,Y) & rp(Y,Z) -> rp(X,Z))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.00
% 0.72/1.00 ============================== end of process non-clausal formulas ===
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.00
% 0.72/1.00 ============================== PREDICATE ELIMINATION =================
% 0.72/1.00 10 -cUnsatisfiable(A) | ca(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.72/1.00 11 cUnsatisfiable(i2003_11_14_17_19_28752) # label(axiom_9) # label(axiom). [assumption].
% 0.72/1.00 Derived: ca(i2003_11_14_17_19_28752). [resolve(10,a,11,a)].
% 0.72/1.00 12 -cUnsatisfiable(A) | rs(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: rs(i2003_11_14_17_19_28752,f1(i2003_11_14_17_19_28752)). [resolve(12,a,11,a)].
% 0.72/1.00 13 -cUnsatisfiable(A) | rp(f1(A),f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: rp(f1(i2003_11_14_17_19_28752),f2(i2003_11_14_17_19_28752)). [resolve(13,a,11,a)].
% 0.72/1.00 14 -cUnsatisfiable(A) | rr(f1(A),f5(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: rr(f1(i2003_11_14_17_19_28752),f5(i2003_11_14_17_19_28752)). [resolve(14,a,11,a)].
% 0.72/1.00 15 -cUnsatisfiable(A) | -rr(f1(A),B) | cc(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: -rr(f1(i2003_11_14_17_19_28752),A) | cc(A). [resolve(15,a,11,a)].
% 0.72/1.00 16 -cUnsatisfiable(A) | -rp(f1(A),B) | rr(B,f3(A,B)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | rr(A,f3(i2003_11_14_17_19_28752,A)). [resolve(16,a,11,a)].
% 0.72/1.00 17 -cUnsatisfiable(A) | -rp(f1(A),B) | rp(B,f4(A,B)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | rp(A,f4(i2003_11_14_17_19_28752,A)). [resolve(17,a,11,a)].
% 0.72/1.00 18 -cUnsatisfiable(A) | -rp(f1(A),B) | -rr(B,C) | cc(C) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | cc(B). [resolve(18,a,11,a)].
% 0.72/1.00 19 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.72/1.00 20 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.72/1.00 21 -cc(A) | -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.00 22 cc(A) | ca(f8(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.00 23 cc(A) | rinvR(A,f6(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.00 24 cc(A) | rinvP(f6(A),f7(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.00 25 cc(A) | rinvS(f7(A),f8(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.00 Derived: -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | ca(f8(A)). [resolve(21,a,22,a)].
% 0.72/1.00 Derived: -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | rinvR(A,f6(A)). [resolve(21,a,23,a)].
% 0.72/1.00 Derived: -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | rinvP(f6(A),f7(A)). [resolve(21,a,24,a)].
% 0.72/1.00 Derived: -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | rinvS(f7(A),f8(A)). [resolve(21,a,25,a)].
% 0.72/1.00 26 -rr(f1(i2003_11_14_17_19_28752),A) | cc(A). [resolve(15,a,11,a)].
% 0.72/1.00 Derived: -rr(f1(i2003_11_14_17_19_28752),A) | -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D). [resolve(26,b,21,a)].
% 0.72/1.00 27 -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | cc(B). [resolve(18,a,11,a)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | -rinvR(B,C) | -rinvP(C,D) | -rinvS(D,E) | -ca(E). [resolve(27,c,21,a)].
% 0.72/1.00 28 rinvR(A,B) | -rr(B,A) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.72/1.00 29 -rinvR(A,B) | rr(B,A) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.72/1.00 30 rr(f1(i2003_11_14_17_19_28752),f5(i2003_11_14_17_19_28752)). [resolve(14,a,11,a)].
% 0.72/1.00 Derived: rinvR(f5(i2003_11_14_17_19_28752),f1(i2003_11_14_17_19_28752)). [resolve(30,a,28,b)].
% 0.72/1.00 31 -rp(f1(i2003_11_14_17_19_28752),A) | rr(A,f3(i2003_11_14_17_19_28752,A)). [resolve(16,a,11,a)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | rinvR(f3(i2003_11_14_17_19_28752,A),A). [resolve(31,b,28,b)].
% 0.72/1.00 32 -rr(f1(i2003_11_14_17_19_28752),A) | -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D). [resolve(26,b,21,a)].
% 0.72/1.00 Derived: -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | -rinvR(A,f1(i2003_11_14_17_19_28752)). [resolve(32,a,29,b)].
% 0.72/1.00 Derived: -rinvR(f5(i2003_11_14_17_19_28752),A) | -rinvP(A,B) | -rinvS(B,C) | -ca(C). [resolve(32,a,30,a)].
% 0.72/1.00 Derived: -rinvR(f3(i2003_11_14_17_19_28752,f1(i2003_11_14_17_19_28752)),A) | -rinvP(A,B) | -rinvS(B,C) | -ca(C) | -rp(f1(i2003_11_14_17_19_28752),f1(i2003_11_14_17_19_28752)). [resolve(32,a,31,b)].
% 0.72/1.00 33 -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | -rinvR(B,C) | -rinvP(C,D) | -rinvS(D,E) | -ca(E). [resolve(27,c,21,a)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | -rinvR(B,C) | -rinvP(C,D) | -rinvS(D,E) | -ca(E) | -rinvR(B,A). [resolve(33,b,29,b)].
% 0.72/1.00 Derived: -rp(f1(i2003_11_14_17_19_28752),A) | -rinvR(f3(i2003_11_14_17_19_28752,A),B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | -rp(f1(i2003_11_14_17_19_28752),A). [resolve(33,b,31,b)].
% 0.72/1.00 34 rinvS(A,B) | -rs(B,A) # label(axiom_7) # label(a
% 0.72/1.00 WARNING: denials share constants (see output).
% 0.72/1.00
% 0.72/1.01 xiom). [clausify(8)].
% 0.72/1.01 35 -rinvS(A,B) | rs(B,A) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.72/1.01 36 rs(i2003_11_14_17_19_28752,f1(i2003_11_14_17_19_28752)). [resolve(12,a,11,a)].
% 0.72/1.01 Derived: rinvS(f1(i2003_11_14_17_19_28752),i2003_11_14_17_19_28752). [resolve(36,a,34,b)].
% 0.72/1.01
% 0.72/1.01 ============================== end predicate elimination =============
% 0.72/1.01
% 0.72/1.01 Auto_denials:
% 0.72/1.01 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.72/1.01
% 0.72/1.01 WARNING, because some of the denials share constants,
% 0.72/1.01 some of the denials or their descendents may be subsumed,
% 0.72/1.01 preventing the target number of proofs from being found.
% 0.72/1.01 The shared constants are: i2003_11_14_17_19_28752.
% 0.72/1.01
% 0.72/1.01 Term ordering decisions:
% 0.72/1.01 Function symbol KB weights: i2003_11_14_17_19_28752=1. f3=1. f4=1. f1=1. f2=1. f5=1. f6=1. f7=1. f8=1.
% 0.72/1.01
% 0.72/1.01 ============================== end of process initial clauses ========
% 0.72/1.01
% 0.72/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.01
% 0.72/1.01 ============================== end of clauses for search =============
% 0.72/1.01
% 0.72/1.01 ============================== SEARCH ================================
% 0.72/1.01
% 0.72/1.01 % Starting search at 0.01 seconds.
% 0.72/1.01
% 0.72/1.01 ============================== PROOF =================================
% 0.72/1.01 % SZS status Unsatisfiable
% 0.72/1.01 % SZS output start Refutation
% 0.72/1.01
% 0.72/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.72/1.01 % Length of proof is 29.
% 0.72/1.01 % Level of proof is 6.
% 0.72/1.01 % Maximum clause weight is 17.000.
% 0.72/1.01 % Given clauses 18.
% 0.72/1.01
% 0.72/1.01 3 (all X (cUnsatisfiable(X) -> (exists Y (rs(X,Y) & (exists Z (rp(Y,Z) & cowlThing(Z))) & (all Z (rr(Y,Z) -> cc(Z))) & (all Z (rp(Y,Z) -> (exists W (rr(Z,W) & cowlThing(W))))) & (all Z (rp(Y,Z) -> (exists W (rp(Z,W) & cowlThing(W))))) & (all Z (rp(Y,Z) -> (all W (rr(Z,W) -> cc(W))))) & (exists Z (rr(Y,Z) & cowlThing(Z))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 4 (all X (cUnsatisfiable(X) -> ca(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 5 (all X (cc(X) <-> (all Y (rinvR(X,Y) -> (all Z (rinvP(Y,Z) -> (all W (rinvS(Z,W) -> -ca(W))))))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 6 (all X all Y (rinvP(X,Y) <-> rp(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 7 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 8 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 10 -cUnsatisfiable(A) | ca(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.72/1.01 11 cUnsatisfiable(i2003_11_14_17_19_28752) # label(axiom_9) # label(axiom). [assumption].
% 0.72/1.01 12 -cUnsatisfiable(A) | rs(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.01 13 -cUnsatisfiable(A) | rp(f1(A),f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.01 16 -cUnsatisfiable(A) | -rp(f1(A),B) | rr(B,f3(A,B)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.01 18 -cUnsatisfiable(A) | -rp(f1(A),B) | -rr(B,C) | cc(C) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/1.01 21 -cc(A) | -rinvR(A,B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/1.01 27 -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | cc(B). [resolve(18,a,11,a)].
% 0.72/1.01 28 rinvR(A,B) | -rr(B,A) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.72/1.01 31 -rp(f1(i2003_11_14_17_19_28752),A) | rr(A,f3(i2003_11_14_17_19_28752,A)). [resolve(16,a,11,a)].
% 0.72/1.01 33 -rp(f1(i2003_11_14_17_19_28752),A) | -rr(A,B) | -rinvR(B,C) | -rinvP(C,D) | -rinvS(D,E) | -ca(E). [resolve(27,c,21,a)].
% 0.72/1.01 34 rinvS(A,B) | -rs(B,A) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.72/1.01 36 rs(i2003_11_14_17_19_28752,f1(i2003_11_14_17_19_28752)). [resolve(12,a,11,a)].
% 0.72/1.01 38 rinvP(A,B) | -rp(B,A) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.72/1.01 40 ca(i2003_11_14_17_19_28752). [resolve(10,a,11,a)].
% 0.72/1.01 41 rp(f1(i2003_11_14_17_19_28752),f2(i2003_11_14_17_19_28752)). [resolve(13,a,11,a)].
% 0.72/1.01 48 -rp(f1(i2003_11_14_17_19_28752),A) | rinvR(f3(i2003_11_14_17_19_28752,A),A). [resolve(31,b,28,b)].
% 0.72/1.01 53 -rp(f1(i2003_11_14_17_19_28752),A) | -rinvR(f3(i2003_11_14_17_19_28752,A),B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D) | -rp(f1(i2003_11_14_17_19_28752),A). [resolve(33,b,31,b)].
% 0.72/1.01 54 -rp(f1(i2003_11_14_17_19_28752),A) | -rinvR(f3(i2003_11_14_17_19_28752,A),B) | -rinvP(B,C) | -rinvS(C,D) | -ca(D). [copy(53),merge(f)].
% 8.13/8.44 55 rinvS(f1(i2003_11_14_17_19_28752),i2003_11_14_17_19_28752). [resolve(36,a,34,b)].
% 8.13/8.44 56 rinvP(f2(i2003_11_14_17_19_28752),f1(i2003_11_14_17_19_28752)). [ur(38,b,41,a)].
% 8.13/8.44 58 rinvR(f3(i2003_11_14_17_19_28752,f2(i2003_11_14_17_19_28752)),f2(i2003_11_14_17_19_28752)). [ur(48,a,41,a)].
% 8.13/8.44 101 $F. [ur(54,a,41,a,c,56,a,d,55,a,e,40,a),unit_del(a,58)].
% 8.13/8.44
% 8.13/8.44 % SZS output end Refutation
% 8.13/8.44 ============================== end of proof ==========================
% 8.13/8.44
% 8.13/8.44 % Disable descendants (x means already disabled):
% 8.13/8.44 21x 32x 33x 49 50 51x 52 53x 54 59x
% 8.13/8.44 60 61 62 63 64 65 66 67 68 69
% 8.13/8.44 70 71 72 73 74 75x 76 77 78 79
% 8.13/8.44 80 81 82 83 84 85 86 87 88 89
% 8.13/8.44 90 91 92 93 94 95 96 97 98 99x
% 8.13/8.44 100 102
% 8.13/8.44
% 8.13/8.44 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 137 (0.00 of 0.33 sec).
% 8.13/8.44
% 8.13/8.44 ============================== STATISTICS ============================
% 8.13/8.44
% 8.13/8.44 Given=2856. Generated=24033. Kept=2900. proofs=1.
% 8.13/8.44 Usable=2852. Sos=0. Demods=0. Limbo=0, Disabled=99. Hints=0.
% 8.13/8.44 Megabytes=11.42.
% 8.13/8.44 User_CPU=7.43, System_CPU=0.02, Wall_clock=8.
% 8.13/8.44
% 8.13/8.44 ============================== end of statistics =====================
% 8.13/8.44
% 8.13/8.44 ============================== end of search =========================
% 8.13/8.44
% 8.13/8.44 SEARCH FAILED
% 8.13/8.44
% 8.13/8.44 Exiting with 1 proof.
% 8.13/8.44
% 8.13/8.44 Process 4042 exit (sos_empty) Tue Jun 7 18:33:27 2022
% 8.13/8.44 Prover9 interrupted
%------------------------------------------------------------------------------