%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM534+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 : 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 : Mon Jul 18 09:42:03 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NUM534+1 : TPTP v8.1.0. Released v4.0.0. % 0.12/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 : Thu Jul 7 13:06:59 EDT 2022 % 0.20/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 36 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 7 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 29 extension rule candidate clauses % 0.20/0.37 # 7 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.39 # There were 5 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 5 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 5 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_38, hypothesis, (aSet0(xS))). % 0.20/0.39 cnf(i_0_39, hypothesis, (aElementOf0(xx,xS))). % 0.20/0.39 cnf(i_0_8, plain, (isFinite0(slcrc0))). % 0.20/0.39 cnf(i_0_7, plain, (aSet0(slcrc0))). % 0.20/0.39 cnf(i_0_40, negated_conjecture, (sdtpldt0(sdtmndt0(xS,xx),xx)!=xS)). % 0.20/0.39 cnf(i_0_6, plain, (~aElementOf0(X1,slcrc0))). % 0.20/0.39 cnf(i_0_11, plain, (~isCountable0(slcrc0))). % 0.20/0.39 cnf(i_0_10, plain, (~isCountable0(X1)|~isFinite0(X1)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_15, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_17, plain, (aSubsetOf0(X1,X1)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_28, plain, (aSet0(sdtpldt0(X1,X2))|~aElement0(X2)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_16, plain, (isFinite0(X1)|~aSubsetOf0(X1,X2)|~isFinite0(X2)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_37, plain, (aSet0(sdtmndt0(X1,X2))|~aElement0(X2)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_18, plain, (X1=X2|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_12, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_13, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_34, plain, (~aElementOf0(X1,sdtmndt0(X2,X1))|~aElement0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_27, plain, (aElement0(X1)|~aElementOf0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_24, plain, (aElementOf0(X1,sdtpldt0(X2,X1))|~aElement0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_14, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_36, plain, (aElement0(X1)|~aElementOf0(X1,sdtmndt0(X2,X3))|~aElement0(X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_19, plain, (aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_35, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtmndt0(X2,X3))|~aElement0(X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_25, plain, (aElementOf0(X1,sdtpldt0(X2,X3))|~aElementOf0(X1,X2)|~aElement0(X3)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_26, plain, (X1=X2|aElementOf0(X1,X3)|~aElementOf0(X1,sdtpldt0(X3,X2))|~aElement0(X2)|~aSet0(X3))). % 0.20/0.39 cnf(i_0_29, plain, (X1=sdtmndt0(X2,X3)|aElementOf0(esk4_3(X2,X3,X1),X1)|esk4_3(X2,X3,X1)!=X3|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_22, plain, (X1=sdtpldt0(X2,X3)|esk3_3(X2,X3,X1)!=X3|~aElementOf0(esk3_3(X2,X3,X1),X1)|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_23, plain, (X1=sdtpldt0(X2,X3)|~aElementOf0(esk3_3(X2,X3,X1),X1)|~aElementOf0(esk3_3(X2,X3,X1),X2)|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_21, plain, (X1=sdtpldt0(X2,X3)|aElement0(esk3_3(X2,X3,X1))|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_31, plain, (X1=sdtmndt0(X2,X3)|aElement0(esk4_3(X2,X3,X1))|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_33, plain, (X1=X2|aElementOf0(X1,sdtmndt0(X3,X2))|~aElementOf0(X1,X3)|~aElement0(X2)|~aSet0(X3))). % 0.20/0.39 cnf(i_0_30, plain, (X1=sdtmndt0(X2,X3)|aElementOf0(esk4_3(X2,X3,X1),X2)|aElementOf0(esk4_3(X2,X3,X1),X1)|~aElement0(X3)|~aSet0(X1)|~aSet0(X2))). % 0.20/0.39 cnf(i_0_32, plain, (esk4_3(X1,X2,X3)=X2|X3=sdtmndt0(X1,X2)|~aElementOf0(esk4_3(X1,X2,X3),X3)|~aElementOf0(esk4_3(X1,X2,X3),X1)|~aElement0(X2)|~aSet0(X3)|~aSet0(X1))). % 0.20/0.39 cnf(i_0_20, plain, (esk3_3(X1,X2,X3)=X2|X3=sdtpldt0(X1,X2)|aElementOf0(esk3_3(X1,X2,X3),X1)|aElementOf0(esk3_3(X1,X2,X3),X3)|~aElement0(X2)|~aSet0(X3)|~aSet0(X1))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 11 steps % 0.20/0.39 cnf(i_0_40, negated_conjecture, (sdtpldt0(sdtmndt0(xS,xx),xx)!=xS), inference(start_rule)). % 0.20/0.39 cnf(i_0_56, plain, (sdtpldt0(sdtmndt0(xS,xx),xx)!=xS), inference(extension_rule, [i_0_20])). % 0.20/0.39 cnf(i_0_179, plain, (~aSet0(xS)), inference(closure_rule, [i_0_38])). % 0.20/0.39 cnf(i_0_176, plain, (aElementOf0(esk3_3(sdtmndt0(xS,xx),xx,xS),sdtmndt0(xS,xx))), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_351, plain, (aElementOf0(esk3_3(sdtmndt0(xS,xx),xx,xS),slcrc0)), inference(closure_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_354, plain, (~aSet0(slcrc0)), inference(closure_rule, [i_0_7])). % 0.20/0.39 cnf(i_0_174, plain, (esk3_3(sdtmndt0(xS,xx),xx,xS)=xx), inference(etableau_closure_rule, [i_0_174, ...])). % 0.20/0.39 cnf(i_0_177, plain, (aElementOf0(esk3_3(sdtmndt0(xS,xx),xx,xS),xS)), inference(etableau_closure_rule, [i_0_177, ...])). % 0.20/0.39 cnf(i_0_178, plain, (~aElement0(xx)), inference(etableau_closure_rule, [i_0_178, ...])). % 0.20/0.39 cnf(i_0_180, plain, (~aSet0(sdtmndt0(xS,xx))), inference(etableau_closure_rule, [i_0_180, ...])). % 0.20/0.39 cnf(i_0_352, plain, (~aSubsetOf0(sdtmndt0(xS,xx),slcrc0)), inference(etableau_closure_rule, [i_0_352, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 7 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------