TSTP Solution File: SEU199+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU199+1 : TPTP v8.1.0. Released v3.3.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 : n011.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 09:24:42 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU199+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 01:13:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.20/0.38 #
% 0.20/0.38 # Number of axioms: 43 Number of unprocessed: 43
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 43 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 2 conjectures.
% 0.20/0.39 # There are 2 start rule candidates:
% 0.20/0.39 # Found 20 unit axioms.
% 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39 # 2 start rule tableaux created.
% 0.20/0.39 # 23 extension rule candidate clauses
% 0.20/0.39 # 20 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.20/0.39 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 22 tableaux to operate on
% 0.20/0.49 # There were 2 total branch saturation attempts.
% 0.20/0.49 # There were 0 of these attempts blocked.
% 0.20/0.49 # There were 0 deferred branch saturation attempts.
% 0.20/0.49 # There were 0 free duplicated saturations.
% 0.20/0.49 # There were 2 total successful branch saturations.
% 0.20/0.49 # There were 0 successful branch saturations in interreduction.
% 0.20/0.49 # There were 0 successful branch saturations on the branch.
% 0.20/0.49 # There were 2 successful branch saturations after the branch.
% 0.20/0.49 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Begin clausification derivation
% 0.20/0.49
% 0.20/0.49 # End clausification derivation
% 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.49 cnf(i_0_23, plain, (empty(empty_set))).
% 0.20/0.49 cnf(i_0_28, plain, (empty(empty_set))).
% 0.20/0.49 cnf(i_0_30, plain, (empty(esk6_0))).
% 0.20/0.49 cnf(i_0_33, plain, (empty(esk8_0))).
% 0.20/0.49 cnf(i_0_27, plain, (relation(empty_set))).
% 0.20/0.49 cnf(i_0_29, plain, (relation(esk6_0))).
% 0.20/0.49 cnf(i_0_34, plain, (relation(esk9_0))).
% 0.20/0.49 cnf(i_0_41, negated_conjecture, (relation(esk13_0))).
% 0.20/0.49 cnf(i_0_35, plain, (~empty(esk9_0))).
% 0.20/0.49 cnf(i_0_38, plain, (~empty(esk11_0))).
% 0.20/0.49 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.20/0.49 cnf(i_0_36, plain, (empty(esk10_1(X1)))).
% 0.20/0.49 cnf(i_0_2, plain, (relation(X1)|~empty(X1))).
% 0.20/0.49 cnf(i_0_39, plain, (subset(X1,X1))).
% 0.20/0.49 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.20/0.49 cnf(i_0_25, plain, (~empty(singleton(X1)))).
% 0.20/0.49 cnf(i_0_22, plain, (~empty(powerset(X1)))).
% 0.20/0.49 cnf(i_0_21, plain, (element(esk5_1(X1),X1))).
% 0.20/0.49 cnf(i_0_31, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 0.20/0.49 cnf(i_0_37, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.20/0.49 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.20/0.49 cnf(i_0_49, plain, (~empty(X2)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_32, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 0.20/0.49 cnf(i_0_42, plain, (element(X1,X2)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_19, plain, (relation(relation_rng_restriction(X2,X1))|~relation(X1))).
% 0.20/0.49 cnf(i_0_43, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.20/0.49 cnf(i_0_44, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.20/0.49 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_45, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.20/0.49 cnf(i_0_26, plain, (~empty(unordered_pair(X1,X2)))).
% 0.20/0.49 cnf(i_0_40, negated_conjecture, (~subset(relation_rng_restriction(esk12_0,esk13_0),esk13_0))).
% 0.20/0.49 cnf(i_0_47, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.20/0.49 cnf(i_0_46, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.20/0.49 cnf(i_0_24, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.20/0.49 cnf(i_0_9, plain, (in(X1,X2)|X4!=relation_rng_restriction(X2,X5)|~relation(X5)|~relation(X4)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4))).
% 0.20/0.49 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)|~relation(X2)|~relation(X1)|~subset(X1,X2)|~in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1))).
% 0.20/0.49 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X4!=relation_rng_restriction(X5,X3)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4))).
% 0.20/0.49 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X5)|X5!=relation_rng_restriction(X2,X4)|~relation(X5)|~relation(X4)|~in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4))).
% 0.20/0.49 cnf(i_0_11, plain, (subset(X1,X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X2)|~relation(X1))).
% 0.20/0.49 cnf(i_0_10, plain, (subset(X1,X2)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X2))).
% 0.20/0.49 cnf(i_0_5, plain, (X3=relation_rng_restriction(X1,X2)|in(esk2_3(X1,X2,X3),X1)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|~relation(X3)|~relation(X2))).
% 0.20/0.49 cnf(i_0_4, plain, (X3=relation_rng_restriction(X1,X2)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X2)|~relation(X3)|~relation(X2))).
% 0.20/0.49 cnf(i_0_6, plain, (X3=relation_rng_restriction(X1,X2)|~relation(X3)|~relation(X2)|~in(esk2_3(X1,X2,X3),X1)|~in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|~in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X2))).
% 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.49 # Begin printing tableau
% 0.20/0.49 # Found 6 steps
% 0.20/0.49 cnf(i_0_41, negated_conjecture, (relation(esk13_0)), inference(start_rule)).
% 0.20/0.49 cnf(i_0_52, plain, (relation(esk13_0)), inference(extension_rule, [i_0_11])).
% 0.20/0.49 cnf(i_0_183, plain, (subset(relation_rng_restriction(esk12_0,esk13_0),esk13_0)), inference(closure_rule, [i_0_40])).
% 0.20/0.49 cnf(i_0_184, plain, (in(unordered_pair(unordered_pair(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0),esk4_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0)),singleton(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0))),relation_rng_restriction(esk12_0,esk13_0))), inference(extension_rule, [i_0_49])).
% 0.20/0.49 cnf(i_0_186, plain, (~relation(relation_rng_restriction(esk12_0,esk13_0))), inference(etableau_closure_rule, [i_0_186, ...])).
% 0.20/0.49 cnf(i_0_293, plain, (~empty(relation_rng_restriction(esk12_0,esk13_0))), inference(etableau_closure_rule, [i_0_293, ...])).
% 0.20/0.49 # End printing tableau
% 0.20/0.49 # SZS output end
% 0.20/0.49 # Branches closed with saturation will be marked with an "s"
% 0.20/0.49 # There were 2 total branch saturation attempts.
% 0.20/0.49 # There were 0 of these attempts blocked.
% 0.20/0.49 # There were 0 deferred branch saturation attempts.
% 0.20/0.49 # There were 0 free duplicated saturations.
% 0.20/0.49 # There were 2 total successful branch saturations.
% 0.20/0.49 # There were 0 successful branch saturations in interreduction.
% 0.20/0.49 # There were 0 successful branch saturations on the branch.
% 0.20/0.49 # There were 2 successful branch saturations after the branch.
% 0.20/0.49 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Begin clausification derivation
% 0.20/0.49
% 0.20/0.49 # End clausification derivation
% 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.49 cnf(i_0_23, plain, (empty(empty_set))).
% 0.20/0.49 cnf(i_0_28, plain, (empty(empty_set))).
% 0.20/0.49 cnf(i_0_30, plain, (empty(esk6_0))).
% 0.20/0.49 cnf(i_0_33, plain, (empty(esk8_0))).
% 0.20/0.49 cnf(i_0_27, plain, (relation(empty_set))).
% 0.20/0.49 cnf(i_0_29, plain, (relation(esk6_0))).
% 0.20/0.49 cnf(i_0_34, plain, (relation(esk9_0))).
% 0.20/0.49 cnf(i_0_41, negated_conjecture, (relation(esk13_0))).
% 0.20/0.49 cnf(i_0_35, plain, (~empty(esk9_0))).
% 0.20/0.49 cnf(i_0_38, plain, (~empty(esk11_0))).
% 0.20/0.49 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.20/0.49 cnf(i_0_36, plain, (empty(esk10_1(X1)))).
% 0.20/0.49 cnf(i_0_2, plain, (relation(X1)|~empty(X1))).
% 0.20/0.49 cnf(i_0_39, plain, (subset(X1,X1))).
% 0.20/0.49 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.20/0.49 cnf(i_0_25, plain, (~empty(singleton(X1)))).
% 0.20/0.49 cnf(i_0_22, plain, (~empty(powerset(X1)))).
% 0.20/0.49 cnf(i_0_21, plain, (element(esk5_1(X1),X1))).
% 0.20/0.49 cnf(i_0_31, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 0.20/0.49 cnf(i_0_37, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.20/0.49 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.20/0.49 cnf(i_0_49, plain, (~empty(X2)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_32, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 0.20/0.49 cnf(i_0_42, plain, (element(X1,X2)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_19, plain, (relation(relation_rng_restriction(X2,X1))|~relation(X1))).
% 0.20/0.49 cnf(i_0_43, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.20/0.49 cnf(i_0_44, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.20/0.49 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.20/0.49 cnf(i_0_45, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.20/0.49 cnf(i_0_26, plain, (~empty(unordered_pair(X1,X2)))).
% 0.20/0.49 cnf(i_0_40, negated_conjecture, (~subset(relation_rng_restriction(esk12_0,esk13_0),esk13_0))).
% 0.20/0.49 cnf(i_0_47, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.20/0.49 cnf(i_0_46, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.20/0.49 cnf(i_0_24, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.20/0.49 cnf(i_0_9, plain, (in(X1,X2)|X4!=relation_rng_restriction(X2,X5)|~relation(X5)|~relation(X4)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4))).
% 0.20/0.49 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)|~relation(X2)|~relation(X1)|~subset(X1,X2)|~in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1))).
% 0.20/0.49 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X4!=relation_rng_restriction(X5,X3)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4))).
% 0.20/0.49 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X5)|X5!=relation_rng_restriction(X2,X4)|~relation(X5)|~relation(X4)|~in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4))).
% 0.20/0.49 cnf(i_0_11, plain, (subset(X1,X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X2)|~relation(X1))).
% 0.20/0.49 cnf(i_0_10, plain, (subset(X1,X2)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X2))).
% 0.20/0.49 cnf(i_0_5, plain, (X3=relation_rng_restriction(X1,X2)|in(esk2_3(X1,X2,X3),X1)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|~relation(X3)|~relation(X2))).
% 0.20/0.49 cnf(i_0_4, plain, (X3=relation_rng_restriction(X1,X2)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X2)|~relation(X3)|~relation(X2))).
% 0.20/0.49 cnf(i_0_6, plain, (X3=relation_rng_restriction(X1,X2)|~relation(X3)|~relation(X2)|~in(esk2_3(X1,X2,X3),X1)|~in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X3)|~in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk1_3(X1,X2,X3))),X2))).
% 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.49 # Begin printing tableau
% 0.20/0.49 # Found 6 step# Child (27714) has found a proof.
% 0.20/0.49
% 0.20/0.49 # Proof search is over...
% 0.20/0.49 # Freeing feature tree
%------------------------------------------------------------------------------