TSTP Solution File: SWB013+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB013+2 : TPTP v8.1.0. Released v5.2.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 : Tue Jul 19 19:18:48 EDT 2022
% Result : Theorem 101.41s 101.73s
% Output : Refutation 101.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWB013+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/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 : Wed Jun 1 10:46:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.97 ============================== Prover9 ===============================
% 0.67/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97 Process 31553 was started by sandbox on n017.cluster.edu,
% 0.67/0.97 Wed Jun 1 10:46:27 2022
% 0.67/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31393_n017.cluster.edu".
% 0.67/0.97 ============================== end of head ===========================
% 0.67/0.97
% 0.67/0.97 ============================== INPUT =================================
% 0.67/0.97
% 0.67/0.97 % Reading from file /tmp/Prover9_31393_n017.cluster.edu
% 0.67/0.97
% 0.67/0.97 set(prolog_style_variables).
% 0.67/0.97 set(auto2).
% 0.67/0.97 % set(auto2) -> set(auto).
% 0.67/0.97 % set(auto) -> set(auto_inference).
% 0.67/0.97 % set(auto) -> set(auto_setup).
% 0.67/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97 % set(auto) -> set(auto_limits).
% 0.67/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97 % set(auto) -> set(auto_denials).
% 0.67/0.97 % set(auto) -> set(auto_process).
% 0.67/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97 % set(auto2) -> assign(stats, some).
% 0.67/0.97 % set(auto2) -> clear(echo_input).
% 0.67/0.97 % set(auto2) -> set(quiet).
% 0.67/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97 % set(auto2) -> clear(print_given).
% 0.67/0.97 assign(lrs_ticks,-1).
% 0.67/0.97 assign(sos_limit,10000).
% 0.67/0.97 assign(order,kbo).
% 0.67/0.97 set(lex_order_vars).
% 0.67/0.97 clear(print_given).
% 0.67/0.97
% 0.67/0.97 % formulas(sos). % not echoed (9 formulas)
% 0.67/0.97
% 0.67/0.97 ============================== end of input ==========================
% 0.67/0.97
% 0.67/0.97 % From the command line: assign(max_seconds, 300).
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97
% 0.67/0.97 % Formulas that are not ordinary clauses:
% 0.67/0.97 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 2 (all Z all P all C (iext(uri_owl_someValuesFrom,Z,C) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y (iext(P,X,Y) & icext(C,Y))))))) # label(owl_restrict_somevaluesfrom) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 3 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 4 (all P1 all P2 (iext(uri_rdfs_subPropertyOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) -> iext(P2,X,Y))))) # label(owl_rdfsext_subpropertyof) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 5 (all X all Y (iext(uri_owl_sameAs,X,Y) <-> X = Y)) # label(owl_eqdis_sameas) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 6 (all P all S1 all P1 all S2 all P2 all S3 all P3 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_first,S3,P3) & iext(uri_rdf_rest,S3,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & ip(P3) & (all Y0 all Y1 all Y2 all Y3 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) & iext(P3,Y2,Y3) -> iext(P,Y0,Y3)))))) # label(owl_chain_003) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 7 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 8 (exists BNODE_r exists BNODE_i exists BNODE_l1 exists BNODE_l2 exists BNODE_l3 (iext(uri_rdf_type,uri_ex_Clique,uri_owl_Class) & iext(uri_rdfs_subPropertyOf,uri_ex_sameCliqueAs,uri_owl_sameAs) & iext(uri_rdfs_range,uri_ex_sameCliqueAs,uri_ex_Clique) & iext(uri_rdfs_subClassOf,uri_ex_Clique,BNODE_r) & iext(uri_rdf_type,BNODE_r,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_r,uri_ex_sameCliqueAs) & iext(uri_owl_someValuesFrom,BNODE_r,uri_ex_Clique) & iext(uri_rdf_type,uri_foaf_knows,uri_owl_ObjectProperty) & iext(uri_owl_propertyChainAxiom,uri_foaf_knows,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_rdf_type) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_sameCliqueAs) & iext(uri_rdf_rest,BNODE_l2,BNODE_l3) & iext(uri_rdf_first,BNODE_l3,BNODE_i) & iext(uri_rdf_rest,BNODE_l3,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_i,uri_rdf_type) & iext(uri_rdf_type,uri_ex_JoesGang,uri_ex_Clique) & iext(uri_rdf_type,uri_ex_alice,uri_ex_JoesGang) & iext(uri_rdf_type,uri_ex_bob,uri_ex_JoesGang))) # label(testcase_premise_fullish_013_Cliques) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73
% 101.41/101.73 ============================== end of process non-clausal formulas ===
% 101.41/101.73
% 101.41/101.73 ============================== PROCESS INITIAL CLAUSES ===============
% 101.41/101.73
% 101.41/101.73 ============================== PREDICATE ELIMINATION =================
% 101.41/101.73
% 101.41/101.73 ============================== end predicate elimination =============
% 101.41/101.73
% 101.41/101.73 Auto_denials: (non-Horn, no changes).
% 101.41/101.73
% 101.41/101.73 Term ordering decisions:
% 101.41/101.73 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_propertyChainAxiom=1. uri_rdf_nil=1. uri_rdf_type=1. uri_owl_inverseOf=1. uri_rdfs_subClassOf=1. uri_rdfs_subPropertyOf=1. uri_ex_Clique=1. uri_ex_sameCliqueAs=1. uri_owl_onProperty=1. uri_owl_someValuesFrom=1. uri_ex_JoesGang=1. uri_owl_sameAs=1. uri_foaf_knows=1. uri_ex_alice=1. uri_ex_bob=1. uri_owl_Class=1. uri_owl_ObjectProperty=1. uri_owl_Restriction=1. uri_rdfs_range=1. c1=1. c2=1. c3=1. c4=1. c5=1. f2=1. f3=1. f4=1. f9=1. f10=1. f1=1. f5=1. f6=1. f7=1. f8=1.
% 101.41/101.73
% 101.41/101.73 ============================== end of process initial clauses ========
% 101.41/101.73
% 101.41/101.73 ============================== CLAUSES FOR SEARCH ====================
% 101.41/101.73
% 101.41/101.73 ============================== end of clauses for search =============
% 101.41/101.73
% 101.41/101.73 ============================== SEARCH ================================
% 101.41/101.73
% 101.41/101.73 % Starting search at 1.02 seconds.
% 101.41/101.73
% 101.41/101.73 Low Water (displace): id=10101, wt=32.000
% 101.41/101.73
% 101.41/101.73 Low Water (displace): id=10272, wt=28.000
% 101.41/101.73
% 101.41/101.73 Low Water (displace): id=13232, wt=24.000
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=48.000, iters=6250
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=46.000, iters=6250
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=44.000, iters=6250
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=36.000, iters=6249
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=32.000, iters=6249
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=28.000, iters=4349
% 101.41/101.73
% 101.41/101.73 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 227 (0.00 of 7.92 sec).
% 101.41/101.73
% 101.41/101.73 Low Water (keep): wt=24.000, iters=3389
% 101.41/101.73
% 101.41/101.73 ============================== PROOF =================================
% 101.41/101.73 % SZS status Theorem
% 101.41/101.73 % SZS output start Refutation
% 101.41/101.73
% 101.41/101.73 % Proof 1 at 100.67 (+ 0.08) seconds.
% 101.41/101.73 % Length of proof is 44.
% 101.41/101.73 % Level of proof is 7.
% 101.41/101.73 % Maximum clause weight is 44.000.
% 101.41/101.73 % Given clauses 2199.
% 101.41/101.73
% 101.41/101.73 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 2 (all Z all P all C (iext(uri_owl_someValuesFrom,Z,C) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y (iext(P,X,Y) & icext(C,Y))))))) # label(owl_restrict_somevaluesfrom) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 3 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 4 (all P1 all P2 (iext(uri_rdfs_subPropertyOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) -> iext(P2,X,Y))))) # label(owl_rdfsext_subpropertyof) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 5 (all X all Y (iext(uri_owl_sameAs,X,Y) <-> X = Y)) # label(owl_eqdis_sameas) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 6 (all P all S1 all P1 all S2 all P2 all S3 all P3 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_first,S3,P3) & iext(uri_rdf_rest,S3,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & ip(P3) & (all Y0 all Y1 all Y2 all Y3 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) & iext(P3,Y2,Y3) -> iext(P,Y0,Y3)))))) # label(owl_chain_003) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 7 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 8 (exists BNODE_r exists BNODE_i exists BNODE_l1 exists BNODE_l2 exists BNODE_l3 (iext(uri_rdf_type,uri_ex_Clique,uri_owl_Class) & iext(uri_rdfs_subPropertyOf,uri_ex_sameCliqueAs,uri_owl_sameAs) & iext(uri_rdfs_range,uri_ex_sameCliqueAs,uri_ex_Clique) & iext(uri_rdfs_subClassOf,uri_ex_Clique,BNODE_r) & iext(uri_rdf_type,BNODE_r,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_r,uri_ex_sameCliqueAs) & iext(uri_owl_someValuesFrom,BNODE_r,uri_ex_Clique) & iext(uri_rdf_type,uri_foaf_knows,uri_owl_ObjectProperty) & iext(uri_owl_propertyChainAxiom,uri_foaf_knows,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_rdf_type) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_sameCliqueAs) & iext(uri_rdf_rest,BNODE_l2,BNODE_l3) & iext(uri_rdf_first,BNODE_l3,BNODE_i) & iext(uri_rdf_rest,BNODE_l3,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_i,uri_rdf_type) & iext(uri_rdf_type,uri_ex_JoesGang,uri_ex_Clique) & iext(uri_rdf_type,uri_ex_alice,uri_ex_JoesGang) & iext(uri_rdf_type,uri_ex_bob,uri_ex_JoesGang))) # label(testcase_premise_fullish_013_Cliques) # label(axiom) # label(non_clause). [assumption].
% 101.41/101.73 10 iext(uri_rdfs_subPropertyOf,uri_ex_sameCliqueAs,uri_owl_sameAs) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 12 iext(uri_rdfs_subClassOf,uri_ex_Clique,c1) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 14 iext(uri_owl_onProperty,c1,uri_ex_sameCliqueAs) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 15 iext(uri_owl_someValuesFrom,c1,uri_ex_Clique) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 17 iext(uri_owl_propertyChainAxiom,uri_foaf_knows,c3) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 18 iext(uri_rdf_first,c3,uri_rdf_type) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 19 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 20 iext(uri_rdf_first,c4,uri_ex_sameCliqueAs) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 21 iext(uri_rdf_rest,c4,c5) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 22 iext(uri_rdf_first,c5,c2) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 23 iext(uri_rdf_rest,c5,uri_rdf_nil) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 24 iext(uri_owl_inverseOf,c2,uri_rdf_type) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 25 iext(uri_rdf_type,uri_ex_JoesGang,uri_ex_Clique) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 26 iext(uri_rdf_type,uri_ex_alice,uri_ex_JoesGang) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 27 iext(uri_rdf_type,uri_ex_bob,uri_ex_JoesGang) # label(testcase_premise_fullish_013_Cliques) # label(axiom). [clausify(8)].
% 101.41/101.73 28 -iext(uri_foaf_knows,uri_ex_alice,uri_ex_bob) # label(testcase_conclusion_fullish_013_Cliques) # label(negated_conjecture). [assumption].
% 101.41/101.73 35 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 101.41/101.73 37 -iext(uri_owl_sameAs,A,B) | B = A # label(owl_eqdis_sameas) # label(axiom). [clausify(5)].
% 101.41/101.73 39 -iext(uri_rdfs_subClassOf,A,B) | -icext(A,C) | icext(B,C) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(3)].
% 101.41/101.73 40 -iext(uri_rdfs_subPropertyOf,A,B) | -iext(A,C,D) | iext(B,C,D) # label(owl_rdfsext_subpropertyof) # label(axiom). [clausify(4)].
% 101.41/101.73 42 -iext(uri_owl_inverseOf,A,B) | iext(A,C,D) | -iext(B,D,C) # label(owl_inv) # label(axiom). [clausify(7)].
% 101.41/101.73 49 -iext(uri_owl_someValuesFrom,A,B) | -iext(uri_owl_onProperty,A,C) | -icext(A,D) | iext(C,D,f1(A,C,B,D)) # label(owl_restrict_somevaluesfrom) # label(axiom). [clausify(2)].
% 101.41/101.73 56 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,E) | -iext(uri_rdf_first,E,F) | -iext(uri_rdf_rest,E,uri_rdf_nil) | -iext(uri_owl_propertyChainAxiom,V6,A) | -iext(B,V7,V8) | -iext(D,V8,V9) | -iext(F,V9,V10) | iext(V6,V7,V10) # label(owl_chain_003) # label(axiom). [clausify(6)].
% 101.41/101.73 2020 icext(uri_ex_Clique,uri_ex_JoesGang). [resolve(35,a,25,a)].
% 101.41/101.73 2025 -icext(uri_ex_Clique,A) | icext(c1,A). [resolve(39,a,12,a)].
% 101.41/101.73 2026 -iext(uri_ex_sameCliqueAs,A,B) | iext(uri_owl_sameAs,A,B). [resolve(40,a,10,a)].
% 101.41/101.73 2066 iext(c2,A,B) | -iext(uri_rdf_type,B,A). [resolve(42,a,24,a)].
% 101.41/101.73 2110 -iext(uri_owl_onProperty,c1,A) | -icext(c1,B) | iext(A,B,f1(c1,A,uri_ex_Clique,B)). [resolve(49,a,15,a)].
% 101.41/101.73 16907 icext(c1,uri_ex_JoesGang). [resolve(2025,a,2020,a)].
% 101.41/101.73 16964 iext(c2,uri_ex_JoesGang,uri_ex_bob). [resolve(2066,b,27,a)].
% 101.41/101.73 17649 -icext(c1,A) | iext(uri_ex_sameCliqueAs,A,f1(c1,uri_ex_sameCliqueAs,uri_ex_Clique,A)). [resolve(2110,a,14,a)].
% 101.41/101.73 17652 iext(uri_ex_sameCliqueAs,uri_ex_JoesGang,f1(c1,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)). [resolve(17649,a,16907,a)].
% 101.41/101.73 17653 iext(uri_owl_sameAs,uri_ex_JoesGang,f1(c1,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)). [resolve(17652,a,2026,a)].
% 101.41/101.73 17658 -iext(c2,f1(c1,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang),uri_ex_bob). [ur(56,a,18,a,b,19,a,c,20,a,d,21,a,e,22,a,f,23,a,g,17,a,h,26,a,i,17652,a,k,28,a)].
% 101.41/101.73 17664 f1(c1,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang) = uri_ex_JoesGang. [resolve(17653,a,37,a)].
% 101.41/101.73 17665 $F. [back_rewrite(17658),rewrite([17664(6)]),unit_del(a,16964)].
% 101.41/101.73
% 101.41/101.73 % SZS output end Refutation
% 101.41/101.73 ============================== end of proof ==========================
% 101.41/101.73
% 101.41/101.73 ============================== STATISTICS ============================
% 101.41/101.73
% 101.41/101.73 Given=2199. Generated=96485. Kept=17656. proofs=1.
% 101.41/101.73 Usable=2199. Sos=9122. Demods=1. Limbo=1, Disabled=6386. Hints=0.
% 101.41/101.73 Megabytes=27.37.
% 101.41/101.73 User_CPU=100.67, System_CPU=0.08, Wall_clock=101.
% 101.41/101.73
% 101.41/101.73 ============================== end of statistics =====================
% 101.41/101.73
% 101.41/101.73 ============================== end of search =========================
% 101.41/101.73
% 101.41/101.73 THEOREM PROVED
% 101.41/101.73 % SZS status Theorem
% 101.41/101.73
% 101.41/101.73 Exiting with 1 proof.
% 101.41/101.73
% 101.41/101.73 Process 31553 exit (max_proofs) Wed Jun 1 10:48:08 2022
% 101.41/101.73 Prover9 interrupted
%------------------------------------------------------------------------------