TSTP Solution File: SET591+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET591+3 : TPTP v8.1.0. Released v2.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 : n016.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 01:01:04 EDT 2022
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jul 10 13:02:26 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.15/0.39 # and selection function SelectUnlessUniqMax.
% 0.15/0.39 #
% 0.15/0.39 # Presaturation interreduction done
% 0.15/0.39 # Number of axioms: 15 Number of unprocessed: 13
% 0.15/0.39 # Tableaux proof search.
% 0.15/0.39 # APR header successfully linked.
% 0.15/0.39 # Hello from C++
% 0.15/0.39 # The folding up rule is enabled...
% 0.15/0.39 # Local unification is enabled...
% 0.15/0.39 # Any saturation attempts will use folding labels...
% 0.15/0.39 # 13 beginning clauses after preprocessing and clausification
% 0.15/0.39 # Creating start rules for all 2 conjectures.
% 0.15/0.39 # There are 2 start rule candidates:
% 0.15/0.39 # Found 4 unit axioms.
% 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.39 # 2 start rule tableaux created.
% 0.15/0.39 # 9 extension rule candidate clauses
% 0.15/0.39 # 4 unit axiom clauses
% 0.15/0.39
% 0.15/0.39 # Requested 8, 32 cores available to the main process.
% 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.15/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.39 # We now have 9 tableaux to operate on
% 0.15/0.40 # Creating equality axioms
% 0.15/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.40 # Creating equality axioms
% 0.15/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.40 # There were 2 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 2 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 2 successful branch saturations after the branch.
% 0.15/0.40 # There were 2 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 2 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 2 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0)))).
% 0.15/0.40 cnf(i_0_11, plain, (subset(X1,X1))).
% 0.15/0.40 cnf(i_0_14, negated_conjecture, (esk3_0!=empty_set)).
% 0.15/0.40 cnf(i_0_7, plain, (~member(X1,empty_set))).
% 0.15/0.40 cnf(i_0_12, plain, (empty(X1)|member(esk2_1(X1),X1))).
% 0.15/0.40 cnf(i_0_13, plain, (~empty(X1)|~member(X2,X1))).
% 0.15/0.40 cnf(i_0_5, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.15/0.40 cnf(i_0_8, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.15/0.40 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.15/0.40 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.15/0.40 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.15/0.40 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.15/0.40 cnf(i_0_4, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 8 steps
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(start_rule)).
% 0.15/0.40 cnf(i_0_19, plain, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_3])).
% 0.15/0.40 cnf(i_0_56, plain, (member(esk2_1(esk3_0),difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_3])).
% 0.15/0.40 cnf(i_0_77, plain, (member(esk2_1(esk3_0),empty_set)), inference(closure_rule, [i_0_7])).
% 0.15/0.40 cnf(i_0_79, plain, (~subset(difference(esk4_0,esk3_0),empty_set)), inference(extension_rule, [i_0_2])).
% 0.15/0.40 cnf(i_0_57, plain, (~member(esk2_1(esk3_0),esk3_0)), inference(extension_rule, [i_0_12])).
% 0.15/0.40 cnf(i_0_94, plain, (member(esk1_2(difference(esk4_0,esk3_0),empty_set),difference(esk4_0,esk3_0))), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.15/0.40 cnf(i_0_96, plain, (empty(esk3_0)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0)))).
% 0.15/0.40 cnf(i_0_11, plain, (subset(X1,X1))).
% 0.15/0.40 cnf(i_0_14, negated_conjecture, (esk3_0!=empty_set)).
% 0.15/0.40 cnf(i_0_7, plain, (~member(X1,empty_set))).
% 0.15/0.40 cnf(i_0_12, plain, (empty(X1)|member(esk2_1(X1),X1))).
% 0.15/0.40 cnf(i_0_13, plain, (~empty(X1)|~member(X2,X1))).
% 0.15/0.40 cnf(i_0_5, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.15/0.40 cnf(i_0_8, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.15/0.40 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.15/0.40 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.15/0.40 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.15/0.40 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.15/0.40 cnf(i_0_4, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 8 steps
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(start_rule)).
% 0.15/0.40 cnf(i_0_19, plain, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_3])).
% 0.15/0.40 cnf(i_0_56, plain, (member(esk2_1(esk3_0),difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_4])).
% 0.15/0.40 cnf(i_0_81, plain, (member(esk2_1(esk3_0),empty_set)), inference(closure_rule, [i_0_7])).
% 0.15/0.40 cnf(i_0_80, plain, (member(esk2_1(esk3_0),difference(difference(esk4_0,esk3_0),empty_set))), inference(extension_rule, [i_0_13])).
% 0.15/0.40 cnf(i_0_57, plain, (~member(esk2_1(esk3_0),esk3_0)), inference(extension_rule, [i_0_12])).
% 0.15/0.40 cnf(i_0_85, plain, (~empty(difference(difference(esk4_0,esk3_0),empty_set))), inference(etableau_closure_rule, [i_0_85, ...])).
% 0.15/0.40 cnf(i_0_87, plain, (empty(esk3_0)), inference(etableau_closure_rule, [i_0_87, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # There were 2 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 2 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 2 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0)))).
% 0.15/0.40 cnf(i_0_11, plain, (subset(X1,X1))).
% 0.15/0.40 cnf(i_0_14, negated_conjecture, (esk3_0!=empty_set)).
% 0.15/0.40 cnf(i_0_7, plain, (~member(X1,empty_set))).
% 0.15/0.40 cnf(i_0_12, plain, (empty(X1)|member(esk2_1(X1),X1))).
% 0.15/0.40 cnf(i_0_13, plain, (~empty(X1)|~member(X2,X1))).
% 0.15/0.40 cnf(i_0_5, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.15/0.40 cnf(i_0_8, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.15/0.40 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.15/0.40 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.15/0.40 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.15/0.40 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.15/0.40 cnf(i_0_4, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 0.15/0.40 cnf(i_0_104, plain, (X23=X23)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 7 steps
% 0.15/0.40 cnf(i_0_104, plain, (esk3_0=esk3_0), inference(start_rule)).
% 0.15/0.40 cnf(i_0_137, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_108])).
% 0.15/0.40 cnf(i_0_168, plain, ($false), inference(closure_rule, [i_0_104])).
% 0.15/0.40 cnf(i_0_169, plain, (~subset(esk3_0,difference(esk4_0,esk3_0))), inference(closure_rule, [i_0_15])).
% 0.15/0.40 cnf(i_0_166, plain, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_8])).
% 0.15/0.40 cnf(i_0_176, plain, (difference(esk4_0,esk3_0)=esk3_0), inference(etableau_closure_rule, [i_0_176, ...])).
% 0.15/0.40 cnf(i_0_178, plain, (~subset(difference(esk4_0,esk3_0),esk3_0)), inference(etableau_closure_rule, [i_0_178, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # There were 2 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 2 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 2 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0)))).
% 0.15/0.40 cnf(i_0_11, plain, (subset(X1,X1))).
% 0.15/0.40 cnf(i_0_14, negated_conjecture, (esk3_0!=empty_set)).
% 0.15/0.40 cnf(i_0_7, plain, (~member(X1,empty_set))).
% 0.15/0.40 cnf(i_0_12, plain, (empty(X1)|member(esk2_1(X1),X1))).
% 0.15/0.40 cnf(i_0_13, plain, (~empty(X1)|~member(X2,X1))).
% 0.15/0.40 cnf(i_0_5, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.15/0.40 cnf(i_0_8, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.15/0.40 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.15/0.40 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.15/0.40 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.15/0.40 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.15/0.40 cnf(i_0_4, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 7 steps
% 0.15/0.40 cnf(i_0_15, negated_conjecture, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(start_rule)).
% 0.15/0.40 cnf(i_0_19, plain, (subset(esk3_0,difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_3])).
% 0.15/0.40 cnf(i_0_56, plain, (member(esk2_1(esk3_0),difference(esk4_0,esk3_0))), inference(extension_rule, [i_0_6])).
% 0.15/0.40 cnf(i_0_71, plain, (member(esk2_1(esk3_0),esk4_0)), inference(extension_rule, [i_0_13])).
% 0.15/0.40 cnf(i_0_57, plain, (~member(esk2_1(esk3_0),esk3_0)), inference(extension_rule, [i_0_12])).
% 0.15/0.40 cnf(i_0_85, plain, (~empty(esk4_0)), inference(etableau_closure_rule, [i_0_85, ...])).
% 0.15/0.40 cnf(i_0_87, plain, (empty(esk3_0)), inference(etableau_closure_rule, [i_0_87, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # Child (4351) has found a proof.
% 0.15/0.40
% 0.15/0.40 # Proof search is over...
% 0.15/0.40 # Freeing feature tree
%------------------------------------------------------------------------------