%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM538+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 : n018.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.66s 0.81s % Output : CNFRefutation 0.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM538+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Wed Jul 6 20:12:38 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 68 Number of unprocessed: 68 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.39/0.60 # The folding up rule is enabled... % 0.39/0.60 # Local unification is enabled... % 0.39/0.60 # Any saturation attempts will use folding labels... % 0.39/0.60 # 68 beginning clauses after preprocessing and clausification % 0.39/0.60 # Creating start rules for all 1 conjectures. % 0.39/0.60 # There are 1 start rule candidates: % 0.39/0.60 # Found 8 unit axioms. % 0.39/0.60 # 1 start rule tableaux created. % 0.39/0.60 # 60 extension rule candidate clauses % 0.39/0.60 # 8 unit axiom clauses % 0.39/0.60 % 0.39/0.60 # Requested 8, 32 cores available to the main process. % 0.39/0.60 # There are not enough tableaux to fork, creating more from the initial 1 % 0.66/0.81 # There were 12 total branch saturation attempts. % 0.66/0.81 # There were 0 of these attempts blocked. % 0.66/0.81 # There were 0 deferred branch saturation attempts. % 0.66/0.81 # There were 7 free duplicated saturations. % 0.66/0.81 # There were 12 total successful branch saturations. % 0.66/0.81 # There were 0 successful branch saturations in interreduction. % 0.66/0.81 # There were 0 successful branch saturations on the branch. % 0.66/0.81 # There were 5 successful branch saturations after the branch. % 0.66/0.81 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.66/0.81 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.66/0.81 # Begin clausification derivation % 0.66/0.81 % 0.66/0.81 # End clausification derivation % 0.66/0.81 # Begin listing active clauses obtained from FOF to CNF conversion % 0.66/0.81 cnf(i_0_45, plain, (aSet0(szNzAzT0))). % 0.66/0.81 cnf(i_0_71, hypothesis, (aSet0(xS))). % 0.66/0.81 cnf(i_0_8, plain, (isFinite0(slcrc0))). % 0.66/0.81 cnf(i_0_73, hypothesis, (isFinite0(xS))). % 0.66/0.81 cnf(i_0_44, plain, (isCountable0(szNzAzT0))). % 0.66/0.81 cnf(i_0_7, plain, (aSet0(X1)|X1!=slcrc0)). % 0.66/0.81 cnf(i_0_46, plain, (aElementOf0(sz00,szNzAzT0))). % 0.66/0.81 cnf(i_0_72, hypothesis, (aElementOf0(xx,xS))). % 0.66/0.81 cnf(i_0_68, plain, (sbrdtbr0(X1)=sz00|X1!=slcrc0|~aSet0(X1))). % 0.66/0.81 cnf(i_0_69, plain, (X1=slcrc0|sbrdtbr0(X1)!=sz00|~aSet0(X1))). % 0.66/0.81 cnf(i_0_11, plain, (X1!=slcrc0|~aSet0(X1)|~isCountable0(X1))). % 0.66/0.81 cnf(i_0_65, plain, (aElement0(sbrdtbr0(X1))|~aSet0(X1))). % 0.66/0.81 cnf(i_0_10, plain, (~aSet0(X1)|~isFinite0(X1)|~isCountable0(X1))). % 0.66/0.81 cnf(i_0_17, plain, (aSubsetOf0(X1,X1)|~aSet0(X1))). % 0.66/0.81 cnf(i_0_6, plain, (X2!=slcrc0|~aElementOf0(X1,X2))). % 0.66/0.81 cnf(i_0_47, plain, (szszuzczcdt0(X1)!=sz00|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_52, plain, (szszuzczcdt0(X1)!=X1|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))). % 0.66/0.81 cnf(i_0_54, plain, (sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_50, plain, (X1=sz00|szszuzczcdt0(esk5_1(X1))=X1|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_66, plain, (aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1))). % 0.66/0.81 cnf(i_0_15, plain, (aSet0(X1)|~aSet0(X2)|~aSubsetOf0(X1,X2))). % 0.66/0.81 cnf(i_0_3, plain, (aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1))). % 0.66/0.81 cnf(i_0_59, plain, (sdtlseqdt0(X1,X1)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_48, plain, (aElementOf0(szszuzczcdt0(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_58, plain, (sdtlseqdt0(X1,szszuzczcdt0(X1))|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_64, plain, (iLess0(X1,szszuzczcdt0(X1))|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_51, plain, (X1=sz00|aElementOf0(esk5_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_67, plain, (isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0))). % 0.66/0.81 cnf(i_0_16, plain, (isFinite0(X2)|~aSet0(X1)|~isFinite0(X1)|~aSubsetOf0(X2,X1))). % 0.66/0.81 cnf(i_0_28, plain, (aSet0(X1)|X1!=sdtpldt0(X2,X3)|~aSet0(X2)|~aElement0(X3))). % 0.66/0.81 cnf(i_0_37, plain, (aSet0(X1)|X1!=sdtmndt0(X2,X3)|~aSet0(X2)|~aElement0(X3))). % 0.66/0.81 cnf(i_0_55, plain, (~aElementOf0(X1,szNzAzT0)|~sdtlseqdt0(szszuzczcdt0(X1),sz00))). % 0.66/0.81 cnf(i_0_42, plain, (isFinite0(sdtpldt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isFinite0(X2))). % 0.66/0.81 cnf(i_0_43, plain, (isFinite0(sdtmndt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isFinite0(X2))). % 0.66/0.81 cnf(i_0_40, plain, (isCountable0(sdtpldt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isCountable0(X2))). % 0.66/0.81 cnf(i_0_41, plain, (isCountable0(sdtmndt0(X2,X1))|~aSet0(X2)|~aElement0(X1)|~isCountable0(X2))). % 0.66/0.81 cnf(i_0_49, plain, (X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_18, plain, (X1=X2|~aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2))). % 0.66/0.81 cnf(i_0_24, plain, (aElementOf0(X1,X3)|X1!=X2|X3!=sdtpldt0(X4,X2)|~aSet0(X4)|~aElement0(X2)|~aElement0(X1))). % 0.66/0.81 cnf(i_0_34, plain, (X1!=X2|X3!=sdtmndt0(X4,X2)|~aSet0(X4)|~aElement0(X2)|~aElementOf0(X1,X3))). % 0.66/0.81 cnf(i_0_27, plain, (aElement0(X1)|X2!=sdtpldt0(X3,X4)|~aSet0(X3)|~aElement0(X4)|~aElementOf0(X1,X2))). % 0.66/0.81 cnf(i_0_36, plain, (aElement0(X1)|X2!=sdtmndt0(X3,X4)|~aSet0(X3)|~aElement0(X4)|~aElementOf0(X1,X2))). % 0.66/0.81 cnf(i_0_14, plain, (aElementOf0(X1,X3)|~aSet0(X3)|~aElementOf0(X1,X2)|~aSubsetOf0(X2,X3))). % 0.66/0.81 cnf(i_0_13, plain, (aSubsetOf0(X2,X1)|aElementOf0(esk2_2(X1,X2),X2)|~aSet0(X2)|~aSet0(X1))). % 0.66/0.81 cnf(i_0_39, plain, (sdtmndt0(sdtpldt0(X2,X1),X1)=X2|aElementOf0(X1,X2)|~aSet0(X2)|~aElement0(X1))). % 0.66/0.81 cnf(i_0_38, plain, (sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1))). % 0.66/0.81 cnf(i_0_35, plain, (aElementOf0(X1,X2)|X3!=sdtmndt0(X2,X4)|~aSet0(X2)|~aElement0(X4)|~aElementOf0(X1,X3))). % 0.66/0.81 cnf(i_0_62, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_70, plain, (sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))|aElementOf0(X2,X1)|~aSet0(X1)|~aElement0(X2)|~isFinite0(X1))). % 0.66/0.81 cnf(i_0_26, plain, (X1=X3|aElementOf0(X1,X2)|X4!=sdtpldt0(X2,X3)|~aSet0(X2)|~aElement0(X3)|~aElementOf0(X1,X4))). % 0.66/0.81 cnf(i_0_19, plain, (aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X3)|~aSubsetOf0(X1,X2))). % 0.66/0.81 cnf(i_0_74, negated_conjecture, (szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS))). % 0.66/0.81 cnf(i_0_25, plain, (aElementOf0(X1,X3)|X3!=sdtpldt0(X2,X4)|~aSet0(X2)|~aElement0(X4)|~aElement0(X1)|~aElementOf0(X1,X2))). % 0.66/0.81 cnf(i_0_33, plain, (X1=X3|aElementOf0(X1,X4)|X4!=sdtmndt0(X2,X3)|~aSet0(X2)|~aElement0(X3)|~aElement0(X1)|~aElementOf0(X1,X2))). % 0.66/0.81 cnf(i_0_60, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_57, plain, (sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 cnf(i_0_12, plain, (aSubsetOf0(X2,X1)|~aSet0(X2)|~aSet0(X1)|~aElementOf0(esk2_2(X1,X2),X1))). % 0.66/0.81 cnf(i_0_56, plain, (sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)|~sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)))). % 0.66/0.81 cnf(i_0_61, plain, (sdtlseqdt0(X1,X3)|~sdtlseqdt0(X2,X3)|~sdtlseqdt0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0))). % 0.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 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.66/0.81 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.66/0.81 # Begin printing tableau % 0.66/0.81 # Found 9 steps % 0.66/0.81 cnf(i_0_74, negated_conjecture, (szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS)), inference(start_rule)). % 0.66/0.81 cnf(i_0_75, plain, (szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS)), inference(extension_rule, [i_0_60])). % 0.66/0.81 cnf(i_0_248, plain, (~aElementOf0(sbrdtbr0(xS),szNzAzT0)), inference(extension_rule, [i_0_39])). % 0.66/0.81 cnf(i_0_16254, plain, (~aSet0(szNzAzT0)), inference(closure_rule, [i_0_45])). % 0.66/0.81 cnf(i_0_246, plain, (~sdtlseqdt0(sbrdtbr0(xS),szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))))), inference(etableau_closure_rule, [i_0_246, ...])). % 0.66/0.81 cnf(i_0_247, plain, (~sdtlseqdt0(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS))), inference(etableau_closure_rule, [i_0_247, ...])). % 0.66/0.81 cnf(i_0_249, plain, (~aElementOf0(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),szNzAzT0)), inference(etableau_closure_rule, [i_0_249, ...])). % 0.66/0.81 cnf(i_0_16252, plain, (sdtmndt0(sdtpldt0(szNzAzT0,sbrdtbr0(xS)),sbrdtbr0(xS))=szNzAzT0), inference(etableau_closure_rule, [i_0_16252, ...])). % 0.66/0.81 cnf(i_0_16255, plain, (~aElement0(sbrdtbr0(xS))), inference(etableau_closure_rule, [i_0_16255, ...])). % 0.66/0.81 # End printing tableau % 0.66/0.81 # SZS output end % 0.66/0.81 # Branches closed with saturation will be marked with an "s" % 0.66/0.81 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.66/0.81 # We now have 8 tableaux to operate on % 0.66/0.81 # Found closed tableau during pool population. % 0.66/0.81 # Proof search is over... % 0.66/0.81 # Freeing feature tree %------------------------------------------------------------------------------