TSTP Solution File: RNG106+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n029.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 20:27:23 EDT 2022
% Result : Theorem 0.22s 0.43s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n029.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 : Mon May 30 11:52:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y
% 0.22/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.22/0.39 #
% 0.22/0.39 # Presaturation interreduction done
% 0.22/0.39 # Number of axioms: 98 Number of unprocessed: 98
% 0.22/0.39 # Tableaux proof search.
% 0.22/0.39 # APR header successfully linked.
% 0.22/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 98 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 9 conjectures.
% 0.22/0.39 # There are 9 start rule candidates:
% 0.22/0.39 # Found 5 unit axioms.
% 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.39 # 9 start rule tableaux created.
% 0.22/0.39 # 93 extension rule candidate clauses
% 0.22/0.39 # 5 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.43 # There were 2 total branch saturation attempts.
% 0.22/0.43 # There were 0 of these attempts blocked.
% 0.22/0.43 # There were 0 deferred branch saturation attempts.
% 0.22/0.43 # There were 0 free duplicated saturations.
% 0.22/0.43 # There were 2 total successful branch saturations.
% 0.22/0.43 # There were 0 successful branch saturations in interreduction.
% 0.22/0.43 # There were 0 successful branch saturations on the branch.
% 0.22/0.43 # There were 2 successful branch saturations after the branch.
% 0.22/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.43 # Begin clausification derivation
% 0.22/0.43
% 0.22/0.43 # End clausification derivation
% 0.22/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.43 cnf(i_0_93, hypothesis, (aElement0(xc))).
% 0.22/0.43 cnf(i_0_2, plain, (aElement0(sz00))).
% 0.22/0.43 cnf(i_0_3, plain, (aElement0(sz10))).
% 0.22/0.43 cnf(i_0_94, negated_conjecture, (~aIdeal0(slsdtgt0(xc)))).
% 0.22/0.43 cnf(i_0_24, plain, (sz10!=sz00)).
% 0.22/0.43 cnf(i_0_54, plain, (aSet0(X1)|~aIdeal0(X1))).
% 0.22/0.43 cnf(i_0_4, plain, (aElement0(smndt0(X1))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_77, plain, (aElement0(X1)|~aDivisorOf0(X1,X2)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_26, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_92, plain, (aSet0(slsdtgt0(X1))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_21, plain, (sdtasdt0(sz00,X1)=sz00|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_22, plain, (sdtasdt0(X1,sz00)=sz00|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_66, plain, (X1=sz00|aNaturalNumber0(sbrdtbr0(X1))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_76, plain, (doDivides0(X1,X2)|~aDivisorOf0(X1,X2)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_75, plain, (aDivisorOf0(X1,X2)|~doDivides0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_82, plain, (aDivisorOf0(X1,X2)|~aGcdOfAnd0(X1,X3,X2)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_83, plain, (aDivisorOf0(X1,X2)|~aGcdOfAnd0(X1,X2,X3)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_5, plain, (aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_6, plain, (aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_55, plain, (aIdeal0(sdtpldt1(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1))).
% 0.22/0.43 cnf(i_0_56, plain, (aIdeal0(sdtasasdt0(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1))).
% 0.22/0.43 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_19, plain, (sdtasdt0(X1,smndt0(sz10))=smndt0(X1)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_85, plain, (aGcdOfAnd0(sz10,X1,X2)|~misRelativelyPrime0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_39, plain, (aSet0(sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_20, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_96, negated_conjecture, (aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_95, negated_conjecture, (aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))|~aElementOf0(X3,slsdtgt0(xc))|~aElementOf0(X2,slsdtgt0(xc))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_51, plain, (aIdeal0(X1)|aElementOf0(esk9_1(X1),X1)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_102, negated_conjecture, (aElement0(esk21_3(X1,X2,X3))|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_46, plain, (aSet0(sdtasasdt0(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_84, plain, (misRelativelyPrime0(X1,X2)|~aGcdOfAnd0(sz10,X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_74, plain, (aElement0(esk16_2(X1,X2))|~doDivides0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_13, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_100, negated_conjecture, (aElement0(esk22_3(X1,X2,X3))|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_52, plain, (aElementOf0(sdtasdt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X2,X3)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_71, plain, (X1=sz00|aElement0(esk14_2(X2,X1))|~aElement0(X1)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_70, plain, (X1=sz00|aElement0(esk15_2(X2,X1))|~aElement0(X1)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_72, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aElement0(X1)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_50, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|aElement0(esk11_1(X1))|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_53, plain, (aElementOf0(sdtpldt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X1,X3)|~aElementOf0(X2,X3))).
% 0.22/0.43 cnf(i_0_57, plain, (sdteqdtlpzmzozddtrp0(X1,X2,X3)|~aIdeal0(X3)|~aElementOf0(sdtpldt0(X1,smndt0(X2)),X3)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_27, plain, (X1=X2|~aElementOf0(esk1_2(X1,X2),X2)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_91, plain, (aElement0(esk18_3(X1,slsdtgt0(X1),X2))|~aElementOf0(X2,slsdtgt0(X1))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_101, negated_conjecture, (sdtasdt0(xc,esk21_3(X1,X2,X3))=X1|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_99, negated_conjecture, (sdtasdt0(xc,esk22_3(X1,X2,X3))=X2|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_48, plain, (aIdeal0(X1)|aElement0(esk11_1(X1))|~aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_89, plain, (aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))|~aElement0(X1)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_73, plain, (sdtasdt0(X1,esk16_2(X1,X2))=X2|~doDivides0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_44, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X3,X2))|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_45, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X2,X3))|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_14, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_49, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|~aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_97, negated_conjecture, (sdtasdt0(xc,sdtasdt0(esk21_3(X1,X2,X3),X3))=sdtasdt0(X3,X1)|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_47, plain, (aIdeal0(X1)|~aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)|~aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_87, plain, (X1=slsdtgt0(X2)|aElementOf0(esk19_2(X2,X1),X1)|aElement0(esk20_2(X2,X1))|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_29, plain, (X1=X2|aElementOf0(esk1_2(X1,X2),X1)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_78, plain, (aGcdOfAnd0(X1,X2,X3)|~aDivisorOf0(X1,X3)|~aDivisorOf0(X1,X2)|~doDivides0(esk17_3(X2,X3,X1),X1)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_81, plain, (doDivides0(X1,X2)|~aGcdOfAnd0(X2,X3,X4)|~aDivisorOf0(X1,X4)|~aDivisorOf0(X1,X3)|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_90, plain, (sdtasdt0(X1,esk18_3(X1,slsdtgt0(X1),X2))=X2|~aElementOf0(X2,slsdtgt0(X1))|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_58, plain, (aElementOf0(sdtpldt0(X1,smndt0(X2)),X3)|~sdteqdtlpzmzozddtrp0(X1,X2,X3)|~aIdeal0(X3)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_43, plain, (aElementOf0(X1,sdtasasdt0(X2,X3))|~aElementOf0(X1,X3)|~aElementOf0(X1,X2)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_30, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|aElementOf0(esk1_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_69, plain, (sdtpldt0(sdtasdt0(esk14_2(X1,X2),X2),esk15_2(X1,X2))=X1|X2=sz00|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_28, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|~aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_88, plain, (X1=slsdtgt0(X2)|esk19_2(X2,X1)!=sdtasdt0(X2,X3)|~aElementOf0(esk19_2(X2,X1),X1)|~aSet0(X1)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_64, plain, (aElement0(esk13_4(X1,X2,X3,X4))|aElement0(esk12_2(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1)|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_98, negated_conjecture, (sdtasdt0(xc,sdtpldt0(esk21_3(X1,X2,X3),esk22_3(X1,X2,X3)))=sdtpldt0(X1,X2)|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X1,slsdtgt0(xc))|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_61, plain, (aElement0(esk13_4(X1,X2,X3,X4))|~aIdeal0(X2)|~aIdeal0(X1)|~aElementOf0(esk12_2(X1,X2),sdtpldt1(X1,X2))|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_35, plain, (aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4))|~aElementOf0(X2,X4)|~aElementOf0(X1,X3)|~aSet0(X4)|~aSet0(X3))).
% 0.22/0.43 cnf(i_0_38, plain, (aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_68, plain, (esk15_2(X1,X2)=sz00|X2=sz00|iLess0(sbrdtbr0(esk15_2(X1,X2)),sbrdtbr0(X2))|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_79, plain, (aGcdOfAnd0(X1,X2,X3)|aDivisorOf0(esk17_3(X2,X3,X1),X3)|~aDivisorOf0(X1,X3)|~aDivisorOf0(X1,X2)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_80, plain, (aGcdOfAnd0(X1,X2,X3)|aDivisorOf0(esk17_3(X2,X3,X1),X2)|~aDivisorOf0(X1,X3)|~aDivisorOf0(X1,X2)|~aElement0(X3)|~aElement0(X2))).
% 0.22/0.43 cnf(i_0_37, plain, (aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_62, plain, (sdteqdtlpzmzozddtrp0(esk13_4(X1,X2,X3,X4),X4,X2)|aElement0(esk12_2(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1)|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_86, plain, (sdtasdt0(X1,esk20_2(X1,X2))=esk19_2(X1,X2)|X2=slsdtgt0(X1)|aElementOf0(esk19_2(X1,X2),X2)|~aSet0(X2)|~aElement0(X1))).
% 0.22/0.43 cnf(i_0_63, plain, (sdteqdtlpzmzozddtrp0(esk13_4(X1,X2,X3,X4),X3,X1)|aElement0(esk12_2(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1)|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_59, plain, (sdteqdtlpzmzozddtrp0(esk13_4(X1,X2,X3,X4),X4,X2)|~aIdeal0(X2)|~aIdeal0(X1)|~aElementOf0(esk12_2(X1,X2),sdtpldt1(X1,X2))|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_60, plain, (sdteqdtlpzmzozddtrp0(esk13_4(X1,X2,X3,X4),X3,X1)|~aIdeal0(X2)|~aIdeal0(X1)|~aElementOf0(esk12_2(X1,X2),sdtpldt1(X1,X2))|~aElement0(X4)|~aElement0(X3))).
% 0.22/0.43 cnf(i_0_36, plain, (sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3))=X3|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 cnf(i_0_33, plain, (X1=sdtpldt1(X2,X3)|aElementOf0(esk6_3(X2,X3,X1),X2)|aElementOf0(esk5_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_42, plain, (X1=sdtasasdt0(X2,X3)|~aElementOf0(esk8_3(X2,X3,X1),X1)|~aElementOf0(esk8_3(X2,X3,X1),X3)|~aElementOf0(esk8_3(X2,X3,X1),X2)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_34, plain, (X1=sdtpldt1(X2,X3)|sdtpldt0(X4,X5)!=esk5_3(X2,X3,X1)|~aElementOf0(esk5_3(X2,X3,X1),X1)|~aElementOf0(X5,X3)|~aElementOf0(X4,X2)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_32, plain, (X1=sdtpldt1(X2,X3)|aElementOf0(esk7_3(X2,X3,X1),X3)|aElementOf0(esk5_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_40, plain, (X1=sdtasasdt0(X2,X3)|aElementOf0(esk8_3(X2,X3,X1),X3)|aElementOf0(esk8_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_41, plain, (X1=sdtasasdt0(X2,X3)|aElementOf0(esk8_3(X2,X3,X1),X2)|aElementOf0(esk8_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 0.22/0.43 cnf(i_0_31, plain, (sdtpldt0(esk6_3(X1,X2,X3),esk7_3(X1,X2,X3))=esk5_3(X1,X2,X3)|X3=sdtpldt1(X1,X2)|aElementOf0(esk5_3(X1,X2,X3),X3)|~aSet0(X3)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.43 # Begin printing tableau
% 0.22/0.43 # Found 6 steps
% 0.22/0.43 cnf(i_0_94, negated_conjecture, (~aIdeal0(slsdtgt0(xc))), inference(start_rule)).
% 0.22/0.43 cnf(i_0_151, plain, (~aIdeal0(slsdtgt0(xc))), inference(extension_rule, [i_0_51])).
% 0.22/0.43 cnf(i_0_602, plain, (aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))), inference(extension_rule, [i_0_91])).
% 0.22/0.43 cnf(i_0_730, plain, (~aElement0(xc)), inference(closure_rule, [i_0_93])).
% 0.22/0.43 cnf(i_0_603, plain, (~aSet0(slsdtgt0(xc))), inference(etableau_closure_rule, [i_0_603, ...])).
% 0.22/0.43 cnf(i_0_728, plain, (aElement0(esk18_3(xc,slsdtgt0(xc),esk9_1(slsdtgt0(xc))))), inference(etableau_closure_rule, [i_0_728, ...])).
% 0.22/0.43 # End printing tableau
% 0.22/0.43 # SZS output end
% 0.22/0.43 # Branches closed with saturation will be marked with an "s"
% 0.22/0.44 # Child (1785) has found a proof.
% 0.22/0.44
% 0.22/0.44 # Proof search is over...
% 0.22/0.44 # Freeing feature tree
%------------------------------------------------------------------------------