%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU244+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 : n011.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:09 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.11 % Problem : SEU244+1 : TPTP v8.1.0. Released v3.3.0. % 0.12/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 : n011.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 Jun 20 10:09:24 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 28 Number of unprocessed: 28 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 28 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 3 conjectures. % 0.19/0.36 # There are 3 start rule candidates: % 0.19/0.36 # Found 3 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 3 start rule tableaux created. % 0.19/0.36 # 25 extension rule candidate clauses % 0.19/0.36 # 3 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.19/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 12 tableaux to operate on % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 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 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/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_32, negated_conjecture, (relation(esk1_0))). % 0.19/0.37 cnf(i_0_27, plain, (set_union2(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_1, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (~well_orders(esk1_0,relation_field(esk1_0))|~well_ordering(esk1_0))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (well_orders(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0))). % 0.19/0.37 cnf(i_0_11, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_10, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_12, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_13, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_9, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_2, plain, (antisymmetric(X1)|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_4, plain, (connected(X1)|~is_connected_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_6, plain, (transitive(X1)|~is_transitive_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_21, plain, (reflexive(X1)|~is_reflexive_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_28, plain, (well_founded_relation(X1)|~is_well_founded_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_17, plain, (is_antisymmetric_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_3, plain, (is_antisymmetric_in(X1,relation_field(X1))|~antisymmetric(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_16, plain, (is_connected_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_18, plain, (is_transitive_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_19, plain, (is_reflexive_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_15, plain, (is_well_founded_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_5, plain, (is_connected_in(X1,relation_field(X1))|~connected(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_7, plain, (is_transitive_in(X1,relation_field(X1))|~transitive(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_22, plain, (is_reflexive_in(X1,relation_field(X1))|~reflexive(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_29, plain, (is_well_founded_in(X1,relation_field(X1))|~well_founded_relation(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_20, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_8, plain, (well_ordering(X1)|~well_founded_relation(X1)|~reflexive(X1)|~transitive(X1)|~connected(X1)|~antisymmetric(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_14, plain, (well_orders(X1,X2)|~is_well_founded_in(X1,X2)|~is_reflexive_in(X1,X2)|~is_transitive_in(X1,X2)|~is_connected_in(X1,X2)|~is_antisymmetric_in(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_278, plain, (X16=X16)). % 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 6 steps % 0.19/0.37 cnf(i_0_278, plain, (X5=X5), inference(start_rule)). % 0.19/0.37 cnf(i_0_382, plain, (X5=X5), inference(extension_rule, [i_0_282])). % 0.19/0.37 cnf(i_0_472, plain, (set_union2(X5,X5)!=X5), inference(closure_rule, [i_0_27])). % 0.19/0.37 cnf(i_0_470, plain, (set_union2(X5,set_union2(X5,X5))=set_union2(X5,X5)), inference(extension_rule, [i_0_281])). % 0.19/0.37 cnf(i_0_559, plain, (set_union2(X5,X5)!=X5), inference(closure_rule, [i_0_27])). % 0.19/0.37 cnf(i_0_557, plain, (set_union2(X5,set_union2(X5,X5))=X5), inference(etableau_closure_rule, [i_0_557, ...])). % 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 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 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 # Child (19736) has found a proof. % 0.19/0.37 % 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/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/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_32, negated_conjecture, (relation(esk1_0))). % 0.19/0.37 cnf(i_0_27, plain, (set_union2(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_1, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (~well_orders(esk1_0,relation_field(esk1_0))|~well_ordering(esk1_0))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (well_orders(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0))). % 0.19/0.37 cnf(i_0_11, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_10, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_12, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_13, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_9, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_2, plain, (antisymmetric(X1)|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_4, plain, (connected(X1)|~is_connected_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_6, plain, (transitive(X1)|~is_transitive_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_21, plain, (reflexive(X1)|~is_reflexive_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_28, plain, (well_founded_relation(X1)|~is_well_founded_in(X1,relation_field(X1))|~relation(X1))). % 0.19/0.37 cnf(i_0_17, plain, (is_antisymmetric_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_3, plain, (is_antisymmetric_in(X1,relation_field(X1))|~antisymmetric(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_16, plain, (is_connected_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_18, plain, (is_transitive_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_19, plain, (is_reflexive_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_15, plain, (is_well_founded_in(X1,X2)|~well_orders(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_5, plain, (is_connected_in(X1,relation_field(X1))|~connected(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_7, plain, (is_transitive_in(X1,relation_field(X1))|~transitive(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_22, plain, (is_reflexive_in(X1,relation_field(X1))|~reflexive(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_29, plain, (is_well_founded_in(X1,relation_field(X1))|~well_founded_relation(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_20, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_8, plain, (well_ordering(X1)|~well_founded_relation(X1)|~reflexive(X1)|~transitive(X1)|~connected(X1)|~antisymmetric(X1)|~relation(X1))). % 0.19/0.37 cnf(i_0_14, plain, (well_orders(X1,X2)|~is_well_founded_in(X1,X2)|~is_reflexive_in(X1,X2)|~is_transitive_in(X1,X2)|~is_connected_in(X1,X2)|~is_antisymmetric_in(X1,X2)|~relation(X1))). % 0.19/0.37 cnf(i_0_358, plain, (X16=X16)). % 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 6 steps % 0.19/0.37 cnf(i_0_358, plain, (X5=X5), inference(start_rule)). % 0.19/0.37 cnf(i_0_462, plain, (X5=X5), inference(extension_rule, [i_0_362])). % 0.19/0.37 cnf(i_0_552, plain, (set_union2(X5,X5)!=X5), inference(closure_rule, [i_0_27])). % 0.19/0.37 cnf(i_0_550, plain, (set_union2(X5,set_union2(X5,X5))=set_union2(X5,X5)), inference(extension_rule, [i_0_361])). % 0.19/0.37 cnf(i_0_639, plain, (set_union2(X5,X5)!=X5), inference(closure_rule, [i_0_27])). % 0.19/0.37 cnf(i_0_637, plain, (set_union2(X5,set_union2(X5,X5))=X5), inference(etableau_closure_rule, [i_0_637, ...])). % 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 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------