TSTP Solution File: NUM538+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM538+2 : 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 : n007.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 09:42:06 EDT 2022
% Result : Theorem 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM538+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jul 7 01:27:14 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.40 # No SInE strategy applied
% 0.22/0.40 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.22/0.40 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.22/0.40 #
% 0.22/0.40 # Number of axioms: 73 Number of unprocessed: 73
% 0.22/0.40 # Tableaux proof search.
% 0.22/0.40 # APR header successfully linked.
% 0.22/0.40 # Hello from C++
% 0.22/0.40 # The folding up rule is enabled...
% 0.22/0.40 # Local unification is enabled...
% 0.22/0.40 # Any saturation attempts will use folding labels...
% 0.22/0.40 # 73 beginning clauses after preprocessing and clausification
% 0.22/0.40 # Creating start rules for all 6 conjectures.
% 0.22/0.40 # There are 6 start rule candidates:
% 0.22/0.40 # Found 9 unit axioms.
% 0.22/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.40 # 6 start rule tableaux created.
% 0.22/0.40 # 64 extension rule candidate clauses
% 0.22/0.40 # 9 unit axiom clauses
% 0.22/0.40
% 0.22/0.40 # Requested 8, 32 cores available to the main process.
% 0.22/0.40 # There are not enough tableaux to fork, creating more from the initial 6
% 0.22/0.40 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.40 # We now have 26 tableaux to operate on
% 0.22/0.48 # There were 6 total branch saturation attempts.
% 0.22/0.48 # There were 0 of these attempts blocked.
% 0.22/0.48 # There were 0 deferred branch saturation attempts.
% 0.22/0.48 # There were 0 free duplicated saturations.
% 0.22/0.48 # There were 6 total successful branch saturations.
% 0.22/0.48 # There were 1 successful branch saturations in interreduction.
% 0.22/0.48 # There were 0 successful branch saturations on the branch.
% 0.22/0.48 # There were 5 successful branch saturations after the branch.
% 0.22/0.48 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # Begin clausification derivation
% 0.22/0.48
% 0.22/0.48 # End clausification derivation
% 0.22/0.48 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.48 cnf(i_0_45, plain, (aSet0(szNzAzT0))).
% 0.22/0.48 cnf(i_0_71, hypothesis, (aSet0(xS))).
% 0.22/0.48 cnf(i_0_8, plain, (isFinite0(slcrc0))).
% 0.22/0.48 cnf(i_0_73, hypothesis, (isFinite0(xS))).
% 0.22/0.48 cnf(i_0_44, plain, (isCountable0(szNzAzT0))).
% 0.22/0.48 cnf(i_0_7, plain, (aSet0(X1)|X1!=slcrc0)).
% 0.22/0.48 cnf(i_0_46, plain, (aElementOf0(sz00,szNzAzT0))).
% 0.22/0.48 cnf(i_0_72, hypothesis, (aElementOf0(xx,xS))).
% 0.22/0.48 cnf(i_0_68, plain, (sbrdtbr0(X1)=sz00|X1!=slcrc0|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_69, plain, (X1=slcrc0|sbrdtbr0(X1)!=sz00|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_11, plain, (X1!=slcrc0|~aSet0(X1)|~isCountable0(X1))).
% 0.22/0.48 cnf(i_0_65, plain, (aElement0(sbrdtbr0(X1))|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_10, plain, (~aSet0(X1)|~isFinite0(X1)|~isCountable0(X1))).
% 0.22/0.48 cnf(i_0_17, plain, (aSubsetOf0(X1,X1)|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_79, negated_conjecture, (aSet0(sdtmndt0(xS,xx)))).
% 0.22/0.48 cnf(i_0_6, plain, (X2!=slcrc0|~aElementOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_47, plain, (szszuzczcdt0(X1)!=sz00|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_52, plain, (szszuzczcdt0(X1)!=X1|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_54, plain, (sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_50, plain, (X1=sz00|szszuzczcdt0(esk5_1(X1))=X1|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_66, plain, (aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1))).
% 0.22/0.48 cnf(i_0_15, plain, (aSet0(X1)|~aSet0(X2)|~aSubsetOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_3, plain, (aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1))).
% 0.22/0.48 cnf(i_0_59, plain, (sdtlseqdt0(X1,X1)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_48, plain, (aElementOf0(szszuzczcdt0(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_58, plain, (sdtlseqdt0(X1,szszuzczcdt0(X1))|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_64, plain, (iLess0(X1,szszuzczcdt0(X1))|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_51, plain, (X1=sz00|aElementOf0(esk5_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_67, plain, (isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0))).
% 0.22/0.48 cnf(i_0_16, plain, (isFinite0(X2)|~aSet0(X1)|~isFinite0(X1)|~aSubsetOf0(X2,X1))).
% 0.22/0.48 cnf(i_0_28, plain, (aSet0(X1)|X1!=sdtpldt0(X2,X3)|~aSet0(X2)|~aElement0(X3))).
% 0.22/0.48 cnf(i_0_37, plain, (aSet0(X1)|X1!=sdtmndt0(X2,X3)|~aSet0(X2)|~aElement0(X3))).
% 0.22/0.48 cnf(i_0_55, plain, (~aElementOf0(X1,szNzAzT0)|~sdtlseqdt0(szszuzczcdt0(X1),sz00))).
% 0.22/0.48 cnf(i_0_42, plain, (isFinite0(sdtpldt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isFinite0(X2))).
% 0.22/0.48 cnf(i_0_43, plain, (isFinite0(sdtmndt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isFinite0(X2))).
% 0.22/0.48 cnf(i_0_40, plain, (isCountable0(sdtpldt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isCountable0(X2))).
% 0.22/0.48 cnf(i_0_41, plain, (isCountable0(sdtmndt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isCountable0(X2))).
% 0.22/0.48 cnf(i_0_49, plain, (X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_76, negated_conjecture, (X1!=xx|~aElementOf0(X1,sdtmndt0(xS,xx)))).
% 0.22/0.48 cnf(i_0_78, negated_conjecture, (aElement0(X1)|~aElementOf0(X1,sdtmndt0(xS,xx)))).
% 0.22/0.48 cnf(i_0_18, plain, (X1=X2|~aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_75, negated_conjecture, (X1=xx|aElementOf0(X1,sdtmndt0(xS,xx))|~aElement0(X1)|~aElementOf0(X1,xS))).
% 0.22/0.48 cnf(i_0_24, plain, (aElementOf0(X1,X3)|X1!=X2|X3!=sdtpldt0(X4,X2)|~aSet0(X4)|~aElement0(X2)|~aElement0(X1))).
% 0.22/0.48 cnf(i_0_34, plain, (X1!=X2|X3!=sdtmndt0(X4,X2)|~aSet0(X4)|~aElement0(X2)|~aElementOf0(X1,X3))).
% 0.22/0.48 cnf(i_0_27, plain, (aElement0(X1)|X2!=sdtpldt0(X3,X4)|~aSet0(X3)|~aElement0(X4)|~aElementOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_36, plain, (aElement0(X1)|X2!=sdtmndt0(X3,X4)|~aSet0(X3)|~aElement0(X4)|~aElementOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_77, negated_conjecture, (aElementOf0(X1,xS)|~aElementOf0(X1,sdtmndt0(xS,xx)))).
% 0.22/0.48 cnf(i_0_14, plain, (aElementOf0(X1,X3)|~aSet0(X3)|~aElementOf0(X1,X2)|~aSubsetOf0(X2,X3))).
% 0.22/0.48 cnf(i_0_13, plain, (aSubsetOf0(X2,X1)|aElementOf0(esk2_2(X1,X2),X2)|~aSet0(X2)|~aSet0(X1))).
% 0.22/0.48 cnf(i_0_39, plain, (sdtmndt0(sdtpldt0(X2,X1),X1)=X2|aElementOf0(X1,X2)|~aSet0(X2)|~aElement0(X1))).
% 0.22/0.48 cnf(i_0_38, plain, (sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1))).
% 0.22/0.48 cnf(i_0_35, plain, (aElementOf0(X1,X2)|X3!=sdtmndt0(X2,X4)|~aSet0(X2)|~aElement0(X4)|~aElementOf0(X1,X3))).
% 0.22/0.48 cnf(i_0_62, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_70, plain, (sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))|aElementOf0(X2,X1)|~aSet0(X1)|~aElement0(X2)|~isFinite0(X1))).
% 0.22/0.48 cnf(i_0_26, plain, (X1=X3|aElementOf0(X1,X2)|X4!=sdtpldt0(X2,X3)|~aSet0(X2)|~aElement0(X3)|~aElementOf0(X1,X4))).
% 0.22/0.48 cnf(i_0_19, plain, (aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X3)|~aSubsetOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_74, negated_conjecture, (szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS))).
% 0.22/0.48 cnf(i_0_25, plain, (aElementOf0(X1,X3)|X3!=sdtpldt0(X2,X4)|~aSet0(X2)|~aElement0(X4)|~aElement0(X1)|~aElementOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_33, plain, (X1=X3|aElementOf0(X1,X4)|X4!=sdtmndt0(X2,X3)|~aSet0(X2)|~aElement0(X3)|~aElement0(X1)|~aElementOf0(X1,X2))).
% 0.22/0.48 cnf(i_0_60, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_57, plain, (sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_12, plain, (aSubsetOf0(X2,X1)|~aSet0(X2)|~aSet0(X1)|~aElementOf0(esk2_2(X1,X2),X1))).
% 0.22/0.48 cnf(i_0_56, plain, (sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)|~sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)))).
% 0.22/0.48 cnf(i_0_61, plain, (sdtlseqdt0(X1,X3)|~sdtlseqdt0(X2,X3)|~sdtlseqdt0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))).
% 0.22/0.48 cnf(i_0_29, plain, (X3=sdtmndt0(X1,X2)|aElementOf0(esk4_3(X1,X2,X3),X3)|esk4_3(X1,X2,X3)!=X2|~aSet0(X3)|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.48 cnf(i_0_21, plain, (X3=sdtpldt0(X1,X2)|aElement0(esk3_3(X1,X2,X3))|aElementOf0(esk3_3(X1,X2,X3),X3)|~aSet0(X3)|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.48 cnf(i_0_31, plain, (X3=sdtmndt0(X1,X2)|aElement0(esk4_3(X1,X2,X3))|aElementOf0(esk4_3(X1,X2,X3),X3)|~aSet0(X3)|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.48 cnf(i_0_30, plain, (X3=sdtmndt0(X1,X2)|aElementOf0(esk4_3(X1,X2,X3),X3)|aElementOf0(esk4_3(X1,X2,X3),X1)|~aSet0(X3)|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.48 cnf(i_0_20, plain, (X3=sdtpldt0(X1,X2)|esk3_3(X1,X2,X3)=X2|aElementOf0(esk3_3(X1,X2,X3),X3)|aElementOf0(esk3_3(X1,X2,X3),X1)|~aSet0(X3)|~aSet0(X1)|~aElement0(X2))).
% 0.22/0.48 cnf(i_0_22, plain, (X3=sdtpldt0(X1,X2)|esk3_3(X1,X2,X3)!=X2|~aSet0(X3)|~aSet0(X1)|~aElement0(X2)|~aElement0(esk3_3(X1,X2,X3))|~aElementOf0(esk3_3(X1,X2,X3),X3))).
% 0.22/0.48 cnf(i_0_23, plain, (X3=sdtpldt0(X1,X2)|~aSet0(X3)|~aSet0(X1)|~aElement0(X2)|~aElement0(esk3_3(X1,X2,X3))|~aElementOf0(esk3_3(X1,X2,X3),X3)|~aElementOf0(esk3_3(X1,X2,X3),X1))).
% 0.22/0.48 cnf(i_0_32, plain, (X3=sdtmndt0(X1,X2)|esk4_3(X1,X2,X3)=X2|~aSet0(X3)|~aSet0(X1)|~aElement0(X2)|~aElement0(esk4_3(X1,X2,X3))|~aElementOf0(esk4_3(X1,X2,X3),X3)|~aElementOf0(esk4_3(X1,X2,X3),X1))).
% 0.22/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.48 # Begin printing tableau
% 0.22/0.48 # Found 12 steps
% 0.22/0.48 cnf(i_0_79, negated_conjecture, (aSet0(sdtmndt0(xS,xx))), inference(start_rule)).
% 0.22/0.48 cnf(i_0_91, plain, (aSet0(sdtmndt0(xS,xx))), inference(extension_rule, [i_0_68])).
% 0.22/0.48 cnf(i_0_604, plain, (sbrdtbr0(sdtmndt0(xS,xx))=sz00), inference(extension_rule, [i_0_24])).
% 0.22/0.48 cnf(i_0_701, plain, (~aSet0(szNzAzT0)), inference(closure_rule, [i_0_45])).
% 0.22/0.48 cnf(i_0_605, plain, (sdtmndt0(xS,xx)!=slcrc0), inference(etableau_closure_rule, [i_0_605, ...])).
% 0.22/0.48 cnf(i_0_702, plain, (~aElement0(sz00)), inference(etableau_closure_rule, [i_0_702, ...])).
% 0.22/0.48 cnf(i_0_703, plain, (~aElement0(sbrdtbr0(sdtmndt0(xS,xx)))), inference(etableau_closure_rule, [i_0_703, ...])).
% 0.22/0.48 cnf(i_0_698, plain, (aElementOf0(sbrdtbr0(sdtmndt0(xS,xx)),slcrc0)), inference(extension_rule, [i_0_6])).
% 0.22/0.48 cnf(i_0_700, plain, (slcrc0!=sdtpldt0(szNzAzT0,sz00)), inference(extension_rule, [i_0_69])).
% 0.22/0.48 cnf(i_0_1227, plain, ($false), inference(etableau_closure_rule, [i_0_1227, ...])).
% 0.22/0.48 cnf(i_0_1232, plain, (sbrdtbr0(sdtpldt0(szNzAzT0,sz00))!=sz00), inference(etableau_closure_rule, [i_0_1232, ...])).
% 0.22/0.48 cnf(i_0_1233, plain, (~aSet0(sdtpldt0(szNzAzT0,sz00))), inference(etableau_closure_rule, [i_0_1233, ...])).
% 0.22/0.48 # End printing tableau
% 0.22/0.48 # SZS output end
% 0.22/0.48 # Branches closed with saturation will be marked with an "s"
% 0.22/0.48 # Child (16241) has found a proof.
% 0.22/0.48
% 0.22/0.48 # Proof search is over...
% 0.22/0.48 # Freeing feature tree
%------------------------------------------------------------------------------