TSTP Solution File: LAT386+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT386+4 : 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 : n025.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 : Sun Jul 17 04:51:56 EDT 2022
% Result : Theorem 48.85s 6.50s
% Output : CNFRefutation 48.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT386+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 29 18:28:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.38 # No SInE strategy applied
% 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.38 #
% 0.19/0.38 # Presaturation interreduction done
% 0.19/0.38 # Number of axioms: 109 Number of unprocessed: 109
% 0.19/0.38 # Tableaux proof search.
% 0.19/0.38 # APR header successfully linked.
% 0.19/0.38 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 109 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 9 conjectures.
% 0.19/0.38 # There are 9 start rule candidates:
% 0.19/0.38 # Found 16 unit axioms.
% 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.38 # 9 start rule tableaux created.
% 0.19/0.38 # 93 extension rule candidate clauses
% 0.19/0.38 # 16 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 36.56/4.96 # Creating equality axioms
% 36.56/4.96 # Ran out of tableaux, making start rules for all clauses
% 48.85/6.50 # There were 9 total branch saturation attempts.
% 48.85/6.50 # There were 0 of these attempts blocked.
% 48.85/6.50 # There were 0 deferred branch saturation attempts.
% 48.85/6.50 # There were 0 free duplicated saturations.
% 48.85/6.50 # There were 4 total successful branch saturations.
% 48.85/6.50 # There were 0 successful branch saturations in interreduction.
% 48.85/6.50 # There were 0 successful branch saturations on the branch.
% 48.85/6.50 # There were 4 successful branch saturations after the branch.
% 48.85/6.50 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 48.85/6.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 48.85/6.50 # Begin clausification derivation
% 48.85/6.50
% 48.85/6.50 # End clausification derivation
% 48.85/6.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 48.85/6.50 cnf(i_0_55, hypothesis, (szRzazndt0(xf)=xU)).
% 48.85/6.50 cnf(i_0_90, hypothesis, (aElementOf0(xp,xU))).
% 48.85/6.50 cnf(i_0_88, hypothesis, (aLowerBoundOfIn0(xp,xP,xU))).
% 48.85/6.50 cnf(i_0_65, hypothesis, (cS1142(xf)=xS)).
% 48.85/6.50 cnf(i_0_64, hypothesis, (aSet0(xU))).
% 48.85/6.50 cnf(i_0_71, hypothesis, (aSet0(xS))).
% 48.85/6.50 cnf(i_0_74, hypothesis, (aSet0(xT))).
% 48.85/6.50 cnf(i_0_83, hypothesis, (aSet0(xP))).
% 48.85/6.50 cnf(i_0_60, hypothesis, (aCompleteLattice0(xU))).
% 48.85/6.50 cnf(i_0_59, hypothesis, (aFunction0(xf))).
% 48.85/6.50 cnf(i_0_57, hypothesis, (isMonotone0(xf))).
% 48.85/6.50 cnf(i_0_72, hypothesis, (aSubsetOf0(xT,xS))).
% 48.85/6.50 cnf(i_0_54, hypothesis, (isOn0(xf,xU))).
% 48.85/6.50 cnf(i_0_75, hypothesis, (cS1241(xU,xf,xT)=xP)).
% 48.85/6.50 cnf(i_0_56, hypothesis, (szDzozmdt0(xf)=xU)).
% 48.85/6.50 cnf(i_0_84, hypothesis, (aInfimumOfIn0(xp,xP,xU))).
% 48.85/6.50 cnf(i_0_99, negated_conjecture, (aElementOf0(esk16_0,xT)|aElementOf0(esk15_0,xP))).
% 48.85/6.50 cnf(i_0_98, negated_conjecture, (aElementOf0(esk15_0,xP)|~sdtlseqdt0(esk16_0,sdtlpdtrp0(xf,xp)))).
% 48.85/6.50 cnf(i_0_38, plain, (aSet0(X1)|~aCompleteLattice0(X1))).
% 48.85/6.50 cnf(i_0_96, negated_conjecture, (aElementOf0(esk16_0,xT)|~sdtlseqdt0(sdtlpdtrp0(xf,xp),esk15_0))).
% 48.85/6.50 cnf(i_0_95, negated_conjecture, (~sdtlseqdt0(esk16_0,sdtlpdtrp0(xf,xp))|~sdtlseqdt0(sdtlpdtrp0(xf,xp),esk15_0))).
% 48.85/6.50 cnf(i_0_97, negated_conjecture, (aElementOf0(esk15_0,xP)|~aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU))).
% 48.85/6.50 cnf(i_0_93, negated_conjecture, (aElementOf0(esk16_0,xT)|~aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU))).
% 48.85/6.50 cnf(i_0_61, hypothesis, (epred1_1(X1)|~aSubsetOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_5, plain, (~isEmpty0(X1)|~aElementOf0(X2,X1)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_9, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_92, negated_conjecture, (~aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU)|~sdtlseqdt0(esk16_0,sdtlpdtrp0(xf,xp)))).
% 48.85/6.50 cnf(i_0_94, negated_conjecture, (~aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU)|~sdtlseqdt0(sdtlpdtrp0(xf,xp),esk15_0))).
% 48.85/6.50 cnf(i_0_91, negated_conjecture, (~aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU)|~aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU))).
% 48.85/6.50 cnf(i_0_82, hypothesis, (aElementOf0(X1,xU)|~aElementOf0(X1,xP))).
% 48.85/6.50 cnf(i_0_66, hypothesis, (aElementOf0(X1,xS)|~aFixedPointOf0(X1,xf))).
% 48.85/6.50 cnf(i_0_11, plain, (sdtlseqdt0(X1,X1)|~aElement0(X1))).
% 48.85/6.50 cnf(i_0_40, plain, (aSet0(szDzozmdt0(X1))|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_89, hypothesis, (sdtlseqdt0(xp,X1)|~aElementOf0(X1,xP))).
% 48.85/6.50 cnf(i_0_85, hypothesis, (sdtlseqdt0(X1,xp)|~aLowerBoundOfIn0(X1,xP,xU))).
% 48.85/6.50 cnf(i_0_79, hypothesis, (aUpperBoundOfIn0(X1,xT,xU)|~aElementOf0(X1,xP))).
% 48.85/6.50 cnf(i_0_73, hypothesis, (aElementOf0(X1,xS)|~aElementOf0(X1,xT))).
% 48.85/6.50 cnf(i_0_69, hypothesis, (sdtlpdtrp0(xf,X1)=X1|~aElementOf0(X1,xS))).
% 48.85/6.50 cnf(i_0_41, plain, (aSet0(szRzazndt0(X1))|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_68, hypothesis, (aFixedPointOf0(X1,xf)|~aElementOf0(X1,xS))).
% 48.85/6.50 cnf(i_0_62, hypothesis, (epred1_1(X1)|~aElementOf0(esk12_1(X1),xU)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_47, plain, (sdtlpdtrp0(X1,X2)=X2|~aFixedPointOf0(X2,X1)|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_48, plain, (aElementOf0(X1,szDzozmdt0(X2))|~aFixedPointOf0(X1,X2)|~aFunction0(X2))).
% 48.85/6.50 cnf(i_0_113, plain, (aElementOf0(esk17_1(X1),xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_81, hypothesis, (sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)|~aElementOf0(X1,xP))).
% 48.85/6.50 cnf(i_0_106, plain, (aElementOf0(esk19_1(X1),xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_70, hypothesis, (aElementOf0(X1,xU)|~aElementOf0(X1,xS))).
% 48.85/6.50 cnf(i_0_80, hypothesis, (sdtlseqdt0(X1,X2)|~aElementOf0(X2,xP)|~aElementOf0(X1,xT))).
% 48.85/6.50 cnf(i_0_4, plain, (isEmpty0(X1)|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_111, plain, (aLowerBoundOfIn0(esk17_1(X1),X1,xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_43, plain, (szRzazndt0(X1)=X2|~isOn0(X1,X2)|~aFunction0(X1)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_44, plain, (szRzazndt0(X1)=szDzozmdt0(X1)|~isOn0(X1,X2)|~aFunction0(X1)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_86, hypothesis, (sdtlseqdt0(X1,xp)|~sdtlseqdt0(X1,esk14_1(X1))|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_17, plain, (aElementOf0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_104, plain, (aUpperBoundOfIn0(esk19_1(X1),X1,xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_87, hypothesis, (sdtlseqdt0(X1,xp)|aElementOf0(esk14_1(X1),xP)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_67, hypothesis, (aElementOf0(X1,xS)|sdtlpdtrp0(xf,X1)!=X1|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_76, hypothesis, (aElementOf0(X1,xP)|~aUpperBoundOfIn0(X1,xT,xU)|~sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_77, hypothesis, (aElementOf0(X1,xP)|~sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)|~sdtlseqdt0(esk13_1(X1),X1)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_35, plain, (aCompleteLattice0(X1)|aSubsetOf0(esk9_1(X1),X1)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_107, plain, (aInfimumOfIn0(esk17_1(X1),X1,xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_21, plain, (aElementOf0(X1,X2)|~aUpperBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_26, plain, (aElementOf0(X1,X2)|~aInfimumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_31, plain, (aElementOf0(X1,X2)|~aSupremumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_105, plain, (sdtlseqdt0(X1,esk19_1(X2))|~epred1_1(X2)|~aElementOf0(X1,X2))).
% 48.85/6.50 cnf(i_0_100, plain, (aSupremumOfIn0(esk19_1(X1),X1,xU)|~epred1_1(X1))).
% 48.85/6.50 cnf(i_0_112, plain, (sdtlseqdt0(esk17_1(X1),X2)|~epred1_1(X1)|~aElementOf0(X2,X1))).
% 48.85/6.50 cnf(i_0_108, plain, (sdtlseqdt0(X1,esk17_1(X2))|~epred1_1(X2)|~aLowerBoundOfIn0(X1,X2,xU))).
% 48.85/6.50 cnf(i_0_101, plain, (sdtlseqdt0(esk19_1(X1),X2)|~epred1_1(X1)|~aUpperBoundOfIn0(X2,X1,xU))).
% 48.85/6.50 cnf(i_0_78, hypothesis, (aElementOf0(esk13_1(X1),xT)|aElementOf0(X1,xP)|~sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_63, hypothesis, (epred1_1(X1)|aElementOf0(esk12_1(X1),X1)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_52, plain, (isMonotone0(X1)|aElementOf0(esk10_1(X1),szDzozmdt0(X1))|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_6, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_25, plain, (aLowerBoundOfIn0(X1,X2,X3)|~aInfimumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_30, plain, (aUpperBoundOfIn0(X1,X2,X3)|~aSupremumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_46, plain, (aFixedPointOf0(X1,X2)|sdtlpdtrp0(X2,X1)!=X1|~aFunction0(X2)|~aElementOf0(X1,szDzozmdt0(X2)))).
% 48.85/6.50 cnf(i_0_51, plain, (isMonotone0(X1)|aElementOf0(esk11_1(X1),szDzozmdt0(X1))|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_58, hypothesis, (sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2))|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,xU)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_109, plain, (sdtlseqdt0(X1,esk17_1(X2))|~epred1_1(X2)|~sdtlseqdt0(X1,esk18_2(X2,X1))|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_102, plain, (sdtlseqdt0(esk19_1(X1),X2)|~epred1_1(X1)|~sdtlseqdt0(esk20_2(X1,X2),X2)|~aElementOf0(X2,xU))).
% 48.85/6.50 cnf(i_0_50, plain, (isMonotone0(X1)|sdtlseqdt0(esk10_1(X1),esk11_1(X1))|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_45, plain, (aElementOf0(sdtlpdtrp0(X1,X2),szRzazndt0(X1))|~aFunction0(X1)|~aElementOf0(X2,szDzozmdt0(X1)))).
% 48.85/6.50 cnf(i_0_12, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 48.85/6.50 cnf(i_0_8, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_49, plain, (isMonotone0(X1)|~aFunction0(X1)|~sdtlseqdt0(sdtlpdtrp0(X1,esk10_1(X1)),sdtlpdtrp0(X1,esk11_1(X1))))).
% 48.85/6.50 cnf(i_0_34, plain, (aCompleteLattice0(X1)|~aSupremumOfIn0(X2,esk9_1(X1),X1)|~aInfimumOfIn0(X3,esk9_1(X1),X1)|~aSet0(X1))).
% 48.85/6.50 cnf(i_0_37, plain, (aInfimumOfIn0(esk7_2(X1,X2),X2,X1)|~aCompleteLattice0(X1)|~aSubsetOf0(X2,X1))).
% 48.85/6.50 cnf(i_0_110, plain, (sdtlseqdt0(X1,esk17_1(X2))|aElementOf0(esk18_2(X2,X1),X2)|~epred1_1(X2)|~aElementOf0(X1,xU))).
% 48.85/6.50 cnf(i_0_103, plain, (sdtlseqdt0(esk19_1(X1),X2)|aElementOf0(esk20_2(X1,X2),X1)|~epred1_1(X1)|~aElementOf0(X2,xU))).
% 48.85/6.50 cnf(i_0_42, plain, (isOn0(X1,szRzazndt0(X1))|szRzazndt0(X1)!=szDzozmdt0(X1)|~aFunction0(X1))).
% 48.85/6.50 cnf(i_0_16, plain, (sdtlseqdt0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X2,X3)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_7, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))).
% 48.85/6.50 cnf(i_0_36, plain, (aSupremumOfIn0(esk8_2(X1,X2),X2,X1)|~aCompleteLattice0(X1)|~aSubsetOf0(X2,X1))).
% 48.85/6.50 cnf(i_0_33, plain, (X1=X2|~aInfimumOfIn0(X2,X3,X4)|~aInfimumOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_32, plain, (X1=X2|~aSupremumOfIn0(X2,X3,X4)|~aSupremumOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_20, plain, (sdtlseqdt0(X1,X2)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X1,X3)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_14, plain, (aLowerBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(X1,esk3_3(X3,X2,X1))|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_15, plain, (aLowerBoundOfIn0(X1,X2,X3)|aElementOf0(esk3_3(X3,X2,X1),X2)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_18, plain, (aUpperBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(esk4_3(X3,X2,X1),X1)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_13, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))).
% 48.85/6.50 cnf(i_0_29, plain, (sdtlseqdt0(X1,X2)|~aSupremumOfIn0(X1,X3,X4)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_24, plain, (sdtlseqdt0(X1,X2)|~aInfimumOfIn0(X2,X3,X4)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 48.85/6.50 cnf(i_0_53, plain, (sdtlseqdt0(sdtlpdtrp0(X1,X2),sdtlpdtrp0(X1,X3))|~isMonotone0(X1)|~aFunction0(X1)|~sdtlseqdt0(X2,X3)|~aElementOf0(X3,szDzozmdt0(X1))|~aElementOf0(X2,szDzozmdt0(X1)))).
% 48.85/6.50 cnf(i_0_19, plain, (aUpperBoundOfIn0(X1,X2,X3)|aElementOf0(esk4_3(X3,X2,X1),X2)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_27, plain, (aSupremumOfIn0(X1,X2,X3)|~aUpperBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(X1,esk6_3(X3,X2,X1))|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_22, plain, (aInfimumOfIn0(X1,X2,X3)|~aLowerBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(esk5_3(X3,X2,X1),X1)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_23, plain, (aInfimumOfIn0(X1,X2,X3)|aLowerBoundOfIn0(esk5_3(X3,X2,X1),X2,X3)|~aLowerBoundOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_28, plain, (aSupremumOfIn0(X1,X2,X3)|aUpperBoundOfIn0(esk6_3(X3,X2,X1),X2,X3)|~aUpperBoundOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 48.85/6.50 cnf(i_0_146520, plain, (X99=X99)).
% 48.85/6.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 48.85/6.50 # Begin printing tableau
% 48.85/6.50 # Found 8 steps
% 48.85/6.50 cnf(i_0_146520, plain, (xU=xU), inference(start_rule)).
% 48.85/6.50 cnf(i_0_146867, plain, (xU=xU), inference(extension_rule, [i_0_146524])).
% 48.85/6.50 cnf(i_0_147183, plain, (~aSet0(xU)), inference(closure_rule, [i_0_64])).
% 48.85/6.50 cnf(i_0_147181, plain, (aSet0(xU)), inference(extension_rule, [i_0_4])).
% 48.85/6.50 cnf(i_0_190547, plain, (isEmpty0(xU)), inference(etableau_closure_rule, [i_0_190547, ...])).
% 48.85/6.50 cnf(i_0_190548, plain, (aElementOf0(esk1_1(xU),xU)), inference(extension_rule, [i_0_86])).
% 48.85/6.50 cnf(i_0_236225, plain, (sdtlseqdt0(esk1_1(xU),xp)), inference(etableau_closure_rule, [i_0_236225, ...])).
% 48.85/6.50 cnf(i_0_236226, plain, (~sdtlseqdt0(esk1_1(xU),esk14_1(esk1_1(xU)))), inference(etableau_closure_rule, [i_0_236226, ...])).
% 48.85/6.50 # End printing tableau
% 48.85/6.50 # SZS output end
% 48.85/6.50 # Branches closed with saturation will be marked with an "s"
% 48.85/6.51 # Child (10192) has found a proof.
% 48.85/6.51
% 48.85/6.51 # Proof search is over...
% 48.85/6.51 # Freeing feature tree
%------------------------------------------------------------------------------