TSTP Solution File: COM014+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COM014+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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 : Fri Jul 15 01:38:23 EDT 2022
% Result : Timeout 300.04s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COM014+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 19:51:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.06 ============================== Prover9 ===============================
% 0.47/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.06 Process 12866 was started by sandbox2 on n016.cluster.edu,
% 0.47/1.06 Thu Jun 16 19:51:05 2022
% 0.47/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12712_n016.cluster.edu".
% 0.47/1.06 ============================== end of head ===========================
% 0.47/1.06
% 0.47/1.06 ============================== INPUT =================================
% 0.47/1.06
% 0.47/1.06 % Reading from file /tmp/Prover9_12712_n016.cluster.edu
% 0.47/1.06
% 0.47/1.06 set(prolog_style_variables).
% 0.47/1.06 set(auto2).
% 0.47/1.06 % set(auto2) -> set(auto).
% 0.47/1.06 % set(auto) -> set(auto_inference).
% 0.47/1.06 % set(auto) -> set(auto_setup).
% 0.47/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.06 % set(auto) -> set(auto_limits).
% 0.47/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.06 % set(auto) -> set(auto_denials).
% 0.47/1.06 % set(auto) -> set(auto_process).
% 0.47/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.06 % set(auto2) -> assign(stats, some).
% 0.47/1.06 % set(auto2) -> clear(echo_input).
% 0.47/1.06 % set(auto2) -> set(quiet).
% 0.47/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.06 % set(auto2) -> clear(print_given).
% 0.47/1.06 assign(lrs_ticks,-1).
% 0.47/1.06 assign(sos_limit,10000).
% 0.47/1.06 assign(order,kbo).
% 0.47/1.06 set(lex_order_vars).
% 0.47/1.06 clear(print_given).
% 0.47/1.06
% 0.47/1.06 % formulas(sos). % not echoed (15 formulas)
% 0.47/1.06
% 0.47/1.06 ============================== end of input ==========================
% 0.47/1.06
% 0.47/1.06 % From the command line: assign(max_seconds, 300).
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.06
% 0.47/1.06 % Formulas that are not ordinary clauses:
% 0.47/1.06 1 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 2 (all W0 (aRewritingSystem0(W0) -> $T)) # label(mRelSort) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 3 (all W0 all W1 (aElement0(W0) & aRewritingSystem0(W1) -> (all W2 (aReductOfIn0(W2,W0,W1) -> aElement0(W2))))) # label(mReduct) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 4 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (iLess0(W0,W1) -> $T))) # label(mWFOrd) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 5 (all W0 all W1 all W2 (aElement0(W0) & aRewritingSystem0(W1) & aElement0(W2) -> (sdtmndtplgtdt0(W0,W1,W2) -> $T))) # label(mTCbr) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 6 (all W0 all W1 all W2 (aElement0(W0) & aRewritingSystem0(W1) & aElement0(W2) -> (sdtmndtplgtdt0(W0,W1,W2) <-> aReductOfIn0(W2,W0,W1) | (exists W3 (aElement0(W3) & aReductOfIn0(W3,W0,W1) & sdtmndtplgtdt0(W3,W1,W2)))))) # label(mTCDef) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 7 (all W0 all W1 all W2 all W3 (aElement0(W0) & aRewritingSystem0(W1) & aElement0(W2) & aElement0(W3) -> (sdtmndtplgtdt0(W0,W1,W2) & sdtmndtplgtdt0(W2,W1,W3) -> sdtmndtplgtdt0(W0,W1,W3)))) # label(mTCTrans) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 8 (all W0 all W1 all W2 (aElement0(W0) & aRewritingSystem0(W1) & aElement0(W2) -> (sdtmndtasgtdt0(W0,W1,W2) <-> W0 = W2 | sdtmndtplgtdt0(W0,W1,W2)))) # label(mTCRDef) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 9 (all W0 all W1 all W2 all W3 (aElement0(W0) & aRewritingSystem0(W1) & aElement0(W2) & aElement0(W3) -> (sdtmndtasgtdt0(W0,W1,W2) & sdtmndtasgtdt0(W2,W1,W3) -> sdtmndtasgtdt0(W0,W1,W3)))) # label(mTCRTrans) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 10 (all W0 (aRewritingSystem0(W0) -> (isConfluent0(W0) <-> (all W1 all W2 all W3 (aElement0(W1) & aElement0(W2) & aElement0(W3) & sdtmndtasgtdt0(W1,W0,W2) & sdtmndtasgtdt0(W1,W0,W3) -> (exists W4 (aElement0(W4) & sdtmndtasgtdt0(W2,W0,W4) & sdtmndtasgtdt0(W3,W0,W4)))))))) # label(mCRDef) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 11 (all W0 (aRewritingSystem0(W0) -> (isLocallyConfluent0(W0) <-> (all W1 all W2 all W3 (aElement0(W1) & aElement0(W2) & aElement0(W3) & aReductOfIn0(W2,W1,W0) & aReductOfIn0(W3,W1,W0) -> (exists W4 (aElement0(W4) & sdtmndtasgtdt0(W2,W0,W4) & sdtmndtasgtdt0(W3,W0,W4)))))))) # label(mWCRDef) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 12 (all W0 (aRewritingSystem0(W0) -> (isTerminating0(W0) <-> (all W1 all W2 (aElement0(W1) & aElement0(W2) -> (sdtmndtplgtdt0(W1,W0,W2) -> iLess0(W2,W1))))))) # label(mTermin) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 13 (all W0 all W1 (aElement0(W0) & aRewritingSystem0(W1) -> (all W2 (aNormalFormOfIn0(W2,W0,W1) <-> aElement0(W2) & sdtmndtasgtdt0(W0,W1,W2) & -(exists W3 aReductOfIn0(W3,W2,W1)))))) # label(mNFRDef) # label(definition) # label(non_clause). [assumption].
% 0.47/1.06 14 (all W0 (aRewritingSystem0(W0) & isTerminating0(W0) -> (all W1 (aElement0(W1) -> (exists W2 aNormalFormOfIn0(W2,W1,W0)))))) # label(mTermNF) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 15 -(all W0 (aRewritingSystem0(W0) & isTerminating0(W0) & isLocallyConfluent0(W0) -> isConfluent0(W0))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.06
% 0.47/1.06 ============================== end of process non-clausal formulas ===
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.06
% 0.47/1.06 ============================== PREDICATE ELIMINATION =================
% 0.47/1.06 16 -aElement0(A) | -aRewritingSystem0(B) | -aNormalFormOfIn0(C,A,B) | -aReductOfIn0(D,C,B) # label(mNFRDef) # label(definition). [clausify(13)].
% 0.47/1.06 17 aRewritingSystem0(c1) # label(m__) # label(negated_conjecture). [clausify(15)].
% 0.47/1.06 Derived: -aElement0(A) | -aNormalFormOfIn0(B,A,c1) | -aReductOfIn0(C,B,c1). [resolve(16,b,17,a)].
% 0.47/1.06 18 -aRewritingSystem0(A) | isConfluent0(A) | aElement0(f3(A)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.06 Derived: isConfluent0(c1) | aElement0(f3(c1)). [resolve(18,a,17,a)].
% 0.47/1.06 19 -aRewritingSystem0(A) | isConfluent0(A) | aElement0(f4(A)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.06 Derived: isConfluent0(c1) | aElement0(f4(c1)). [resolve(19,a,17,a)].
% 0.47/1.06 20 -aRewritingSystem0(A) | isConfluent0(A) | aElement0(f5(A)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.06 Derived: isConfluent0(c1) | aElement0(f5(c1)). [resolve(20,a,17,a)].
% 0.47/1.06 21 -aRewritingSystem0(A) | isLocallyConfluent0(A) | aElement0(f7(A)) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.06 Derived: isLocallyConfluent0(c1) | aElement0(f7(c1)). [resolve(21,a,17,a)].
% 0.47/1.06 22 -aRewritingSystem0(A) | isLocallyConfluent0(A) | aElement0(f8(A)) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.06 Derived: isLocallyConfluent0(c1) | aElement0(f8(c1)). [resolve(22,a,17,a)].
% 0.47/1.06 23 -aRewritingSystem0(A) | isLocallyConfluent0(A) | aElement0(f9(A)) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.06 Derived: isLocallyConfluent0(c1) | aElement0(f9(c1)). [resolve(23,a,17,a)].
% 0.47/1.06 24 -aRewritingSystem0(A) | isTerminating0(A) | aElement0(f10(A)) # label(mTermin) # label(definition). [clausify(12)].
% 0.47/1.06 Derived: isTerminating0(c1) | aElement0(f10(c1)). [resolve(24,a,17,a)].
% 0.47/1.06 25 -aRewritingSystem0(A) | isTerminating0(A) | aElement0(f11(A)) # label(mTermin) # label(definition). [clausify(12)].
% 0.47/1.06 Derived: isTerminating0(c1) | aElement0(f11(c1)). [resolve(25,a,17,a)].
% 0.47/1.06 26 -aRewritingSystem0(A) | isTerminating0(A) | -iLess0(f11(A),f10(A)) # label(mTermin) # label(definition). [clausify(12)].
% 0.47/1.06 Derived: isTerminating0(c1) | -iLess0(f11(c1),f10(c1)). [resolve(26,a,17,a)].
% 0.47/1.06 27 -aElement0(A) | -aRewritingSystem0(B) | -aReductOfIn0(C,A,B) | aElement0(C) # label(mReduct) # label(axiom). [clausify(3)].
% 0.47/1.06 Derived: -aElement0(A) | -aReductOfIn0(B,A,c1) | aElement0(B). [resolve(27,b,17,a)].
% 0.47/1.06 28 -aRewritingSystem0(A) | isConfluent0(A) | sdtmndtasgtdt0(f3(A),A,f4(A)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.06 Derived: isConfluent0(c1) | sdtmndtasgtdt0(f3(c1),c1,f4(c1)). [resolve(28,a,17,a)].
% 0.47/1.06 29 -aRewritingSystem0(A) | isConfluent0(A) | sdtmndtasgtdt0(f3(A),A,f5(A)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.07 Derived: isConfluent0(c1) | sdtmndtasgtdt0(f3(c1),c1,f5(c1)). [resolve(29,a,17,a)].
% 0.47/1.07 30 -aRewritingSystem0(A) | isLocallyConfluent0(A) | aReductOfIn0(f8(A),f7(A),A) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.07 Derived: isLocallyConfluent0(c1) | aReductOfIn0(f8(c1),f7(c1),c1). [resolve(30,a,17,a)].
% 0.47/1.07 31 -aRewritingSystem0(A) | isLocallyConfluent0(A) | aReductOfIn0(f9(A),f7(A),A) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.07 Derived: isLocallyConfluent0(c1) | aReductOfIn0(f9(c1),f7(c1),c1). [resolve(31,a,17,a)].
% 0.47/1.07 32 -aRewritingSystem0(A) | isTerminating0(A) | sdtmndtplgtdt0(f10(A),A,f11(A)) # label(mTermin) # label(definition). [clausify(12)].
% 0.47/1.07 Derived: isTerminating0(c1) | sdtmndtplgtdt0(f10(c1),c1,f11(c1)). [resolve(32,a,17,a)].
% 0.47/1.07 33 -aElement0(A) | -aRewritingSystem0(B) | -aNormalFormOfIn0(C,A,B) | aElement0(C) # label(mNFRDef) # label(definition). [clausify(13)].
% 0.47/1.07 Derived: -aElement0(A) | -aNormalFormOfIn0(B,A,c1) | aElement0(B). [resolve(33,b,17,a)].
% 0.47/1.07 34 -aElement0(A) | -aRewritingSystem0(B) | -aNormalFormOfIn0(C,A,B) | sdtmndtasgtdt0(A,B,C) # label(mNFRDef) # label(definition). [clausify(13)].
% 0.47/1.07 Derived: -aElement0(A) | -aNormalFormOfIn0(B,A,c1) | sdtmndtasgtdt0(A,c1,B). [resolve(34,b,17,a)].
% 0.47/1.07 35 -aRewritingSystem0(A) | -isTerminating0(A) | -aElement0(B) | aNormalFormOfIn0(f13(A,B),B,A) # label(mTermNF) # label(axiom). [clausify(14)].
% 0.47/1.07 Derived: -isTerminating0(c1) | -aElement0(A) | aNormalFormOfIn0(f13(c1,A),A,c1). [resolve(35,a,17,a)].
% 0.47/1.07 36 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | sdtmndtasgtdt0(A,B,C) | C != A # label(mTCRDef) # label(definition). [clausify(8)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | sdtmndtasgtdt0(A,c1,B) | B != A. [resolve(36,b,17,a)].
% 0.47/1.07 37 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | sdtmndtplgtdt0(A,B,C) | -aReductOfIn0(C,A,B) # label(mTCDef) # label(definition). [clausify(6)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | sdtmndtplgtdt0(A,c1,B) | -aReductOfIn0(B,A,c1). [resolve(37,b,17,a)].
% 0.47/1.07 38 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | sdtmndtasgtdt0(A,B,C) | -sdtmndtplgtdt0(A,B,C) # label(mTCRDef) # label(definition). [clausify(8)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | sdtmndtasgtdt0(A,c1,B) | -sdtmndtplgtdt0(A,c1,B). [resolve(38,b,17,a)].
% 0.47/1.07 39 -aRewritingSystem0(A) | -isTerminating0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtplgtdt0(B,A,C) | iLess0(C,B) # label(mTermin) # label(definition). [clausify(12)].
% 0.47/1.07 Derived: -isTerminating0(c1) | -aElement0(A) | -aElement0(B) | -sdtmndtplgtdt0(A,c1,B) | iLess0(B,A). [resolve(39,a,17,a)].
% 0.47/1.07 40 -aRewritingSystem0(A) | isConfluent0(A) | -aElement0(B) | -sdtmndtasgtdt0(f4(A),A,B) | -sdtmndtasgtdt0(f5(A),A,B) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.07 Derived: isConfluent0(c1) | -aElement0(A) | -sdtmndtasgtdt0(f4(c1),c1,A) | -sdtmndtasgtdt0(f5(c1),c1,A). [resolve(40,a,17,a)].
% 0.47/1.07 41 -aRewritingSystem0(A) | isLocallyConfluent0(A) | -aElement0(B) | -sdtmndtasgtdt0(f8(A),A,B) | -sdtmndtasgtdt0(f9(A),A,B) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.07 Derived: isLocallyConfluent0(c1) | -aElement0(A) | -sdtmndtasgtdt0(f8(c1),c1,A) | -sdtmndtasgtdt0(f9(c1),c1,A). [resolve(41,a,17,a)].
% 0.47/1.07 42 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -sdtmndtasgtdt0(A,B,C) | C = A | sdtmndtplgtdt0(A,B,C) # label(mTCRDef) # label(definition). [clausify(8)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -sdtmndtasgtdt0(A,c1,B) | B = A | sdtmndtplgtdt0(A,c1,B). [resolve(42,b,17,a)].
% 0.47/1.07 43 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -sdtmndtplgtdt0(A,B,C) | aReductOfIn0(C,A,B) | aElement0(f1(A,B,C)) # label(mTCDef) # label(definition). [clausify(6)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -sdtmndtplgtdt0(A,c1,B) | aReductOfIn0(B,A,c1) | aElement0(f1(A,c1,B)). [resolve(43,b,17,a)].
% 0.47/1.07 44 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | sdtmndtplgtdt0(A,B,C) | -aElement0(D) | -aReductOfIn0(D,A,B) | -sdtmndtplgtdt0(D,B,C) # label(mTCDef) # label(definition). [clausify(6)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | sdtmndtplgtdt0(A,c1,B) | -aElement0(C) | -aReductOfIn0(C,A,c1) | -sdtmndtplgtdt0(C,c1,B). [resolve(44,b,17,a)].
% 0.47/1.07 45 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -aElement0(D) | -sdtmndtplgtdt0(A,B,C) | -sdtmndtplgtdt0(C,B,D) | sdtmndtplgtdt0(A,B,D) # label(mTCTrans) # label(axiom). [clausify(7)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtplgtdt0(A,c1,B) | -sdtmndtplgtdt0(B,c1,C) | sdtmndtplgtdt0(A,c1,C). [resolve(45,b,17,a)].
% 0.47/1.07 46 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -aElement0(D) | -sdtmndtasgtdt0(A,B,C) | -sdtmndtasgtdt0(C,B,D) | sdtmndtasgtdt0(A,B,D) # label(mTCRTrans) # label(axiom). [clausify(9)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtasgtdt0(A,c1,B) | -sdtmndtasgtdt0(B,c1,C) | sdtmndtasgtdt0(A,c1,C). [resolve(46,b,17,a)].
% 0.47/1.07 47 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -sdtmndtplgtdt0(A,B,C) | aReductOfIn0(C,A,B) | aReductOfIn0(f1(A,B,C),A,B) # label(mTCDef) # label(definition). [clausify(6)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -sdtmndtplgtdt0(A,c1,B) | aReductOfIn0(B,A,c1) | aReductOfIn0(f1(A,c1,B),A,c1). [resolve(47,b,17,a)].
% 0.47/1.07 48 -aElement0(A) | -aRewritingSystem0(B) | -aElement0(C) | -sdtmndtplgtdt0(A,B,C) | aReductOfIn0(C,A,B) | sdtmndtplgtdt0(f1(A,B,C),B,C) # label(mTCDef) # label(definition). [clausify(6)].
% 0.47/1.07 Derived: -aElement0(A) | -aElement0(B) | -sdtmndtplgtdt0(A,c1,B) | aReductOfIn0(B,A,c1) | sdtmndtplgtdt0(f1(A,c1,B),c1,B). [resolve(48,b,17,a)].
% 0.47/1.07 49 -aElement0(A) | -aRewritingSystem0(B) | aNormalFormOfIn0(C,A,B) | -aElement0(C) | -sdtmndtasgtdt0(A,B,C) | aReductOfIn0(f12(A,B,C),C,B) # label(mNFRDef) # label(definition). [clausify(13)].
% 0.47/1.07 Derived: -aElement0(A) | aNormalFormOfIn0(B,A,c1) | -aElement0(B) | -sdtmndtasgtdt0(A,c1,B) | aReductOfIn0(f12(A,c1,B),B,c1). [resolve(49,b,17,a)].
% 0.47/1.07 50 -aRewritingSystem0(A) | -isConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -sdtmndtasgtdt0(B,A,C) | -sdtmndtasgtdt0(B,A,D) | aElement0(f2(A,B,C,D)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.07 Derived: -isConfluent0(c1) | -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtasgtdt0(A,c1,B) | -sdtmndtasgtdt0(A,c1,C) | aElement0(f2(c1,A,B,C)). [resolve(50,a,17,a)].
% 0.47/1.07 51 -aRewritingSystem0(A) | -isLocallyConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -aReductOfIn0(C,B,A) | -aReductOfIn0(D,B,A) | aElement0(f6(A,B,C,D)) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.07 Derived: -isLocallyConfluent0(c1) | -aElement0(A) | -aElement0(B) | -aElement0(C) | -aReductOfIn0(B,A,c1) | -aReductOfIn0(C,A,c1) | aElement0(f6(c1,A,B,C)). [resolve(51,a,17,a)].
% 0.47/1.07 52 -aRewritingSystem0(A) | -isConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -sdtmndtasgtdt0(B,A,C) | -sdtmndtasgtdt0(B,A,D) | sdtmndtasgtdt0(C,A,f2(A,B,C,D)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.07 Derived: -isConfluent0(c1) | -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtasgtdt0(A,c1,B) | -sdtmndtasgtdt0(A,c1,C) | sdtmndtasgtdt0(B,c1,f2(c1,A,B,C)). [resolve(52,a,17,a)].
% 0.47/1.07 53 -aRewritingSystem0(A) | -isConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -sdtmndtasgtdt0(B,A,C) | -sdtmndtasgtdt0(B,A,D) | sdtmndtasgtdt0(D,A,f2(A,B,C,D)) # label(mCRDef) # label(definition). [clausify(10)].
% 0.47/1.07 Derived: -isConfluent0(c1) | -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtmndtasgtdt0(A,c1,B) | -sdtmndtasgtdt0(A,c1,C) | sdtmndtasgtdt0(C,c1,f2(c1,A,B,C)). [resolve(53,a,17,a)].
% 0.47/1.07 54 -aRewritingSystem0(A) | -isLocallyConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -aReductOfIn0(C,B,A) | -aReductOfIn0(D,B,A) | sdtmndtasgtdt0(C,A,f6(A,B,C,D)) # label(mWCRDef) # label(definition). [clausify(11)].
% 0.47/1.07 Derived: -isLocallyConfluent0(c1) | -aElement0(A) | -aElement0(B) | -aElement0(C) | -aReductOfIn0(B,A,c1) | -aReductOfIn0(C,A,c1) | sdtmndtasgtdt0(B,c1,f6(c1,A,B,C)). [resolve(54,a,17,a)].
% 0.47/1.07 55 -aRewritingSystem0(A) | -isLocallyConfluent0(A) | -aElement0(B) | -aElement0(C) | -aElement0(D) | -aReductOfIn0(C,B,A) | -aReductOfIn0(D,B,A) | sdtmndtasgtdt0(D,A,f6(A,B,C,D)) Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------