0.09/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.33 % Computer : n016.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 : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 03:04:42 EDT 2022 0.13/0.33 % CPUTime : 0.70/0.99 ============================== Prover9 =============================== 0.70/0.99 Prover9 (32) version 2009-11A, November 2009. 0.70/0.99 Process 10232 was started by sandbox2 on n016.cluster.edu, 0.70/0.99 Tue Aug 9 03:04:42 2022 0.70/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_9972_n016.cluster.edu". 0.70/0.99 ============================== end of head =========================== 0.70/0.99 0.70/0.99 ============================== INPUT ================================= 0.70/0.99 0.70/0.99 % Reading from file /tmp/Prover9_9972_n016.cluster.edu 0.70/0.99 0.70/0.99 set(prolog_style_variables). 0.70/0.99 set(auto2). 0.70/0.99 % set(auto2) -> set(auto). 0.70/0.99 % set(auto) -> set(auto_inference). 0.70/0.99 % set(auto) -> set(auto_setup). 0.70/0.99 % set(auto_setup) -> set(predicate_elim). 0.70/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.70/0.99 % set(auto) -> set(auto_limits). 0.70/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.70/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.70/0.99 % set(auto) -> set(auto_denials). 0.70/0.99 % set(auto) -> set(auto_process). 0.70/0.99 % set(auto2) -> assign(new_constants, 1). 0.70/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.70/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.70/0.99 % set(auto2) -> assign(max_hours, 1). 0.70/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.70/0.99 % set(auto2) -> assign(max_seconds, 0). 0.70/0.99 % set(auto2) -> assign(max_minutes, 5). 0.70/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.70/0.99 % set(auto2) -> set(sort_initial_sos). 0.70/0.99 % set(auto2) -> assign(sos_limit, -1). 0.70/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.70/0.99 % set(auto2) -> assign(max_megs, 400). 0.70/0.99 % set(auto2) -> assign(stats, some). 0.70/0.99 % set(auto2) -> clear(echo_input). 0.70/0.99 % set(auto2) -> set(quiet). 0.70/0.99 % set(auto2) -> clear(print_initial_clauses). 0.70/0.99 % set(auto2) -> clear(print_given). 0.70/0.99 assign(lrs_ticks,-1). 0.70/0.99 assign(sos_limit,10000). 0.70/0.99 assign(order,kbo). 0.70/0.99 set(lex_order_vars). 0.70/0.99 clear(print_given). 0.70/0.99 0.70/0.99 % formulas(sos). % not echoed (48 formulas) 0.70/0.99 0.70/0.99 ============================== end of input ========================== 0.70/0.99 0.70/0.99 % From the command line: assign(max_seconds, 960). 0.70/0.99 0.70/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.70/0.99 0.70/0.99 % Formulas that are not ordinary clauses: 0.70/0.99 1 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (all W2 (W2 = sdtpldt1(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> (exists W4 exists W5 (aElementOf0(W4,W0) & aElementOf0(W5,W1) & sdtpldt0(W4,W5) = W3)))))))) # label(mDefSSum) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 2 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (all W2 (W2 = sdtasasdt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElementOf0(W3,W0) & aElementOf0(W3,W1))))))) # label(mDefSInt) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 3 (all W0 (aIdeal0(W0) <-> aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> (all W2 (aElementOf0(W2,W0) -> aElementOf0(sdtpldt0(W1,W2),W0))) & (all W2 (aElement0(W2) -> aElementOf0(sdtasdt0(W2,W1),W0))))))) # label(mDefIdeal) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 4 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aIdeal0(W2) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) <-> aElementOf0(sdtpldt0(W0,smndt0(W1)),W2)))) # label(mDefMod) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 5 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (doDivides0(W0,W1) <-> (exists W2 (aElement0(W2) & sdtasdt0(W0,W2) = W1))))) # label(mDefDiv) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 6 (all W0 (aElement0(W0) -> (all W1 (aDivisorOf0(W1,W0) <-> aElement0(W1) & doDivides0(W1,W0))))) # label(mDefDvs) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 7 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (all W2 (aGcdOfAnd0(W2,W0,W1) <-> aDivisorOf0(W2,W0) & aDivisorOf0(W2,W1) & (all W3 (aDivisorOf0(W3,W0) & aDivisorOf0(W3,W1) -> doDivides0(W3,W2))))))) # label(mDefGCD) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 8 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (misRelativelyPrime0(W0,W1) <-> aGcdOfAnd0(sz10,W0,W1)))) # label(mDefRel) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 9 (all W0 (aElement0(W0) -> (all W1 (W1 = slsdtgt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> (exists W3 (aElement0(W3) & sdtasdt0(W0,W3) = W2)))))))) # label(mDefPrIdeal) # label(definition) # label(non_clause). [assumption]. 0.70/0.99 10 (all W0 all W1 (aIdeal0(W1) & aIdeal0(W0) -> aIdeal0(sdtpldt1(W0,W1)))) # label(mIdeSum) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 11 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> ((all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))) & (all W2 (aElementOf0(W2,W0) -> aElementOf0(W2,W1))) -> W1 = W0))) # label(mSetEq) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 12 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 13 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 14 (all W0 (aNaturalNumber0(W0) -> $T)) # label(mNatSort) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 15 (all W0 all W1 (aElement0(W0) & aElement0(W1) & W1 != sz00 -> (exists W2 exists W3 (aElement0(W2) & aElement0(W3) & W0 = sdtpldt0(sdtasdt0(W2,W1),W3) & (W3 != sz00 -> iLess0(sbrdtbr0(W3),sbrdtbr0(W1))))))) # label(mDivision) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 16 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 17 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 18 (all W0 all W1 (aIdeal0(W1) & aIdeal0(W0) -> aIdeal0(sdtasasdt0(W0,W1)))) # label(mIdeInt) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 19 (exists W0 (aElement0(W0) & sdtasdt0(xc,W0) = xy)) # label(m__1933_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 0.70/0.99 20 (exists W0 (xx = sdtasdt0(xc,W0) & aElement0(W0))) # label(m__1933_AndRHS_AndRHS_AndRHS_AndRHS) # label(hypothesis) # label(non_clause). [assumption]. 0.70/0.99 21 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 22 (all W0 (aElement0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & sdtasdt0(W0,smndt0(sz10)) = smndt0(W0))) # label(mMulMnOne) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 23 (all W0 (aElement0(W0) -> sz00 = sdtpldt0(smndt0(W0),W0) & sz00 = sdtpldt0(W0,smndt0(W0)))) # label(mAddInvr) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 24 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 25 (all W0 (aElement0(W0) -> W0 = sdtpldt0(sz00,W0) & W0 = sdtpldt0(W0,sz00))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 26 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)))) # label(mMulAsso) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 27 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 28 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> (sz00 = sdtasdt0(W0,W1) -> sz00 = W0 | W1 = sz00))) # label(mCancel) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 29 (all W0 (aElement0(W0) -> sdtasdt0(W0,sz00) = sz00 & sz00 = sdtasdt0(sz00,W0))) # label(mMulZero) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 30 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W2) & aElement0(W1) -> sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) & sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) = sdtasdt0(W0,sdtpldt0(W1,W2)))) # label(mAMDistr) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 31 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (iLess0(W0,W1) -> $T))) # label(mNatLess) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 32 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 33 (all W0 (aElement0(W0) -> W0 = sdtasdt0(sz10,W0) & sdtasdt0(W0,sz10) = W0)) # label(mMulUnit) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 34 (all W0 all W1 (aIdeal0(W1) & aIdeal0(W0) -> ((all W2 (aElement0(W2) -> aElementOf0(W2,sdtpldt1(W0,W1)))) -> (all W2 all W3 (aElement0(W3) & aElement0(W2) -> (exists W4 (aElement0(W4) & sdteqdtlpzmzozddtrp0(W4,W2,W0) & sdteqdtlpzmzozddtrp0(W4,W3,W1)))))))) # label(mChineseRemainder) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 35 (all W0 (W0 != sz00 & aElement0(W0) -> aNaturalNumber0(sbrdtbr0(W0)))) # label(mEucSort) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 36 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtpldt0(W1,W0) = sdtpldt0(W0,W1))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption]. 0.70/0.99 0.70/0.99 ============================== end of process non-clausal formulas === 0.70/0.99 0.70/0.99 ============================== PROCESS INITIAL CLAUSES =============== 0.70/0.99 0.70/0.99 ============================== PREDICATE ELIMINATION ================= 0.70/0.99 37 -aElement0(A) | -aElement0(B) | -aIdeal0(C) | sdteqdtlpzmzozddtrp0(A,B,C) | -aElementOf0(sdtpldt0(A,smndt0(B)),C) # label(mDefMod) # label(definition). [clausify(4)]. 0.70/0.99 38 -aElement0(A) | -aElement0(B) | -aIdeal0(C) | -sdteqdtlpzmzozddtrp0(A,B,C) | aElementOf0(sdtpldt0(A,smndt0(B)),C) # label(mDefMod) # label(definition). [clausify(4)]. 0.70/0.99 39 -aIdeal0(A) | -aIdeal0(B) | aElement0(f19(B,A)) | -aElement0(C) | -aElement0(D) | sdteqdtlpzmzozddtrp0(f20(B,A,D,C),D,B) # label(mChineseRemainder) # label(axiom). [clausify(34)]. 0.70/0.99 Derived: -aIdeal0(A) | -aIdeal0(B) | aElement0(f19(B,A)) | -aElement0(C) | -aElement0(D) | -aElement0(f20(B,A,D,C)) | -aElement0(D) | -aIdeal0(B) | aElementOf0(sdtpldt0(f20(B,A,D,C),smndt0(D)),B). [resolve(39,f,38,d)]. 0.70/0.99 40 -aIdeal0(A) | -aIdeal0(B) | aElement0(f19(B,A)) | -aElement0(C) | -aElement0(D) | sdteqdtlpzmzozddtrp0(f20(B,A,D,C),C,A) # label(mChineseRemainder) # label(axiom). [clausify(34)]. 0.70/0.99 Derived: -aIdeal0(A) | -aIdeal0(B) | aElement0(f19(B,A)) | -aElement0(C) | -aElement0(D) | -aElement0(f20(B,A,D,C)) | -aElement0(C) | -aIdeal0(A) | aElementOf0(sdtpldt0(f20(B,A,D,C),smndt0(C)),A). [resolve(40,f,38,d)]. 0.70/0.99 41 -aIdeal0(A) | -aIdeal0(B) | -aElementOf0(f19(B,A),sdtpldt1(B,A)) | -aElement0(C) | -aElement0(D) | sdteqdtlpzmzozddtrp0(f20(B,A,D,C),D,B) # label(mChineseRemainder) # label(axiom). [clausify(34)]. 0.70/0.99 Derived: -aIdeal0(A) | -aIdeal0(B) | -aElementOf0(f19(B,A),sdtpldt1(B,A)) | -aElement0(C) | -aElement0(D) | -aElement0(f20(B,A,D,C)) | -aElement0(D) | -aIdeal0(B) | aElementOf0(sdtpldt0(f20(B,A,D,C),smndt0(D)),B). [resolve(41,f,38,d)]. 0.70/0.99 42 -aIdeal0(A) | -aIdeal0(B) | -aElementOf0(f19(B,A),sdtpldt1(B,A)) | -aElement0(C) | -aElement0(D) | sdteqdtlpzmzozddtrp0(f20(B,A,D,C),C,A) # label(mChineseRemainder) # label(axiom). [clausify(34)]. 0.70/0.99 Derived: -aIdeal0(A) | -aIdeal0(B) | -aElementOf0(f19(B,A),sdtpldt1(B,A)) | -aElement0(C) | -aElement0(D) | -aElement0(f20(B,A,D,C)) | -aElement0(C) | -aIdeal0(A) | aElementOf0(sdtpldt0(f20(B,A,D,C),smndt0(C)),A). [resolve(42,f,38,d)]. 0.70/0.99 43 -aElement0(A) | -aElement0(B) | misRelativelyPrime0(A,B) | -aGcdOfAnd0(sz10,A,B) # label(mDefRel) # label(definition). [clausify(8)]. 0.70/0.99 44 -aElement0(A) | -aElement0(B) | -misRelativelyPrime0(A,B) | aGcdOfAnd0(sz10,A,B) # label(mDefRel) # label(definition). [clausify(8)]. 0.70/0.99 45 -aElement0(A) | -aElement0(B) | aGcdOfAnd0(C,A,B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | aDivisorOf0(f11(A,B,C),A) # label(mDefGCD) # label(definition). [clausify(7)]. 0.70/0.99 46 -aElement0(A) | -aElement0(B) | -aGcdOfAnd0(C,A,B) | aDivisorOf0(C,A) # label(mDefGCD) # label(definition). [clausify(7)]. 0.70/0.99 47 -aElement0(A) | -aElement0(B) | -aGcdOfAnd0(C,A,B) | aDivisorOf0(C,B) # label(mDefGCD) # label(definition). [clausify(7)]. 0.70/0.99 48 -aElement0(A) | -aElement0(B) | -aGcdOfAnd0(C,A,B) | -aDivisorOf0(D,A) | -aDivisorOf0(D,B) | doDivides0(D,C) # label(mDefGCD) # label(definition). [clausify(7)]. 0.70/0.99 Derived: -aElement0(A) | -aElement0(B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | aDivisorOf0(f11(A,B,C),A) | -aElement0(A) | -aElement0(B) | -aDivisorOf0(D,A) | -aDivisorOf0(D,B) | doDivides0(D,C). [resolve(45,c,48,c)]. 0.70/0.99 49 -aElement0(A) | -aElement0(B) | aGcdOfAnd0(C,A,B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | aDivisorOf0(f11(A,B,C),B) # label(mDefGCD) # label(definition). [clausify(7)]. 0.74/1.08 Derived: -aElement0(A) | -aElement0(B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | aDivisorOf0(f11(A,B,C),B) | -aElement0(A) | -aElement0(B) | -aDivisorOf0(D,A) | -aDivisorOf0(D,B) | doDivides0(D,C). [resolve(49,c,48,c)]. 0.74/1.08 50 -aElement0(A) | -aElement0(B) | aGcdOfAnd0(C,A,B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | -doDivides0(f11(A,B,C),C) # label(mDefGCD) # label(definition). [clausify(7)]. 0.74/1.08 Derived: -aElement0(A) | -aElement0(B) | -aDivisorOf0(C,A) | -aDivisorOf0(C,B) | -doDivides0(f11(A,B,C),C) | -aElement0(A) | -aElement0(B) | -aDivisorOf0(D,A) | -aDivisorOf0(D,B) | doDivides0(D,C). [resolve(50,c,48,c)]. 0.74/1.08 0.74/1.08 ============================== end predicate elimination ============= 0.74/1.08 0.74/1.08 Auto_denials: (non-Horn, no changes). 0.74/1.08 0.74/1.08 Term ordering decisions: 0.74/1.08 Function symbol KB weights: sz00=1. xc=1. sz10=1. xx=1. xy=1. xu=1. xv=1. xz=1. c1=1. c2=1. sdtasdt0=1. sdtpldt0=1. sdtpldt1=1. sdtasasdt0=1. f10=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. smndt0=1. slsdtgt0=1. f7=1. f8=1. f9=1. f3=1. f4=1. f5=1. f6=1. f11=1. f12=1. f1=1. f2=1. f20=1. 0.74/1.08 0.74/1.08 ============================== end of process initial clauses ======== 0.74/1.08 0.74/1.08 ============================== CLAUSES FOR SEARCH ==================== 0.74/1.08 0.74/1.08 ============================== end of clauses for search ============= 0.74/1.08 0.74/1.08 ============================== SEARCH ================================ 0.74/1.08 0.74/1.08 % Starting search at 0.04 seconds. 0.74/1.08 0.74/1.08 ============================== PROOF ================================= 0.74/1.08 % SZS status Theorem 0.74/1.08 % SZS output start Refutation 0.74/1.08 0.74/1.08 % Proof 1 at 0.10 (+ 0.00) seconds. 0.74/1.08 % Length of proof is 16. 0.74/1.08 % Level of proof is 5. 0.74/1.08 % Maximum clause weight is 19.000. 0.74/1.08 % Given clauses 83. 0.74/1.08 0.74/1.08 19 (exists W0 (aElement0(W0) & sdtasdt0(xc,W0) = xy)) # label(m__1933_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 0.74/1.08 30 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W2) & aElement0(W1) -> sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) & sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) = sdtasdt0(W0,sdtpldt0(W1,W2)))) # label(mAMDistr) # label(axiom) # label(non_clause). [assumption]. 0.74/1.08 101 aElement0(xu) # label(m__1956_AndLHS) # label(hypothesis). [assumption]. 0.74/1.08 102 sdtasdt0(xc,xu) = xx # label(m__1956_AndRHS) # label(hypothesis). [assumption]. 0.74/1.08 103 xx = sdtasdt0(xc,xu). [copy(102),flip(a)]. 0.74/1.08 112 sdtasdt0(xc,c1) = xy # label(m__1933_AndRHS_AndRHS_AndLHS) # label(hypothesis). [clausify(19)]. 0.74/1.08 113 xy = sdtasdt0(xc,c1). [copy(112),flip(a)]. 0.74/1.08 130 xy = sdtasdt0(xc,xv) # label(m__1979_AndLHS) # label(hypothesis). [assumption]. 0.74/1.08 131 sdtasdt0(xc,c1) = sdtasdt0(xc,xv). [copy(130),rewrite([113(1)])]. 0.74/1.08 132 aElement0(xv) # label(m__1979_AndRHS) # label(hypothesis). [assumption]. 0.74/1.08 135 aElement0(xc) # label(m__1905) # label(hypothesis). [assumption]. 0.74/1.08 138 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtasdt0(A,sdtpldt0(C,B)) = sdtpldt0(sdtasdt0(A,C),sdtasdt0(A,B)) # label(mAMDistr) # label(axiom). [clausify(30)]. 0.74/1.08 139 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtpldt0(sdtasdt0(A,C),sdtasdt0(A,B)) = sdtasdt0(A,sdtpldt0(C,B)). [copy(138),flip(d)]. 0.74/1.08 146 sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)) # label(m__) # label(negated_conjecture). [assumption]. 0.74/1.08 147 sdtpldt0(sdtasdt0(xc,xu),sdtasdt0(xc,xv)) != sdtasdt0(xc,sdtpldt0(xu,xv)). [copy(146),rewrite([103(1),113(4),131(6)])]. 0.74/1.08 753 $F. [ur(139,b,132,a,c,101,a,d,147,a),unit_del(a,135)]. 0.74/1.08 0.74/1.08 % SZS output end Refutation 0.74/1.08 ============================== end of proof ========================== 0.74/1.08 0.74/1.08 ============================== STATISTICS ============================ 0.74/1.08 0.74/1.08 Given=83. Generated=820. Kept=683. proofs=1. 0.74/1.08 Usable=83. Sos=596. Demods=79. Limbo=0, Disabled=112. Hints=0. 0.74/1.08 Megabytes=0.93. 0.74/1.08 User_CPU=0.10, System_CPU=0.00, Wall_clock=0. 0.74/1.08 0.74/1.08 ============================== end of statistics ===================== 0.74/1.08 0.74/1.08 ============================== end of search ========================= 0.74/1.08 0.74/1.08 THEOREM PROVED 0.74/1.08 % SZS status Theorem 0.74/1.08 0.74/1.08 Exiting with 1 proof. 0.74/1.08 0.74/1.08 Process 10232 exit (max_proofs) Tue Aug 9 03:04:42 2022 0.74/1.08 Prover9 interrupted 0.74/1.08 EOF