%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU275+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 09:25:26 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU275+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n020.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jun 19 03:12:48 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_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: 20 Number of unprocessed: 20 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 20 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 9 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 11 extension rule candidate clauses % 0.12/0.37 # 9 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_20, negated_conjecture, (ordinal(esk2_0))). % 0.12/0.37 cnf(i_0_11, plain, (ordinal(esk1_0))). % 0.12/0.37 cnf(i_0_13, plain, (epsilon_transitive(esk1_0))). % 0.12/0.37 cnf(i_0_12, plain, (epsilon_connected(esk1_0))). % 0.12/0.37 cnf(i_0_10, plain, (relation(inclusion_relation(X1)))). % 0.12/0.37 cnf(i_0_14, plain, (reflexive(inclusion_relation(X1)))). % 0.12/0.37 cnf(i_0_15, plain, (transitive(inclusion_relation(X1)))). % 0.12/0.37 cnf(i_0_17, plain, (antisymmetric(inclusion_relation(X1)))). % 0.12/0.37 cnf(i_0_19, negated_conjecture, (~well_ordering(inclusion_relation(esk2_0)))). % 0.12/0.37 cnf(i_0_2, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.12/0.37 cnf(i_0_1, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.12/0.37 cnf(i_0_3, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.12/0.37 cnf(i_0_16, plain, (connected(inclusion_relation(X1))|~ordinal(X1))). % 0.12/0.37 cnf(i_0_18, plain, (well_founded_relation(inclusion_relation(X1))|~ordinal(X1))). % 0.12/0.37 cnf(i_0_9, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.37 cnf(i_0_8, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.37 cnf(i_0_7, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.37 cnf(i_0_6, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.37 cnf(i_0_5, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.37 cnf(i_0_4, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 9 steps % 0.12/0.37 cnf(i_0_20, negated_conjecture, (ordinal(esk2_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_22, plain, (ordinal(esk2_0)), inference(extension_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_65, plain, (well_founded_relation(inclusion_relation(esk2_0))), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_115, plain, (well_ordering(inclusion_relation(esk2_0))), inference(closure_rule, [i_0_19])). % 0.12/0.37 cnf(i_0_118, plain, (~antisymmetric(inclusion_relation(esk2_0))), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_119, plain, (~transitive(inclusion_relation(esk2_0))), inference(closure_rule, [i_0_15])). % 0.12/0.37 cnf(i_0_120, plain, (~reflexive(inclusion_relation(esk2_0))), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_121, plain, (~relation(inclusion_relation(esk2_0))), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_117, plain, (~connected(inclusion_relation(esk2_0))), inference(etableau_closure_rule, [i_0_117, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 5 tableaux to operate on % 0.12/0.37 # Found closed tableau during pool population. % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------