TSTP Solution File: SET016-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET016-1 : TPTP v8.1.0. Released v1.0.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 : n009.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 00:56:17 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 16:40:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 7 Number of unprocessed: 7
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 7 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 1 conjectures.
% 0.14/0.38 # There are 1 start rule candidates:
% 0.14/0.38 # Found 5 unit axioms.
% 0.14/0.38 # 1 start rule tableaux created.
% 0.14/0.38 # 2 extension rule candidate clauses
% 0.14/0.38 # 5 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 9 tableaux to operate on
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 5 steps
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_48, plain, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2))), inference(extension_rule, [i_0_41])).
% 0.14/0.39 cnf(i_0_88, plain, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))!=unordered_pair(singleton_set(m2),unordered_pair(m2,r2))), inference(closure_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_86, plain, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m1),unordered_pair(m1,r1))), inference(extension_rule, [i_0_42])).
% 0.14/0.39 cnf(i_0_98, plain, (singleton_set(unordered_pair(singleton_set(m1),unordered_pair(m1,r1)))=singleton_set(unordered_pair(singleton_set(m1),unordered_pair(m1,r1)))), inference(etableau_closure_rule, [i_0_98, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_12, plain, (member(m1,unordered_pair(m2,m1))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_46, plain, (member(m1,unordered_pair(m2,m1))), inference(extension_rule, [i_0_13])).
% 0.14/0.39 cnf(i_0_79, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_80, plain, (m1=m1), inference(extension_rule, [i_0_41])).
% 0.14/0.39 cnf(i_0_88, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_90, plain, (m1!=m2), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2), inference(start_rule)).
% 0.14/0.39 cnf(i_0_49, plain, (m1!=m2), inference(extension_rule, [i_0_10])).
% 0.14/0.39 cnf(i_0_78, plain, (~member(m1,singleton_set(m2))), inference(extension_rule, [i_0_43])).
% 0.14/0.39 cnf(i_0_92, plain, ($false), inference(closure_rule, [i_0_38])).
% 0.14/0.39 cnf(i_0_94, plain, (~member(m1,singleton_set(m1))), inference(closure_rule, [i_0_9])).
% 0.14/0.39 cnf(i_0_93, plain, (singleton_set(m1)!=singleton_set(m2)), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_11, plain, (member(m1,unordered_pair(m1,m2))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_47, plain, (member(m1,unordered_pair(m1,m2))), inference(extension_rule, [i_0_13])).
% 0.14/0.39 cnf(i_0_80, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_79, plain, (m1=m1), inference(extension_rule, [i_0_41])).
% 0.14/0.39 cnf(i_0_88, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_90, plain, (m1!=m2), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 8 steps
% 0.14/0.39 cnf(i_0_13, plain, (m1=m2|m1=m2|~member(m1,unordered_pair(m2,m2))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_52, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_53, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_54, plain, (~member(m1,unordered_pair(m2,m2))), inference(extension_rule, [i_0_43])).
% 0.14/0.39 cnf(i_0_92, plain, ($false), inference(closure_rule, [i_0_38])).
% 0.14/0.39 cnf(i_0_94, plain, (~member(m1,singleton_set(m1))), inference(closure_rule, [i_0_9])).
% 0.14/0.39 cnf(i_0_93, plain, (singleton_set(m1)!=unordered_pair(m2,m2)), inference(extension_rule, [i_0_10])).
% 0.14/0.39 cnf(i_0_96, plain, (~member(singleton_set(m1),singleton_set(unordered_pair(m2,m2)))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_9, plain, (member(X1,singleton_set(X1)))).
% 0.14/0.39 cnf(i_0_12, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.14/0.39 cnf(i_0_11, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (unordered_pair(singleton_set(m1),unordered_pair(m1,r1))=unordered_pair(singleton_set(m2),unordered_pair(m2,r2)))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (m1!=m2)).
% 0.14/0.39 cnf(i_0_10, plain, (X1=X2|~member(X1,singleton_set(X2)))).
% 0.14/0.39 cnf(i_0_13, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.14/0.39 cnf(i_0_38, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 7 steps
% 0.14/0.39 cnf(i_0_10, plain, (m1=m2|~member(m1,singleton_set(m2))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_50, plain, (m1=m2), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_51, plain, (~member(m1,singleton_set(m2))), inference(extension_rule, [i_0_43])).
% 0.14/0.39 cnf(i_0_92, plain, ($false), inference(closure_rule, [i_0_38])).
% 0.14/0.39 cnf(i_0_94, plain, (~member(m1,singleton_set(m1))), inference(closure_rule, [i_0_9])).
% 0.14/0.39 cnf(i_0_93, plain, (singleton_set(m1)!=singleton_set(m2)), inference(extension_rule, [i_0_10])).
% 0.14/0.39 cnf(i_0_96, plain, (~member(singleton_set(m1),singleton_set(singleton_set(m2)))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Child (18907) has found a proof.
% 0.14/0.39
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------