TSTP Solution File: NUM535+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM535+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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 : Mon Jul 18 13:28:36 EDT 2022
% Result : Theorem 23.57s 23.89s
% Output : Refutation 23.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM535+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.32 % Computer : n003.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Wed Jul 6 19:44:56 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 5831 was started by sandbox on n003.cluster.edu,
% 0.41/0.99 Wed Jul 6 19:44:57 2022
% 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5678_n003.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_5678_n003.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (19 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99 1 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 2 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 3 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 4 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 5 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause). [assumption].
% 0.41/0.99 6 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 7 (all W0 (aSet0(W0) & isCountable0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 8 (all W0 (aSet0(W0) & isCountable0(W0) -> W0 != slcrc0)) # label(mCountNFin_01) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 9 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mDefSub) # label(definition) # label(non_clause). [assumption].
% 0.41/0.99 10 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 11 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 12 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W0) -> W0 = W1))) # label(mSubASymm) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 13 (all W0 all W1 all W2 (aSet0(W0) & aSet0(W1) & aSet0(W2) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W2) -> aSubsetOf0(W0,W2)))) # label(mSubTrans) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 14 (all W0 all W1 (aSet0(W0) & aElement0(W1) -> (all W2 (W2 = sdtpldt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElement0(W3) & (aElementOf0(W3,W0) | W3 = W1))))))) # label(mDefCons) # label(definition) # label(non_clause). [assumption].
% 1.72/2.04 15 (all W0 all W1 (aSet0(W0) & aElement0(W1) -> (all W2 (W2 = sdtmndt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElement0(W3) & aElementOf0(W3,W0) & W3 != W1)))))) # label(mDefDiff) # label(definition) # label(non_clause). [assumption].
% 1.72/2.04 16 -((aSet0(sdtmndt0(xS,xx)) & (all W0 (aElementOf0(W0,sdtmndt0(xS,xx)) <-> aElement0(W0) & aElementOf0(W0,xS) & W0 != xx)) -> (aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) & (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) <-> aElement0(W0) & (aElementOf0(W0,sdtmndt0(xS,xx)) | W0 = xx))) -> (all W0 (aElementOf0(W0,xS) -> aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)))) | aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx)))) & (aSet0(sdtmndt0(xS,xx)) & (all W0 (aElementOf0(W0,sdtmndt0(xS,xx)) <-> aElement0(W0) & aElementOf0(W0,xS) & W0 != xx)) -> (aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) & (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) <-> aElement0(W0) & (aElementOf0(W0,sdtmndt0(xS,xx)) | W0 = xx))) -> (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) -> aElementOf0(W0,xS))) | aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS)))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.72/2.04
% 1.72/2.04 ============================== end of process non-clausal formulas ===
% 1.72/2.04
% 1.72/2.04 ============================== PROCESS INITIAL CLAUSES ===============
% 1.72/2.04
% 1.72/2.04 ============================== PREDICATE ELIMINATION =================
% 1.72/2.04
% 1.72/2.04 ============================== end predicate elimination =============
% 1.72/2.04
% 1.72/2.04 Auto_denials: (non-Horn, no changes).
% 1.72/2.04
% 1.72/2.04 Term ordering decisions:
% 1.72/2.04
% 1.72/2.04 % Assigning unary symbol f1 kb_weight 0 and highest precedence (17).
% 1.72/2.04 Function symbol KB weights: xx=1. xS=1. slcrc0=1. c1=1. c2=1. sdtmndt0=1. sdtpldt0=1. f2=1. f3=1. f4=1. f1=0.
% 1.72/2.04
% 1.72/2.04 ============================== end of process initial clauses ========
% 1.72/2.04
% 1.72/2.04 ============================== CLAUSES FOR SEARCH ====================
% 1.72/2.04
% 1.72/2.04 ============================== end of clauses for search =============
% 1.72/2.04
% 1.72/2.04 ============================== SEARCH ================================
% 1.72/2.04
% 1.72/2.04 % Starting search at 0.03 seconds.
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=70.000, iters=3357
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=65.000, iters=3339
% 1.72/2.04
% 1.72/2.04 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 27 (0.00 of 0.32 sec).
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=59.000, iters=3351
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=55.000, iters=3333
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=54.000, iters=3369
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=53.000, iters=3349
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=52.000, iters=3378
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=51.000, iters=3337
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=49.000, iters=3363
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=48.000, iters=3435
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=45.000, iters=3355
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=44.000, iters=3348
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=42.000, iters=3367
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=41.000, iters=3378
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=40.000, iters=3349
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=39.000, iters=3351
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=38.000, iters=3346
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=37.000, iters=3336
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=36.000, iters=3348
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=35.000, iters=3384
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=34.000, iters=3369
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=33.000, iters=3377
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=32.000, iters=3480
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=31.000, iters=3405
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=30.000, iters=3358
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=29.000, iters=3505
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=28.000, iters=3397
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=27.000, iters=3352
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=26.000, iters=3388
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=25.000, iters=3358
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=24.000, iters=3335
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=23.000, iters=3346
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=22.000, iters=3375
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4074, wt=70.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4070, wt=65.000
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=21.000, iters=3343
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4115, wt=60.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4104, wt=58.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4108, wt=57.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4114, wt=55.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=4238, wt=54.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=12301, wt=24.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=11830, wt=23.000
% 1.72/2.04
% 1.72/2.04 Low Water (keep): wt=20.000, iters=3348
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=13510, wt=22.000
% 1.72/2.04
% 1.72/2.04 Low Water (displace): id=13721, wt=19.000
% 23.57/23.89
% 23.57/23.89 Low Water (keep): wt=19.000, iters=3333
% 23.57/23.89
% 23.57/23.89 Low Water (displace): id=14573, wt=18.000
% 23.57/23.89
% 23.57/23.89 Low Water (displace): id=15691, wt=17.000
% 23.57/23.89
% 23.57/23.89 Low Water (keep): wt=18.000, iters=3348
% 23.57/23.89
% 23.57/23.89 Low Water (displace): id=25591, wt=16.000
% 23.57/23.89
% 23.57/23.89 Low Water (keep): wt=17.000, iters=3351
% 23.57/23.89
% 23.57/23.89 ============================== PROOF =================================
% 23.57/23.89 % SZS status Theorem
% 23.57/23.89 % SZS output start Refutation
% 23.57/23.89
% 23.57/23.89 % Proof 1 at 22.54 (+ 0.37) seconds.
% 23.57/23.89 % Length of proof is 47.
% 23.57/23.89 % Level of proof is 24.
% 23.57/23.89 % Maximum clause weight is 30.000.
% 23.57/23.89 % Given clauses 9978.
% 23.57/23.89
% 23.57/23.89 3 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption].
% 23.57/23.89 16 -((aSet0(sdtmndt0(xS,xx)) & (all W0 (aElementOf0(W0,sdtmndt0(xS,xx)) <-> aElement0(W0) & aElementOf0(W0,xS) & W0 != xx)) -> (aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) & (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) <-> aElement0(W0) & (aElementOf0(W0,sdtmndt0(xS,xx)) | W0 = xx))) -> (all W0 (aElementOf0(W0,xS) -> aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)))) | aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx)))) & (aSet0(sdtmndt0(xS,xx)) & (all W0 (aElementOf0(W0,sdtmndt0(xS,xx)) <-> aElement0(W0) & aElementOf0(W0,xS) & W0 != xx)) -> (aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) & (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) <-> aElement0(W0) & (aElementOf0(W0,sdtmndt0(xS,xx)) | W0 = xx))) -> (all W0 (aElementOf0(W0,sdtpldt0(sdtmndt0(xS,xx),xx)) -> aElementOf0(W0,xS))) | aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS)))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 23.57/23.89 17 -aSet0(A) | -aElementOf0(B,A) | aElement0(B) # label(mEOfElem) # label(axiom). [clausify(3)].
% 23.57/23.89 48 aSet0(xS) # label(m__617) # label(hypothesis). [assumption].
% 23.57/23.89 49 aElementOf0(xx,xS) # label(m__617_02) # label(hypothesis). [assumption].
% 23.57/23.89 61 -aElementOf0(A,sdtmndt0(xS,xx)) | aElementOf0(A,xS) | -aElementOf0(B,sdtmndt0(xS,xx)) | aElementOf0(B,xS) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 78 aElementOf0(A,sdtmndt0(xS,xx)) | -aElement0(A) | -aElementOf0(A,xS) | xx = A | aElementOf0(B,sdtmndt0(xS,xx)) | -aElement0(B) | -aElementOf0(B,xS) | xx = B # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 94 -aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | aElementOf0(A,sdtmndt0(xS,xx)) | xx = A | -aElementOf0(B,sdtpldt0(sdtmndt0(xS,xx),xx)) | aElementOf0(B,sdtmndt0(xS,xx)) | xx = B # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 100 aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(A) | -aElementOf0(A,sdtmndt0(xS,xx)) | aElementOf0(B,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(B) | -aElementOf0(B,sdtmndt0(xS,xx)) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 105 aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(A) | xx != A | aElementOf0(B,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(B) | xx != B # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 117 aElementOf0(c1,xS) | aElementOf0(c2,sdtpldt0(sdtmndt0(xS,xx),xx)) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 118 aElementOf0(c1,xS) | -aElementOf0(c2,xS) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 128 -aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)) | aElementOf0(c2,sdtpldt0(sdtmndt0(xS,xx),xx)) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 129 -aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElementOf0(c2,xS) # label(m__) # label(negated_conjecture). [clausify(16)].
% 23.57/23.89 153 -aElementOf0(A,sdtmndt0(xS,xx)) | aElementOf0(A,xS). [factor(61,a,c),merge(c)].
% 23.57/23.89 155 aElementOf0(A,sdtmndt0(xS,xx)) | -aElement0(A) | -aElementOf0(A,xS) | xx = A. [factor(78,a,e),merge(e),merge(f),merge(g)].
% 23.57/23.89 158 -aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | aElementOf0(A,sdtmndt0(xS,xx)) | xx = A. [factor(94,a,d),merge(d),merge(e)].
% 23.57/23.89 159 aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(A) | -aElementOf0(A,sdtmndt0(xS,xx)). [factor(100,a,d),merge(d),merge(e)].
% 23.57/23.89 160 aElementOf0(A,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(A) | xx != A. [factor(105,a,d),merge(d),merge(e)].
% 23.57/23.89 193 aElement0(xx). [resolve(49,a,17,b),unit_del(a,48)].
% 23.57/23.89 252 aElementOf0(c2,sdtmndt0(xS,xx)) | c2 = xx | aElementOf0(c1,xS). [resolve(158,a,117,b),flip(b)].
% 23.57/23.89 280 aElementOf0(xx,sdtpldt0(sdtmndt0(xS,xx),xx)). [resolve(193,a,160,b),xx(b)].
% 23.57/23.89 2417 c2 = xx | aElementOf0(c1,xS) | aElementOf0(c2,xS). [resolve(252,a,153,a)].
% 23.57/23.89 2426 c2 = xx | aElementOf0(c1,xS). [resolve(2417,c,118,b),merge(c)].
% 23.57/23.89 2427 c2 = xx | aElementOf0(c1,sdtmndt0(xS,xx)) | -aElement0(c1) | c1 = xx. [resolve(2426,b,155,c),flip(d)].
% 23.57/23.89 2435 c2 = xx | aElement0(c1). [resolve(2426,b,17,b),unit_del(b,48)].
% 23.57/23.89 14987 c2 = xx | aElementOf0(c1,sdtmndt0(xS,xx)) | c1 = xx. [resolve(2427,c,2435,b),merge(d)].
% 23.57/23.89 14988 c2 = xx | c1 = xx | aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(c1). [resolve(14987,b,159,c)].
% 23.57/23.89 114323 c2 = xx | c1 = xx | aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)). [resolve(14988,d,2435,b),merge(d)].
% 23.57/23.89 114358 c2 = xx | c1 = xx | -aElementOf0(c2,xS). [resolve(114323,c,129,a)].
% 23.57/23.89 114359 c2 = xx | c1 = xx | aElementOf0(c2,sdtpldt0(sdtmndt0(xS,xx),xx)). [resolve(114323,c,128,a)].
% 23.57/23.89 114360 c2 = xx | c1 = xx | aElementOf0(c2,sdtmndt0(xS,xx)). [resolve(114359,c,158,a),flip(d),merge(d)].
% 23.57/23.89 114487 c2 = xx | c1 = xx | aElementOf0(c2,xS). [resolve(114360,c,153,a)].
% 23.57/23.89 114488 c2 = xx | c1 = xx. [resolve(114487,c,114358,c),merge(c),merge(d)].
% 23.57/23.89 114493 c1 = xx | aElementOf0(c1,xS). [para(114488(a,1),118(b,1)),unit_del(c,49)].
% 23.57/23.89 114622 c1 = xx | aElementOf0(c1,sdtmndt0(xS,xx)) | -aElement0(c1). [resolve(114493,b,155,c),flip(d),merge(d)].
% 23.57/23.89 114628 c1 = xx | aElement0(c1). [resolve(114493,b,17,b),unit_del(b,48)].
% 23.57/23.89 115107 c1 = xx | aElementOf0(c1,sdtmndt0(xS,xx)). [resolve(114622,c,114628,b),merge(c)].
% 23.57/23.89 115108 c1 = xx | aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)) | -aElement0(c1). [resolve(115107,b,159,c)].
% 23.57/23.89 116980 c1 = xx | aElementOf0(c1,sdtpldt0(sdtmndt0(xS,xx),xx)). [resolve(115108,c,114628,b),merge(c)].
% 23.57/23.89 116981 c1 = xx | -aElementOf0(c2,xS). [resolve(116980,b,129,a)].
% 23.57/23.89 116983 c1 = xx. [para(114488(a,1),116981(b,1)),merge(b),unit_del(b,49)].
% 23.57/23.89 116986 -aElementOf0(c2,xS). [back_rewrite(129),rewrite([116983(1)]),unit_del(a,280)].
% 23.57/23.89 116987 aElementOf0(c2,sdtpldt0(sdtmndt0(xS,xx),xx)). [back_rewrite(128),rewrite([116983(1)]),unit_del(a,280)].
% 23.57/23.89 116989 aElementOf0(c2,sdtmndt0(xS,xx)) | c2 = xx. [resolve(116987,a,158,a),flip(b)].
% 23.57/23.89 119193 c2 = xx. [resolve(116989,a,153,a),unit_del(b,116986)].
% 23.57/23.89 119265 $F. [back_rewrite(116986),rewrite([119193(1)]),unit_del(a,49)].
% 23.57/23.89
% 23.57/23.89 % SZS output end Refutation
% 23.57/23.89 ============================== end of proof ==========================
% 23.57/23.89
% 23.57/23.89 ============================== STATISTICS ============================
% 23.57/23.89
% 23.57/23.89 Given=9978. Generated=655459. Kept=119248. proofs=1.
% 23.57/23.89 Usable=7553. Sos=6426. Demods=12. Limbo=72, Disabled=105355. Hints=0.
% 23.57/23.89 Megabytes=90.26.
% 23.57/23.89 User_CPU=22.54, System_CPU=0.37, Wall_clock=23.
% 23.57/23.89
% 23.57/23.89 ============================== end of statistics =====================
% 23.57/23.89
% 23.57/23.89 ============================== end of search =========================
% 23.57/23.89
% 23.57/23.89 THEOREM PROVED
% 23.57/23.89 % SZS status Theorem
% 23.57/23.89
% 23.57/23.89 Exiting with 1 proof.
% 23.57/23.89
% 23.57/23.89 Process 5831 exit (max_proofs) Wed Jul 6 19:45:20 2022
% 23.57/23.89 Prover9 interrupted
%------------------------------------------------------------------------------