TSTP Solution File: SEU239+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU239+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 : n023.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:07 EDT 2022
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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 : n023.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 00:10:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 37 Number of unprocessed: 37
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # 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 # 37 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 4 conjectures.
% 0.12/0.37 # There are 4 start rule candidates:
% 0.12/0.37 # Found 18 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 4 start rule tableaux created.
% 0.12/0.37 # 19 extension rule candidate clauses
% 0.12/0.37 # 18 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 4
% 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 12 tableaux to operate on
% 0.12/0.38 # Creating equality axioms
% 0.12/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.38 # Creating equality axioms
% 0.12/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_33, negated_conjecture, (relation(esk3_0))).
% 0.12/0.38 cnf(i_0_35, plain, (relation(esk5_0))).
% 0.12/0.38 cnf(i_0_39, plain, (relation(esk7_0))).
% 0.12/0.38 cnf(i_0_25, plain, (empty(empty_set))).
% 0.12/0.38 cnf(i_0_43, plain, (relation(esk9_0))).
% 0.12/0.38 cnf(i_0_36, plain, (empty(esk6_0))).
% 0.12/0.38 cnf(i_0_38, plain, (empty(esk7_0))).
% 0.12/0.38 cnf(i_0_34, plain, (function(esk5_0))).
% 0.12/0.38 cnf(i_0_37, plain, (function(esk7_0))).
% 0.12/0.38 cnf(i_0_42, plain, (function(esk9_0))).
% 0.12/0.38 cnf(i_0_41, plain, (one_to_one(esk9_0))).
% 0.12/0.38 cnf(i_0_44, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.38 cnf(i_0_29, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.38 cnf(i_0_24, plain, (element(esk2_1(X1),X1))).
% 0.12/0.38 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.38 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.12/0.38 cnf(i_0_40, plain, (~empty(esk8_0))).
% 0.12/0.38 cnf(i_0_26, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 0.12/0.38 cnf(i_0_32, negated_conjecture, (in(esk4_0,relation_field(esk3_0))|~reflexive(esk3_0))).
% 0.12/0.38 cnf(i_0_48, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_47, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_45, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_28, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.38 cnf(i_0_27, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.38 cnf(i_0_13, plain, (reflexive(X1)|~is_reflexive_in(X1,relation_field(X1))|~relation(X1))).
% 0.12/0.38 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_49, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_46, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_14, plain, (is_reflexive_in(X1,relation_field(X1))|~reflexive(X1)|~relation(X1))).
% 0.12/0.38 cnf(i_0_31, negated_conjecture, (~reflexive(esk3_0)|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk4_0)),esk3_0))).
% 0.12/0.38 cnf(i_0_30, negated_conjecture, (reflexive(esk3_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),esk3_0)|~in(X1,relation_field(esk3_0)))).
% 0.12/0.38 cnf(i_0_12, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 0.12/0.38 cnf(i_0_9, plain, (is_reflexive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1))).
% 0.12/0.38 cnf(i_0_10, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),X2)|~is_reflexive_in(X2,X3)|~relation(X2)|~in(X1,X3))).
% 0.12/0.38 cnf(i_0_8, plain, (is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1))).
% 0.12/0.38 cnf(i_0_250, plain, (X48=X48)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 8 steps
% 0.12/0.38 cnf(i_0_250, plain, (esk2_1(set_union2(empty_set,empty_set))=esk2_1(set_union2(empty_set,empty_set))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_334, plain, (esk2_1(set_union2(empty_set,empty_set))=esk2_1(set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_254])).
% 0.12/0.38 cnf(i_0_392, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_44])).
% 0.12/0.38 cnf(i_0_390, plain, (in(esk2_1(set_union2(empty_set,empty_set)),empty_set)), inference(extension_rule, [i_0_48])).
% 0.12/0.38 cnf(i_0_394, plain, (~empty(empty_set)), inference(closure_rule, [i_0_25])).
% 0.12/0.38 cnf(i_0_393, plain, (~in(esk2_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_46])).
% 0.12/0.38 cnf(i_0_419, plain, (~element(esk2_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(closure_rule, [i_0_24])).
% 0.12/0.38 cnf(i_0_417, plain, (empty(set_union2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_417, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_33, negated_conjecture, (relation(esk3_0))).
% 0.12/0.38 cnf(i_0_35, plain, (relation(esk5_0))).
% 0.12/0.38 cnf(i_0_39, plain, (relation(esk7_0))).
% 0.12/0.38 cnf(i_0_25, plain, (empty(empty_set))).
% 0.12/0.38 cnf(i_0_43, plain, (relation(esk9_0))).
% 0.12/0.38 cnf(i_0_36, plain, (empty(esk6_0))).
% 0.12/0.38 cnf(i_0_38, plain, (empty(esk7_0))).
% 0.12/0.38 cnf(i_0_34, plain, (function(esk5_0))).
% 0.12/0.38 cnf(i_0_37, plain, (function(esk7_0))).
% 0.12/0.38 cnf(i_0_42, plain, (function(esk9_0))).
% 0.12/0.38 cnf(i_0_41, plain, (one_to_one(esk9_0))).
% 0.12/0.38 cnf(i_0_44, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.38 cnf(i_0_29, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.38 cnf(i_0_24, plain, (element(esk2_1(X1),X1))).
% 0.12/0.38 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.38 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.12/0.38 cnf(i_0_40, plain, (~empty(esk8_0))).
% 0.12/0.38 cnf(i_0_26, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 0.12/0.38 cnf(i_0_32, negated_conjecture, (in(esk4_0,relation_field(esk3_0))|~reflexive(esk3_0))).
% 0.12/0.38 cnf(i_0_48, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_47, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_45, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_28, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.38 cnf(i_0_27, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.38 cnf(i_0_13, plain, (reflexive(X1)|~is_reflexive_in(X1,relation_field(X1))|~relation(X1))).
% 0.12/0.38 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_49, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_46, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_14, plain, (is_reflexive_in(X1,relation_field(X1))|~reflexive(X1)|~relation(X1))).
% 0.12/0.38 cnf(i_0_31, negated_conjecture, (~reflexive(esk3_0)|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk4_0)),esk3_0))).
% 0.12/0.38 cnf(i_0_30, negated_conjecture, (reflexive(esk3_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),esk3_0)|~in(X1,relation_field(esk3_0)))).
% 0.12/0.38 cnf(i_0_12, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 0.12/0.38 cnf(i_0_9, plain, (is_reflexive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1))).
% 0.12/0.38 cnf(i_0_10, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),X2)|~is_reflexive_in(X2,X3)|~relation(X2)|~in(X1,X3))).
% 0.12/0.38 cnf(i_0_8, plain, (is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1))).
% 0.12/0.38 cnf(i_0_202, plain, (X48=X48)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 8 steps
% 0.12/0.38 cnf(i_0_202, plain, (esk2_1(set_union2(empty_set,empty_set))=esk2_1(set_union2(empty_set,empty_set))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_286, plain, (esk2_1(set_union2(empty_set,empty_set))=esk2_1(set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_206])).
% 0.12/0.38 cnf(i_0_344, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_44])).
% 0.12/0.38 cnf(i_0_342, plain, (in(esk2_1(set_union2(empty_set,empty_set)),empty_set)), inference(extension_rule, [i_0_48])).
% 0.12/0.38 cnf(i_0_346, plain, (~empty(empty_set)), inference(closure_rule, [i_0_25])).
% 0.12/0.38 cnf(i_0_345, plain, (~in(esk2_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_46])).
% 0.12/0.38 cnf(i_0_371, plain, (~element(esk2_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(closure_rule, [i_0_24])).
% 0.12/0.38 cnf(i_0_369, plain, (empty(set_union2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_369, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (9801) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------