%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM532+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 : 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:02 EDT 2022 % Result : Theorem 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM532+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 : n007.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 : Tue Jul 5 07:57:57 EDT 2022 % 0.19/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.19/0.37 # and selection function SelectUnlessUniqMax. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 14 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 6 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 8 extension rule candidate clauses % 0.19/0.37 # 6 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_17, hypothesis, (aSet0(xA))). % 0.19/0.37 cnf(i_0_8, plain, (isFinite0(slcrc0))). % 0.19/0.37 cnf(i_0_7, plain, (aSet0(slcrc0))). % 0.19/0.37 cnf(i_0_18, negated_conjecture, (~aSubsetOf0(xA,xA))). % 0.19/0.37 cnf(i_0_6, plain, (~aElementOf0(X1,slcrc0))). % 0.19/0.37 cnf(i_0_11, plain, (~isCountable0(slcrc0))). % 0.19/0.37 cnf(i_0_10, plain, (~isCountable0(X1)|~isFinite0(X1)|~aSet0(X1))). % 0.19/0.37 cnf(i_0_15, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))). % 0.19/0.37 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))). % 0.19/0.37 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))). % 0.19/0.37 cnf(i_0_16, plain, (isFinite0(X1)|~aSubsetOf0(X1,X2)|~isFinite0(X2)|~aSet0(X2))). % 0.19/0.37 cnf(i_0_12, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))). % 0.19/0.37 cnf(i_0_14, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))). % 0.19/0.37 cnf(i_0_13, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 8 steps % 0.19/0.37 cnf(i_0_18, negated_conjecture, (~aSubsetOf0(xA,xA)), inference(start_rule)). % 0.19/0.37 cnf(i_0_22, plain, (~aSubsetOf0(xA,xA)), inference(extension_rule, [i_0_13])). % 0.19/0.37 cnf(i_0_49, plain, (~aSet0(xA)), inference(closure_rule, [i_0_17])). % 0.19/0.37 cnf(i_0_50, plain, (~aSet0(xA)), inference(closure_rule, [i_0_17])). % 0.19/0.37 cnf(i_0_48, plain, (aElementOf0(esk2_2(xA,xA),xA)), inference(extension_rule, [i_0_14])). % 0.19/0.37 cnf(i_0_71, plain, (aElementOf0(esk2_2(xA,xA),slcrc0)), inference(closure_rule, [i_0_6])). % 0.19/0.37 cnf(i_0_74, plain, (~aSet0(slcrc0)), inference(closure_rule, [i_0_7])). % 0.19/0.37 cnf(i_0_72, plain, (~aSubsetOf0(xA,slcrc0)), inference(etableau_closure_rule, [i_0_72, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 2 tableaux to operate on % 0.19/0.37 # Found closed tableau during pool population. % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------