TSTP Solution File: SET961+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.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 : n025.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:04:07 EDT 2022
% Result : Theorem 0.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.00/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.30 % Computer : n025.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jul 10 23:01:47 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.33 # No SInE strategy applied
% 0.14/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.33 #
% 0.14/0.33 # Presaturation interreduction done
% 0.14/0.33 # Number of axioms: 17 Number of unprocessed: 17
% 0.14/0.33 # Tableaux proof search.
% 0.14/0.33 # APR header successfully linked.
% 0.14/0.33 # Hello from C++
% 0.14/0.33 # The folding up rule is enabled...
% 0.14/0.33 # Local unification is enabled...
% 0.14/0.33 # Any saturation attempts will use folding labels...
% 0.14/0.33 # 17 beginning clauses after preprocessing and clausification
% 0.14/0.33 # Creating start rules for all 4 conjectures.
% 0.14/0.33 # There are 4 start rule candidates:
% 0.14/0.33 # Found 10 unit axioms.
% 0.14/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.33 # 4 start rule tableaux created.
% 0.14/0.33 # 7 extension rule candidate clauses
% 0.14/0.33 # 10 unit axiom clauses
% 0.14/0.33
% 0.14/0.33 # Requested 8, 32 cores available to the main process.
% 0.14/0.33 # There are not enough tableaux to fork, creating more from the initial 4
% 0.14/0.33 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.33 # We now have 9 tableaux to operate on
% 0.14/0.33 # There were 1 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 1 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 1 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_16, negated_conjecture, (cartesian_product2(esk4_0,esk5_0)=cartesian_product2(esk5_0,esk4_0))).
% 0.14/0.33 cnf(i_0_6, plain, (empty(empty_set))).
% 0.14/0.33 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.14/0.33 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.33 cnf(i_0_15, negated_conjecture, (esk4_0!=empty_set)).
% 0.14/0.33 cnf(i_0_14, negated_conjecture, (esk5_0!=empty_set)).
% 0.14/0.33 cnf(i_0_13, negated_conjecture, (esk4_0!=esk5_0)).
% 0.14/0.33 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.14/0.33 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.14/0.33 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.14/0.33 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.14/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.33 cnf(i_0_18, plain, (X1=X2|~in(esk6_2(X1,X2),X2)|~in(esk6_2(X1,X2),X1))).
% 0.14/0.33 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.14/0.33 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.14/0.33 cnf(i_0_17, plain, (X1=X2|in(esk6_2(X1,X2),X1)|in(esk6_2(X1,X2),X2))).
% 0.14/0.33 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 5 steps
% 0.14/0.33 cnf(i_0_15, negated_conjecture, (esk4_0!=empty_set), inference(start_rule)).
% 0.14/0.33 cnf(i_0_22, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_17])).
% 0.14/0.33 cnf(i_0_71, plain, (in(esk6_2(esk4_0,empty_set),empty_set)), inference(closure_rule, [i_0_4])).
% 0.14/0.33 cnf(i_0_70, plain, (in(esk6_2(esk4_0,empty_set),esk4_0)), inference(extension_rule, [i_0_1])).
% 0.14/0.33 cnf(i_0_78, plain, (~in(esk4_0,esk6_2(esk4_0,empty_set))), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # There were 1 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 1 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 1 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_16, negated_conjecture, (cartesian_product2(esk4_0,esk5_0)=cartesian_product2(esk5_0,esk4_0))).
% 0.14/0.33 cnf(i_0_6, plain, (empty(empty_set))).
% 0.14/0.33 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.14/0.33 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.33 cnf(i_0_15, negated_conjecture, (esk4_0!=empty_set)).
% 0.14/0.33 cnf(i_0_14, negated_conjecture, (esk5_0!=empty_set)).
% 0.14/0.33 cnf(i_0_13, negated_conjecture, (esk4_0!=esk5_0)).
% 0.14/0.33 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.14/0.33 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.14/0.33 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.14/0.33 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.14/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.33 cnf(i_0_18, plain, (X1=X2|~in(esk6_2(X1,X2),X2)|~in(esk6_2(X1,X2),X1))).
% 0.14/0.33 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.14/0.33 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.14/0.33 cnf(i_0_17, plain, (X1=X2|in(esk6_2(X1,X2),X1)|in(esk6_2(X1,X2),X2))).
% 0.14/0.33 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 4 steps
% 0.14/0.33 cnf(i_0_15, negated_conjecture, (esk4_0!=empty_set), inference(start_rule)).
% 0.14/0.33 cnf(i_0_22, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_3])).
% 0.14/0.33 cnf(i_0_59, plain, (in(esk1_1(esk4_0),esk4_0)), inference(extension_rule, [i_0_1])).
% 0.14/0.33 cnf(i_0_78, plain, (~in(esk4_0,esk1_1(esk4_0))), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # There were 1 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 1 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 1 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_16, negated_conjecture, (cartesian_product2(esk4_0,esk5_0)=cartesian_product2(esk5_0,esk4_0))).
% 0.14/0.33 cnf(i_0_6, plain, (empty(empty_set))).
% 0.14/0.33 cnf(i_0_11, plain, (empty(esk2_0))).
% 0.14/0.33 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.33 cnf(i_0_15, negated_conjecture, (esk4_0!=empty_set)).
% 0.14/0.33 cnf(i_0_14, negated_conjecture, (esk5_0!=empty_set)).
% 0.14/0.33 cnf(i_0_13, negated_conjecture, (esk4_0!=esk5_0)).
% 0.14/0.33 cnf(i_0_12, plain, (~empty(esk3_0))).
% 0.14/0.33 cnf(i_0_4, plain, (~in(X1,empty_set))).
% 0.14/0.33 cnf(i_0_7, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.14/0.33 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.14/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.33 cnf(i_0_18, plain, (X1=X2|~in(esk6_2(X1,X2),X2)|~in(esk6_2(X1,X2),X1))).
% 0.14/0.33 cnf(i_0_9, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.14/0.33 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.14/0.33 cnf(i_0_17, plain, (X1=X2|in(esk6_2(X1,X2),X1)|in(esk6_2(X1,X2),X2))).
% 0.14/0.33 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 5 steps
% 0.14/0.33 cnf(i_0_14, negated_conjecture, (esk5_0!=empty_set), inference(start_rule)).
% 0.14/0.33 cnf(i_0_21, plain, (esk5_0!=empty_set), inference(extension_rule, [i_0_17])).
% 0.14/0.33 cnf(i_0_54, plain, (in(esk6_2(esk5_0,empty_set),empty_set)), inference(closure_rule, [i_0_4])).
% 0.14/0.33 cnf(i_0_53, plain, (in(esk6_2(esk5_0,empty_set),esk5_0)), inference(extension_rule, [i_0_1])).
% 0.14/0.33 cnf(i_0_78, plain, (~in(esk5_0,esk6_2(esk5_0,empty_set))), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # Child (6456) has found a proof.
% 0.14/0.33
% 0.14/0.33 # Proof search is over...
% 0.14/0.33 # Freeing feature tree
%------------------------------------------------------------------------------