TSTP Solution File: SET954+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET954+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 : n014.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:05 EDT 2022
% Result : Theorem 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % 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 : n014.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 : Sat Jul 9 17:37:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 10 Number of unprocessed: 10
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 10 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 2 conjectures.
% 0.21/0.38 # There are 2 start rule candidates:
% 0.21/0.38 # Found 6 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 2 start rule tableaux created.
% 0.21/0.38 # 4 extension rule candidate clauses
% 0.21/0.38 # 6 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.21/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 8 tableaux to operate on
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.21/0.38 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)))).
% 0.21/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.38 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.21/0.38 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.38 cnf(i_0_10, negated_conjecture, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)))).
% 0.21/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.38 cnf(i_0_6, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.21/0.38 cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.21/0.38 cnf(i_0_5, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 4 steps
% 0.21/0.38 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(start_rule)).
% 0.21/0.38 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_6])).
% 0.21/0.38 cnf(i_0_25, plain, (in(esk4_0,esk6_0)), inference(extension_rule, [i_0_1])).
% 0.21/0.38 cnf(i_0_33, plain, (~in(esk6_0,esk4_0)), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.21/0.38 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)))).
% 0.21/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.38 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.21/0.38 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.38 cnf(i_0_10, negated_conjecture, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)))).
% 0.21/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.38 cnf(i_0_6, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.21/0.38 cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.21/0.39 cnf(i_0_5, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(start_rule)).
% 0.21/0.39 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_7])).
% 0.21/0.39 cnf(i_0_27, plain, (in(esk3_0,esk5_0)), inference(extension_rule, [i_0_1])).
% 0.21/0.39 cnf(i_0_33, plain, (~in(esk5_0,esk3_0)), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)))).
% 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.39 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.21/0.39 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.39 cnf(i_0_10, negated_conjecture, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)))).
% 0.21/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.39 cnf(i_0_6, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.21/0.39 cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.21/0.39 cnf(i_0_5, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 5 steps
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(start_rule)).
% 0.21/0.39 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_5])).
% 0.21/0.39 cnf(i_0_30, plain, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_29, plain, (in(unordered_pair(unordered_pair(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0))),singleton(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)))),cartesian_product2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk5_0,esk6_0)))), inference(extension_rule, [i_0_1])).
% 0.21/0.39 cnf(i_0_33, plain, (~in(cartesian_product2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk5_0,esk6_0)),unordered_pair(unordered_pair(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0))),singleton(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)))))), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)))).
% 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.39 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.21/0.39 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.39 cnf(i_0_10, negated_conjecture, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)))).
% 0.21/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.39 cnf(i_0_6, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.21/0.39 cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.21/0.39 cnf(i_0_5, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 5 steps
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(start_rule)).
% 0.21/0.39 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_5])).
% 0.21/0.39 cnf(i_0_31, plain, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_29, plain, (in(unordered_pair(unordered_pair(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0))),singleton(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)))),cartesian_product2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk5_0,esk6_0)))), inference(extension_rule, [i_0_1])).
% 0.21/0.39 cnf(i_0_33, plain, (~in(cartesian_product2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk5_0,esk6_0)),unordered_pair(unordered_pair(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0))),singleton(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)))))), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # Child (28810) has found a proof.
% 0.21/0.39
% 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_8, plain, (empty(esk1_0))).
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)))).
% 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.39 cnf(i_0_9, plain, (~empty(esk2_0))).
% 0.21/0.39 cnf(i_0_4, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.39 cnf(i_0_10, negated_conjecture, (~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)))).
% 0.21/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.39 cnf(i_0_6, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))).
% 0.21/0.39 cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))).
% 0.21/0.39 cnf(i_0_5, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_11, negated_conjecture, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(start_rule)).
% 0.21/0.39 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_1])).
% 0.21/0.39 cnf(i_0_23, plain, (~in(cartesian_product2(esk5_0,esk6_0),unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)))), inference(extension_rule, [i_0_6])).
% 0.21/0.39 cnf(i_0_35, plain, (~in(unordered_pair(unordered_pair(X7,cartesian_product2(esk5_0,esk6_0)),singleton(X7)),cartesian_product2(X8,unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0))))), inference(etableau_closure_rule, [i_0_35, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------