TSTP Solution File: SEU284+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU284+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:30 EDT 2022
% Result : Theorem 0.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU284+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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 02:56:18 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_S2m
% 0.19/0.36 # and selection function SelectCQArNTNpEqFirst.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 62 Number of unprocessed: 43
% 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.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 # 43 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 2 conjectures.
% 0.19/0.37 # There are 2 start rule candidates:
% 0.19/0.37 # Found 14 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 2 start rule tableaux created.
% 0.19/0.37 # 29 extension rule candidate clauses
% 0.19/0.37 # 14 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 2
% 0.19/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 10 tableaux to operate on
% 0.19/0.40 # Creating equality axioms
% 0.19/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.40 # Creating equality axioms
% 0.19/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.40 # Creating equality axioms
% 0.19/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.40 # There were 2 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 2 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 2 successful branch saturations after the branch.
% 0.19/0.40 # There were 2 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 2 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 2 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_47, plain, (relation(empty_set))).
% 0.19/0.40 cnf(i_0_8, plain, (relation(esk3_0))).
% 0.19/0.40 cnf(i_0_55, plain, (relation(esk10_0))).
% 0.19/0.40 cnf(i_0_58, plain, (relation(esk12_0))).
% 0.19/0.40 cnf(i_0_62, plain, (relation(esk14_0))).
% 0.19/0.40 cnf(i_0_7, plain, (function(esk3_0))).
% 0.19/0.40 cnf(i_0_48, plain, (empty(empty_set))).
% 0.19/0.40 cnf(i_0_56, plain, (empty(esk10_0))).
% 0.19/0.40 cnf(i_0_57, plain, (empty(esk11_0))).
% 0.19/0.40 cnf(i_0_46, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.40 cnf(i_0_61, plain, (relation_empty_yielding(esk14_0))).
% 0.19/0.40 cnf(i_0_45, plain, (element(esk9_1(X1),X1))).
% 0.19/0.40 cnf(i_0_59, plain, (~empty(esk12_0))).
% 0.19/0.40 cnf(i_0_60, plain, (~empty(esk13_0))).
% 0.19/0.40 cnf(i_0_42, plain, (relation(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_41, plain, (function(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.40 cnf(i_0_3, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_52, plain, (empty(X1)|~empty(relation_dom(X1))|~relation(X1))).
% 0.19/0.40 cnf(i_0_53, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_2, negated_conjecture, (in(esk2_1(X1),esk1_0)|relation_dom(X1)!=esk1_0|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_54, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_1, negated_conjecture, (apply(X1,esk2_1(X1))!=singleton(esk2_1(X1))|relation_dom(X1)!=esk1_0|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_63, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_67, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.40 cnf(i_0_64, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.19/0.40 cnf(i_0_12, plain, (relation(esk8_1(X1))|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_11, plain, (function(esk8_1(X1))|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_10, plain, (relation_dom(esk8_1(X1))=X1|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_28, plain, (esk5_1(X1)=singleton(esk4_1(X1))|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_27, plain, (esk5_1(X1)=singleton(esk4_1(X1))|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_20, plain, (esk6_1(X1)=singleton(esk4_1(X1))|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_19, plain, (esk6_1(X1)=singleton(esk4_1(X1))|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_26, plain, (esk5_1(X1)=singleton(esk4_1(X1))|relation_dom(esk8_1(X1))=X1)).
% 0.19/0.40 cnf(i_0_18, plain, (esk6_1(X1)=singleton(esk4_1(X1))|relation_dom(esk8_1(X1))=X1)).
% 0.19/0.40 cnf(i_0_36, plain, (in(esk4_1(X1),X1)|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_35, plain, (in(esk4_1(X1),X1)|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_9, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk6_1(X1)!=esk5_1(X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_34, plain, (relation_dom(esk8_1(X1))=X1|in(esk4_1(X1),X1))).
% 0.19/0.40 cnf(i_0_25, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk5_1(X1)=singleton(esk4_1(X1))|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_17, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk6_1(X1)=singleton(esk4_1(X1))|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_33, plain, (apply(esk8_1(X1),X2)=singleton(X2)|in(esk4_1(X1),X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_368, plain, (X39=X39)).
% 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 6 steps
% 0.19/0.40 cnf(i_0_368, plain, (empty_set=empty_set), inference(start_rule)).
% 0.19/0.40 cnf(i_0_464, plain, (empty_set=empty_set), inference(extension_rule, [i_0_372])).
% 0.19/0.40 cnf(i_0_543, plain, (~relation(empty_set)), inference(closure_rule, [i_0_47])).
% 0.19/0.40 cnf(i_0_541, plain, (relation(empty_set)), inference(extension_rule, [i_0_52])).
% 0.19/0.40 cnf(i_0_554, plain, (empty(empty_set)), inference(etableau_closure_rule, [i_0_554, ...])).
% 0.19/0.40 cnf(i_0_555, plain, (~empty(relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_555, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_47, plain, (relation(empty_set))).
% 0.19/0.40 cnf(i_0_8, plain, (relation(esk3_0))).
% 0.19/0.40 cnf(i_0_55, plain, (relation(esk10_0))).
% 0.19/0.40 cnf(i_0_58, plain, (relation(esk12_0))).
% 0.19/0.40 cnf(i_0_62, plain, (relation(esk14_0))).
% 0.19/0.40 cnf(i_0_7, plain, (function(esk3_0))).
% 0.19/0.40 cnf(i_0_48, plain, (empty(empty_set))).
% 0.19/0.40 cnf(i_0_56, plain, (empty(esk10_0))).
% 0.19/0.40 cnf(i_0_57, plain, (empty(esk11_0))).
% 0.19/0.40 cnf(i_0_46, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.40 cnf(i_0_61, plain, (relation_empty_yielding(esk14_0))).
% 0.19/0.40 cnf(i_0_45, plain, (element(esk9_1(X1),X1))).
% 0.19/0.40 cnf(i_0_59, plain, (~empty(esk12_0))).
% 0.19/0.40 cnf(i_0_60, plain, (~empty(esk13_0))).
% 0.19/0.40 cnf(i_0_42, plain, (relation(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_41, plain, (function(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.40 cnf(i_0_3, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_52, plain, (empty(X1)|~empty(relation_dom(X1))|~relation(X1))).
% 0.19/0.40 cnf(i_0_53, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_2, negated_conjecture, (in(esk2_1(X1),esk1_0)|relation_dom(X1)!=esk1_0|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_54, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_1, negated_conjecture, (apply(X1,esk2_1(X1))!=singleton(esk2_1(X1))|relation_dom(X1)!=esk1_0|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_63, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_67, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.40 cnf(i_0_64, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.19/0.40 cnf(i_0_12, plain, (relation(esk8_1(X1))|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_11, plain, (function(esk8_1(X1))|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_10, plain, (relation_dom(esk8_1(X1))=X1|esk6_1(X1)!=esk5_1(X1))).
% 0.19/0.40 cnf(i_0_28, plain, (esk5_1(X1)=singleton(esk4_1(X1))|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_27, plain, (esk5_1(X1)=singleton(esk4_1(X1))|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_20, plain, (esk6_1(X1)=singleton(esk4_1(X1))|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_19, plain, (esk6_1(X1)=singleton(esk4_1(X1))|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_26, plain, (esk5_1(X1)=singleton(esk4_1(X1))|relation_dom(esk8_1(X1))=X1)).
% 0.19/0.40 cnf(i_0_18, plain, (esk6_1(X1)=singleton(esk4_1(X1))|relation_dom(esk8_1(X1))=X1)).
% 0.19/0.40 cnf(i_0_36, plain, (in(esk4_1(X1),X1)|relation(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_35, plain, (in(esk4_1(X1),X1)|function(esk8_1(X1)))).
% 0.19/0.40 cnf(i_0_9, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk6_1(X1)!=esk5_1(X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_34, plain, (relation_dom(esk8_1(X1))=X1|in(esk4_1(X1),X1))).
% 0.19/0.40 cnf(i_0_25, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk5_1(X1)=singleton(esk4_1(X1))|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_17, plain, (apply(esk8_1(X1),X2)=singleton(X2)|esk6_1(X1)=singleton(esk4_1(X1))|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_33, plain, (apply(esk8_1(X1),X2)=singleton(X2)|in(esk4_1(X1),X1)|~in(X2,X1))).
% 0.19/0.40 cnf(i_0_368, plain, (X39=X39)).
% 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 6 steps
% 0.19/0.40 cnf(i_0_368, plain, (empty_set=empty_set), inference(start_rule)).
% 0.19/0.40 cnf(i_0_464, plain, (empty_set=empty_set), inference(extension_rule, [i_0_372])).
% 0.19/0.40 cnf(i_0_543, plain, (~relation(empty_set)), inference(closure_rule, [i_0_47])).
% 0.19/0.40 cnf(i_0_541, plain, (relation(empty_set)), inference(extension_rule, [i_0_52])).
% 0.19/0.40 cnf(i_0_554, plain, (empty(empty_set)), inference(etableau_closure_rule, [i_0_554, ...])).
% 0.19/0.40 cnf(i_0_555, plain, (~empty(relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_555, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Child (12945) has found a proof.
% 0.19/0.41
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------