TSTP Solution File: NUM387+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM387+1 : TPTP v8.1.0. Released v3.2.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 : n012.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:40:38 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 : NUM387+1 : TPTP v8.1.0. Released v3.2.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.33 % Computer : n012.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 : Tue Jul 5 11:52:45 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_C18_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: 47 Number of unprocessed: 44
% 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 # 44 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 32 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 12 extension rule candidate clauses
% 0.12/0.37 # 32 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 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 59 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 59 tableaux to operate on
% 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/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0)).
% 0.12/0.37 cnf(i_0_12, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_24, plain, (empty(esk3_0))).
% 0.12/0.37 cnf(i_0_25, plain, (empty(esk4_0))).
% 0.12/0.37 cnf(i_0_27, plain, (empty(esk5_0))).
% 0.12/0.37 cnf(i_0_21, plain, (function(esk2_0))).
% 0.12/0.37 cnf(i_0_26, plain, (function(esk5_0))).
% 0.12/0.37 cnf(i_0_33, plain, (function(esk8_0))).
% 0.12/0.37 cnf(i_0_37, plain, (function(esk10_0))).
% 0.12/0.37 cnf(i_0_40, plain, (function(esk11_0))).
% 0.12/0.37 cnf(i_0_11, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_22, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_23, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_28, plain, (relation(esk5_0))).
% 0.12/0.37 cnf(i_0_29, plain, (relation(esk6_0))).
% 0.12/0.37 cnf(i_0_34, plain, (relation(esk8_0))).
% 0.12/0.37 cnf(i_0_36, plain, (relation(esk9_0))).
% 0.12/0.37 cnf(i_0_39, plain, (relation(esk10_0))).
% 0.12/0.37 cnf(i_0_42, plain, (relation(esk11_0))).
% 0.12/0.37 cnf(i_0_32, plain, (one_to_one(esk8_0))).
% 0.12/0.37 cnf(i_0_10, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.37 cnf(i_0_35, plain, (relation_empty_yielding(esk9_0))).
% 0.12/0.37 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))).
% 0.12/0.37 cnf(i_0_41, plain, (relation_non_empty(esk11_0))).
% 0.12/0.37 cnf(i_0_45, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.37 cnf(i_0_20, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.37 cnf(i_0_9, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37 cnf(i_0_43, plain, (in(X1,set_union2(X1,singleton(X1))))).
% 0.12/0.37 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.12/0.37 cnf(i_0_30, plain, (~empty(esk6_0))).
% 0.12/0.37 cnf(i_0_31, plain, (~empty(esk7_0))).
% 0.12/0.37 cnf(i_0_13, plain, (~empty(set_union2(X1,singleton(X1))))).
% 0.12/0.37 cnf(i_0_49, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37 cnf(i_0_17, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.37 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_16, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.37 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.12/0.37 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.37 cnf(i_0_79, plain, (X43=X43)).
% 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 5 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_93, plain, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(extension_rule, [i_0_89])).
% 0.12/0.37 cnf(i_0_206, plain, (singleton(set_union2(esk12_0,singleton(esk12_0)))=singleton(esk12_0)), inference(extension_rule, [i_0_82])).
% 0.12/0.37 cnf(i_0_251, plain, (singleton(esk12_0)!=set_union2(singleton(esk12_0),empty_set)), inference(closure_rule, [i_0_45])).
% 0.12/0.37 cnf(i_0_249, plain, (singleton(set_union2(esk12_0,singleton(esk12_0)))=set_union2(singleton(esk12_0),empty_set)), inference(etableau_closure_rule, [i_0_249, ...])).
% 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 # 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/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0)).
% 0.12/0.37 cnf(i_0_12, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_24, plain, (empty(esk3_0))).
% 0.12/0.37 cnf(i_0_25, plain, (empty(esk4_0))).
% 0.12/0.37 cnf(i_0_27, plain, (empty(esk5_0))).
% 0.12/0.37 cnf(i_0_21, plain, (function(esk2_0))).
% 0.12/0.37 cnf(i_0_26, plain, (function(esk5_0))).
% 0.12/0.37 cnf(i_0_33, plain, (function(esk8_0))).
% 0.12/0.37 cnf(i_0_37, plain, (function(esk10_0))).
% 0.12/0.37 cnf(i_0_40, plain, (function(esk11_0))).
% 0.12/0.37 cnf(i_0_11, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_22, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_23, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_28, plain, (relation(esk5_0))).
% 0.12/0.37 cnf(i_0_29, plain, (relation(esk6_0))).
% 0.12/0.37 cnf(i_0_34, plain, (relation(esk8_0))).
% 0.12/0.37 cnf(i_0_36, plain, (relation(esk9_0))).
% 0.12/0.37 cnf(i_0_39, plain, (relation(esk10_0))).
% 0.12/0.37 cnf(i_0_42, plain, (relation(esk11_0))).
% 0.12/0.37 cnf(i_0_32, plain, (one_to_one(esk8_0))).
% 0.12/0.37 cnf(i_0_10, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.37 cnf(i_0_35, plain, (relation_empty_yielding(esk9_0))).
% 0.12/0.37 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))).
% 0.12/0.37 cnf(i_0_41, plain, (relation_non_empty(esk11_0))).
% 0.12/0.37 cnf(i_0_45, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.37 cnf(i_0_20, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.37 cnf(i_0_9, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37 cnf(i_0_43, plain, (in(X1,set_union2(X1,singleton(X1))))).
% 0.12/0.37 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.12/0.37 cnf(i_0_30, plain, (~empty(esk6_0))).
% 0.12/0.37 cnf(i_0_31, plain, (~empty(esk7_0))).
% 0.12/0.37 cnf(i_0_13, plain, (~empty(set_union2(X1,singleton(X1))))).
% 0.12/0.37 cnf(i_0_49, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37 cnf(i_0_17, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.37 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_16, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.37 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.12/0.37 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.37 cnf(i_0_79, plain, (X43=X43)).
% 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 6 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_93, plain, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(extension_rule, [i_0_88])).
% 0.12/0.37 cnf(i_0_204, plain, (set_union2(esk12_0,singleton(esk12_0))!=esk12_0), inference(closure_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_203, plain, (set_union2(set_union2(esk12_0,singleton(esk12_0)),set_union2(esk12_0,singleton(esk12_0)))=set_union2(esk12_0,esk12_0)), inference(extension_rule, [i_0_82])).
% 0.12/0.37 cnf(i_0_251, plain, (set_union2(esk12_0,esk12_0)!=set_union2(set_union2(esk12_0,esk12_0),empty_set)), inference(closure_rule, [i_0_45])).
% 0.12/0.38 cnf(i_0_249, plain, (set_union2(set_union2(esk12_0,singleton(esk12_0)),set_union2(esk12_0,singleton(esk12_0)))=set_union2(set_union2(esk12_0,esk12_0),empty_set)), inference(etableau_closure_rule, [i_0_249, ...])).
% 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 # 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_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0)).
% 0.12/0.38 cnf(i_0_12, plain, (empty(empty_set))).
% 0.12/0.38 cnf(i_0_24, plain, (empty(esk3_0))).
% 0.12/0.38 cnf(i_0_25, plain, (empty(esk4_0))).
% 0.12/0.38 cnf(i_0_27, plain, (empty(esk5_0))).
% 0.12/0.38 cnf(i_0_21, plain, (function(esk2_0))).
% 0.12/0.38 cnf(i_0_26, plain, (function(esk5_0))).
% 0.12/0.38 cnf(i_0_33, plain, (function(esk8_0))).
% 0.12/0.38 cnf(i_0_37, plain, (function(esk10_0))).
% 0.12/0.38 cnf(i_0_40, plain, (function(esk11_0))).
% 0.12/0.38 cnf(i_0_11, plain, (relation(empty_set))).
% 0.12/0.38 cnf(i_0_22, plain, (relation(esk2_0))).
% 0.12/0.38 cnf(i_0_23, plain, (relation(esk3_0))).
% 0.12/0.38 cnf(i_0_28, plain, (relation(esk5_0))).
% 0.12/0.38 cnf(i_0_29, plain, (relation(esk6_0))).
% 0.12/0.38 cnf(i_0_34, plain, (relation(esk8_0))).
% 0.12/0.38 cnf(i_0_36, plain, (relation(esk9_0))).
% 0.12/0.38 cnf(i_0_39, plain, (relation(esk10_0))).
% 0.12/0.38 cnf(i_0_42, plain, (relation(esk11_0))).
% 0.12/0.38 cnf(i_0_32, plain, (one_to_one(esk8_0))).
% 0.12/0.38 cnf(i_0_10, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.38 cnf(i_0_35, plain, (relation_empty_yielding(esk9_0))).
% 0.12/0.38 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))).
% 0.12/0.38 cnf(i_0_41, plain, (relation_non_empty(esk11_0))).
% 0.12/0.38 cnf(i_0_45, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.38 cnf(i_0_20, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.38 cnf(i_0_9, plain, (element(esk1_1(X1),X1))).
% 0.12/0.38 cnf(i_0_43, plain, (in(X1,set_union2(X1,singleton(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_30, plain, (~empty(esk6_0))).
% 0.12/0.38 cnf(i_0_31, plain, (~empty(esk7_0))).
% 0.12/0.38 cnf(i_0_13, plain, (~empty(set_union2(X1,singleton(X1))))).
% 0.12/0.38 cnf(i_0_49, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_17, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.38 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_16, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.38 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_15, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.12/0.38 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_79, plain, (X43=X43)).
% 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 6 steps
% 0.12/0.38 cnf(i_0_44, negated_conjecture, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(start_rule)).
% 0.12/0.38 cnf(i_0_93, plain, (set_union2(esk12_0,singleton(esk12_0))=esk12_0), inference(extension_rule, [i_0_88])).
% 0.12/0.38 cnf(i_0_205, plain, (set_union2(esk12_0,singleton(esk12_0))!=esk12_0), inference(closure_rule, [i_0_44])).
% 0.12/0.38 cnf(i_0_203, plain, (set_union2(set_union2(esk12_0,singleton(esk12_0)),set_union2(esk12_0,singleton(esk12_0)))=set_union2(esk12_0,esk12_0)), inference(extension_rule, [i_0_82])).
% 0.12/0.38 cnf(i_0_251, plain, (set_union2(esk12_0,esk12_0)!=set_union2(set_union2(esk12_0,esk12_0),empty_set)), inference(closure_rule, [i_0_45])).
% 0.12/0.38 cnf(i_0_249, plain, (set_union2(set_union2(esk12_0,singleton(esk12_0)),set_union2(esk12_0,singleton(esk12_0)))=set_union2(set_union2(esk12_0,esk12_0),empty_set)), inference(etableau_closure_rule, [i_0_249, ...])).
% 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 (25470) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------