%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM531+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 : n009.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.13s 0.36s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0. % 0.03/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.33 % Computer : n009.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Thu Jul 7 04:11:52 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 10 Number of unprocessed: 8 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 8 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 4 conjectures. % 0.13/0.36 # There are 4 start rule candidates: % 0.13/0.36 # Found 5 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 4 start rule tableaux created. % 0.13/0.36 # 3 extension rule candidate clauses % 0.13/0.36 # 5 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.13/0.36 # There were 0 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 0 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 0 successful branch saturations after the branch. % 0.13/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_11, negated_conjecture, (esk2_0=slcrc0)). % 0.13/0.36 cnf(i_0_14, negated_conjecture, (aSet0(slcrc0))). % 0.13/0.36 cnf(i_0_13, negated_conjecture, (isCountable0(slcrc0))). % 0.13/0.36 cnf(i_0_8, plain, (isFinite0(slcrc0))). % 0.13/0.36 cnf(i_0_12, negated_conjecture, (~aElementOf0(X1,slcrc0))). % 0.13/0.36 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))). % 0.13/0.36 cnf(i_0_10, plain, (~isCountable0(X1)|~isFinite0(X1)|~aSet0(X1))). % 0.13/0.36 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 4 steps % 0.13/0.36 cnf(i_0_13, negated_conjecture, (isCountable0(slcrc0)), inference(start_rule)). % 0.13/0.36 cnf(i_0_18, plain, (isCountable0(slcrc0)), inference(extension_rule, [i_0_10])). % 0.13/0.36 cnf(i_0_34, plain, (~isFinite0(slcrc0)), inference(closure_rule, [i_0_8])). % 0.13/0.36 cnf(i_0_35, plain, (~aSet0(slcrc0)), inference(closure_rule, [i_0_14])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 4 tableaux to operate on % 0.13/0.36 # Found closed tableau during pool population. % 0.13/0.36 # Proof search is over... % 0.13/0.36 # Freeing feature tree %------------------------------------------------------------------------------