%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG096+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 : n020.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:21 EDT 2022 % Result : Theorem 0.50s 0.73s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : RNG096+2 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon May 30 13:55:54 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 75 Number of unprocessed: 75 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.18/0.38 # The folding up rule is enabled... % 0.18/0.38 # Local unification is enabled... % 0.18/0.38 # Any saturation attempts will use folding labels... % 0.18/0.38 # 75 beginning clauses after preprocessing and clausification % 0.18/0.38 # Creating start rules for all 1 conjectures. % 0.18/0.38 # There are 1 start rule candidates: % 0.18/0.38 # Found 14 unit axioms. % 0.18/0.38 # 1 start rule tableaux created. % 0.18/0.38 # 61 extension rule candidate clauses % 0.18/0.38 # 14 unit axiom clauses % 0.18/0.38 % 0.18/0.38 # Requested 8, 32 cores available to the main process. % 0.18/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.50/0.73 # There were 3 total branch saturation attempts. % 0.50/0.73 # There were 0 of these attempts blocked. % 0.50/0.73 # There were 0 deferred branch saturation attempts. % 0.50/0.73 # There were 0 free duplicated saturations. % 0.50/0.73 # There were 3 total successful branch saturations. % 0.50/0.73 # There were 0 successful branch saturations in interreduction. % 0.50/0.73 # There were 0 successful branch saturations on the branch. % 0.50/0.73 # There were 3 successful branch saturations after the branch. % 0.50/0.73 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.50/0.73 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.50/0.73 # Begin clausification derivation % 0.50/0.73 % 0.50/0.73 # End clausification derivation % 0.50/0.73 # Begin listing active clauses obtained from FOF to CNF conversion % 0.50/0.73 cnf(i_0_72, hypothesis, (aElement0(xx))). % 0.50/0.73 cnf(i_0_66, hypothesis, (aSet0(xI))). % 0.50/0.73 cnf(i_0_63, hypothesis, (aIdeal0(xI))). % 0.50/0.73 cnf(i_0_2, plain, (aElement0(sz00))). % 0.50/0.73 cnf(i_0_3, plain, (aElement0(sz10))). % 0.50/0.73 cnf(i_0_71, hypothesis, (aElement0(xy))). % 0.50/0.73 cnf(i_0_62, hypothesis, (aSet0(xJ))). % 0.50/0.73 cnf(i_0_59, hypothesis, (aIdeal0(xJ))). % 0.50/0.73 cnf(i_0_75, hypothesis, (aElementOf0(xa,xI))). % 0.50/0.73 cnf(i_0_74, hypothesis, (aElementOf0(xb,xJ))). % 0.50/0.73 cnf(i_0_73, hypothesis, (sdtpldt0(xa,xb)=sz10)). % 0.50/0.73 cnf(i_0_76, hypothesis, (xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)))). % 0.50/0.73 cnf(i_0_24, plain, (sz10!=sz00)). % 0.50/0.73 cnf(i_0_77, negated_conjecture, (~aElementOf0(sdtpldt0(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),smndt0(xx)),xI))). % 0.50/0.73 cnf(i_0_54, plain, (aSet0(X1)|~aIdeal0(X1))). % 0.50/0.73 cnf(i_0_4, plain, (aElement0(smndt0(X1))|~aElement0(X1))). % 0.50/0.73 cnf(i_0_70, hypothesis, (aElementOf0(esk12_1(X1),xI)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_21, plain, (sdtasdt0(sz00,X1)=sz00|~aElement0(X1))). % 0.50/0.73 cnf(i_0_26, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))). % 0.50/0.73 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aElement0(X1))). % 0.50/0.73 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aElement0(X1))). % 0.50/0.73 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aElement0(X1))). % 0.50/0.73 cnf(i_0_22, plain, (sdtasdt0(X1,sz00)=sz00|~aElement0(X1))). % 0.50/0.73 cnf(i_0_65, hypothesis, (aElementOf0(sdtpldt0(X1,X2),xI)|~aElementOf0(X1,xI)|~aElementOf0(X2,xI))). % 0.50/0.73 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aElement0(X1))). % 0.50/0.73 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1))). % 0.50/0.73 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aElement0(X1))). % 0.50/0.73 cnf(i_0_69, hypothesis, (aElementOf0(esk13_1(X1),xJ)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_5, plain, (aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_6, plain, (aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_55, plain, (aIdeal0(sdtpldt1(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1))). % 0.50/0.73 cnf(i_0_56, plain, (aIdeal0(sdtasasdt0(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1))). % 0.50/0.73 cnf(i_0_67, hypothesis, (aElementOf0(X1,sdtpldt1(xI,xJ))|~aElement0(X1))). % 0.50/0.73 cnf(i_0_64, hypothesis, (aElementOf0(sdtasdt0(X1,X2),xI)|~aElementOf0(X2,xI)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_19, plain, (smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aElement0(X1))). % 0.50/0.73 cnf(i_0_20, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_61, hypothesis, (aElementOf0(sdtpldt0(X1,X2),xJ)|~aElementOf0(X1,xJ)|~aElementOf0(X2,xJ))). % 0.50/0.73 cnf(i_0_51, plain, (aIdeal0(X1)|aElementOf0(esk9_1(X1),X1)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_68, hypothesis, (sdtpldt0(esk12_1(X1),esk13_1(X1))=X1|~aElement0(X1))). % 0.50/0.73 cnf(i_0_39, plain, (aSet0(sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_46, plain, (aSet0(sdtasasdt0(X1,X2))|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_60, hypothesis, (aElementOf0(sdtasdt0(X1,X2),xJ)|~aElementOf0(X2,xJ)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_53, plain, (aElementOf0(sdtpldt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X1,X3)|~aElementOf0(X2,X3))). % 0.50/0.73 cnf(i_0_52, plain, (aElementOf0(sdtasdt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X2,X3)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_13, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_50, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|aElement0(esk11_1(X1))|~aSet0(X1))). % 0.50/0.73 cnf(i_0_27, plain, (X1=X2|~aElementOf0(esk1_2(X1,X2),X2)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_57, plain, (sdteqdtlpzmzozddtrp0(X1,X2,X3)|~aIdeal0(X3)|~aElementOf0(sdtpldt0(X1,smndt0(X2)),X3)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_44, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X3,X2))|~aSet0(X3)|~aSet0(X2))). % 0.50/0.73 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_48, plain, (aIdeal0(X1)|aElement0(esk11_1(X1))|~aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_58, plain, (aElementOf0(sdtpldt0(X1,smndt0(X2)),X3)|~sdteqdtlpzmzozddtrp0(X1,X2,X3)|~aIdeal0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_45, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X2,X3))|~aSet0(X3)|~aSet0(X2))). % 0.50/0.73 cnf(i_0_30, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|aElementOf0(esk1_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_49, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|~aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1)|~aSet0(X1))). % 0.50/0.73 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.50/0.73 cnf(i_0_29, plain, (X1=X2|aElementOf0(esk1_2(X1,X2),X1)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_43, plain, (aElementOf0(X1,sdtasasdt0(X2,X3))|~aElementOf0(X1,X3)|~aElementOf0(X1,X2)|~aSet0(X3)|~aSet0(X2))). % 0.50/0.73 cnf(i_0_28, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|~aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X2)|~aSet0(X1))). % 0.50/0.73 cnf(i_0_14, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.50/0.73 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.50/0.73 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.50/0.73 cnf(i_0_35, plain, (aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4))|~aElementOf0(X2,X4)|~aElementOf0(X1,X3)|~aSet0(X4)|~aSet0(X3))). % 0.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 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.50/0.73 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.50/0.73 # Begin printing tableau % 0.50/0.73 # Found 8 steps % 0.50/0.73 cnf(i_0_77, negated_conjecture, (~aElementOf0(sdtpldt0(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),smndt0(xx)),xI)), inference(start_rule)). % 0.50/0.73 cnf(i_0_88, plain, (~aElementOf0(sdtpldt0(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),smndt0(xx)),xI)), inference(extension_rule, [i_0_45])). % 0.50/0.73 cnf(i_0_209, plain, (~aSet0(xI)), inference(closure_rule, [i_0_66])). % 0.50/0.73 cnf(i_0_210, plain, (~aSet0(xI)), inference(closure_rule, [i_0_66])). % 0.50/0.73 cnf(i_0_208, plain, (~aElementOf0(sdtpldt0(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),smndt0(xx)),sdtasasdt0(xI,xI))), inference(extension_rule, [i_0_53])). % 0.50/0.73 cnf(i_0_385, plain, (~aIdeal0(sdtasasdt0(xI,xI))), inference(etableau_closure_rule, [i_0_385, ...])). % 0.50/0.73 cnf(i_0_386, plain, (~aElementOf0(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),sdtasasdt0(xI,xI))), inference(etableau_closure_rule, [i_0_386, ...])). % 0.50/0.73 cnf(i_0_387, plain, (~aElementOf0(smndt0(xx),sdtasasdt0(xI,xI))), inference(etableau_closure_rule, [i_0_387, ...])). % 0.50/0.73 # End printing tableau % 0.50/0.73 # SZS output end % 0.50/0.73 # Branches closed with saturation will be marked with an "s" % 0.50/0.73 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.50/0.73 # We now have 5 tableaux to operate on % 0.50/0.73 # Found closed tableau during pool population. % 0.50/0.73 # Proof search is over... % 0.50/0.73 # Freeing feature tree %------------------------------------------------------------------------------