TSTP Solution File: SET931+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET931+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 : n019.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:03:57 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.07/0.11 % Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n019.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 : Sun Jul 10 21:49:08 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: 17 Number of unprocessed: 16
% 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.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 16 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 5 conjectures.
% 0.12/0.36 # There are 5 start rule candidates:
% 0.12/0.36 # Found 8 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 5 start rule tableaux created.
% 0.12/0.36 # 8 extension rule candidate clauses
% 0.12/0.36 # 8 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 5
% 0.12/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 10 tableaux to operate on
% 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 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 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 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # There were 2 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 2 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 2 successful branch saturations after the branch.
% 0.12/0.37 # There were 2 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 2 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 2 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_2, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.12/0.37 cnf(i_0_10, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_6, plain, (subset(empty_set,unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_4, plain, (subset(singleton(X1),unordered_pair(X2,X1)))).
% 0.12/0.37 cnf(i_0_5, plain, (subset(singleton(X1),unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=empty_set)).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk4_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|unordered_pair(esk4_0,esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_12, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.12/0.37 cnf(i_0_11, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|esk3_0=empty_set)).
% 0.12/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|X1=singleton(X2)|X1=singleton(X3)|X1=empty_set|~subset(X1,unordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_255, plain, (X17=X17)).
% 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 7 steps
% 0.12/0.37 cnf(i_0_255, plain, (esk4_0=esk4_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_294, plain, (esk4_0=esk4_0), inference(extension_rule, [i_0_259])).
% 0.12/0.37 cnf(i_0_326, plain, ($false), inference(closure_rule, [i_0_255])).
% 0.12/0.37 cnf(i_0_324, plain, (unordered_pair(esk4_0,esk5_0)=unordered_pair(esk4_0,esk5_0)), inference(extension_rule, [i_0_258])).
% 0.12/0.37 cnf(i_0_353, plain, (unordered_pair(esk4_0,esk5_0)=esk3_0), inference(extension_rule, [i_0_14])).
% 0.12/0.37 cnf(i_0_355, plain, (unordered_pair(esk4_0,esk5_0)!=esk3_0), inference(etableau_closure_rule, [i_0_355, ...])).
% 0.12/0.37 cnf(i_0_370, plain, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set), inference(etableau_closure_rule, [i_0_370, ...])).
% 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 2 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 2 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 2 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_2, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.12/0.37 cnf(i_0_10, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_6, plain, (subset(empty_set,unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_4, plain, (subset(singleton(X1),unordered_pair(X2,X1)))).
% 0.12/0.37 cnf(i_0_5, plain, (subset(singleton(X1),unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=empty_set)).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk4_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|unordered_pair(esk4_0,esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_12, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.12/0.37 cnf(i_0_11, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|esk3_0=empty_set)).
% 0.12/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|X1=singleton(X2)|X1=singleton(X3)|X1=empty_set|~subset(X1,unordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_255, plain, (X17=X17)).
% 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 7 steps
% 0.12/0.37 cnf(i_0_255, plain, (esk4_0=esk4_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_294, plain, (esk4_0=esk4_0), inference(extension_rule, [i_0_259])).
% 0.12/0.37 cnf(i_0_326, plain, ($false), inference(closure_rule, [i_0_255])).
% 0.12/0.37 cnf(i_0_324, plain, (unordered_pair(esk4_0,esk5_0)=unordered_pair(esk4_0,esk5_0)), inference(extension_rule, [i_0_258])).
% 0.12/0.37 cnf(i_0_353, plain, (unordered_pair(esk4_0,esk5_0)=esk3_0), inference(extension_rule, [i_0_14])).
% 0.12/0.37 cnf(i_0_355, plain, (unordered_pair(esk4_0,esk5_0)!=esk3_0), inference(etableau_closure_rule, [i_0_355, ...])).
% 0.12/0.37 cnf(i_0_370, plain, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set), inference(etableau_closure_rule, [i_0_370, ...])).
% 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 # 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_2, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.12/0.37 cnf(i_0_10, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_6, plain, (subset(empty_set,unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_4, plain, (subset(singleton(X1),unordered_pair(X2,X1)))).
% 0.12/0.37 cnf(i_0_5, plain, (subset(singleton(X1),unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=empty_set)).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk4_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|unordered_pair(esk4_0,esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_12, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.12/0.37 cnf(i_0_11, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|esk3_0=empty_set)).
% 0.12/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|X1=singleton(X2)|X1=singleton(X3)|X1=empty_set|~subset(X1,unordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_255, plain, (X17=X17)).
% 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 7 steps
% 0.12/0.37 cnf(i_0_255, plain, (esk4_0=esk4_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_294, plain, (esk4_0=esk4_0), inference(extension_rule, [i_0_259])).
% 0.12/0.37 cnf(i_0_326, plain, ($false), inference(closure_rule, [i_0_255])).
% 0.12/0.37 cnf(i_0_324, plain, (unordered_pair(esk4_0,esk5_0)=unordered_pair(esk4_0,esk5_0)), inference(extension_rule, [i_0_258])).
% 0.12/0.37 cnf(i_0_353, plain, (unordered_pair(esk4_0,esk5_0)=esk3_0), inference(extension_rule, [i_0_14])).
% 0.12/0.37 cnf(i_0_355, plain, (unordered_pair(esk4_0,esk5_0)!=esk3_0), inference(etableau_closure_rule, [i_0_355, ...])).
% 0.12/0.37 cnf(i_0_370, plain, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set), inference(etableau_closure_rule, [i_0_370, ...])).
% 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 2 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 2 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 2 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_2, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.12/0.37 cnf(i_0_10, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_6, plain, (subset(empty_set,unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_4, plain, (subset(singleton(X1),unordered_pair(X2,X1)))).
% 0.12/0.37 cnf(i_0_5, plain, (subset(singleton(X1),unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=empty_set)).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk4_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|singleton(esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|unordered_pair(esk4_0,esk5_0)!=esk3_0)).
% 0.12/0.37 cnf(i_0_12, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.12/0.37 cnf(i_0_11, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|esk3_0=empty_set)).
% 0.12/0.37 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|X1=singleton(X2)|X1=singleton(X3)|X1=empty_set|~subset(X1,unordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_255, plain, (X17=X17)).
% 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 7 steps
% 0.12/0.37 cnf(i_0_255, plain, (esk4_0=esk4_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_294, plain, (esk4_0=esk4_0), inference(extension_rule, [i_0_259])).
% 0.12/0.37 cnf(i_0_326, plain, ($false), inference(closure_rule, [i_0_255])).
% 0.12/0.37 cnf(i_0_324, plain, (unordered_pair(esk4_0,esk5_0)=unordered_pair(esk4_0,esk5_0)), inference(extension_rule, [i_0_258])).
% 0.12/0.37 cnf(i_0_353, plain, (unordered_pair(esk4_0,esk5_0)=esk3_0), inference(extension_rule, [i_0_14])).
% 0.12/0.37 cnf(i_0_355, plain, (unordered_pair(esk4_0,esk5_0)!=esk3_0), inference(etableau_closure_rule, [i_0_355, ...])).
% 0.12/0.37 cnf(i_0_370, plain, (set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set), inference(etableau_closure_rule, [i_0_370, ...])).
% 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 # Child (14503) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------