TSTP Solution File: SEU180+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU180+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 : n020.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:32 EDT 2022
% Result : Theorem 0.21s 0.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 05:22:48 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.39 # No SInE strategy applied
% 0.21/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.21/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.21/0.39 #
% 0.21/0.39 # Number of axioms: 40 Number of unprocessed: 40
% 0.21/0.39 # Tableaux proof search.
% 0.21/0.39 # APR header successfully linked.
% 0.21/0.39 # Hello from C++
% 0.21/0.39 # The folding up rule is enabled...
% 0.21/0.39 # Local unification is enabled...
% 0.21/0.39 # Any saturation attempts will use folding labels...
% 0.21/0.39 # 40 beginning clauses after preprocessing and clausification
% 0.21/0.39 # Creating start rules for all 3 conjectures.
% 0.21/0.39 # There are 3 start rule candidates:
% 0.21/0.39 # Found 15 unit axioms.
% 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.39 # 3 start rule tableaux created.
% 0.21/0.39 # 25 extension rule candidate clauses
% 0.21/0.39 # 15 unit axiom clauses
% 0.21/0.39
% 0.21/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 3
% 0.21/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39 # We now have 13 tableaux to operate on
% 0.21/0.41 # There were 1 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 1 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 1 successful branch saturations after the branch.
% 0.21/0.41 # There were 1 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 1 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 1 successful branch saturations after the branch.
% 0.21/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_38, plain, (relation(esk9_0))).
% 0.21/0.41 cnf(i_0_47, negated_conjecture, (relation(esk14_0))).
% 0.21/0.41 cnf(i_0_30, plain, (empty(empty_set))).
% 0.21/0.41 cnf(i_0_39, plain, (empty(esk9_0))).
% 0.21/0.41 cnf(i_0_40, plain, (empty(esk10_0))).
% 0.21/0.41 cnf(i_0_41, plain, (~empty(esk11_0))).
% 0.21/0.41 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.21/0.41 cnf(i_0_42, plain, (set_union2(X1,empty_set)=X1)).
% 0.21/0.41 cnf(i_0_37, plain, (set_union2(X1,X1)=X1)).
% 0.21/0.41 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.21/0.41 cnf(i_0_33, plain, (~empty(singleton(X1)))).
% 0.21/0.41 cnf(i_0_29, plain, (element(esk8_1(X1),X1))).
% 0.21/0.41 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.41 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.21/0.41 cnf(i_0_49, plain, (~empty(X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_19, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_44, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.21/0.41 cnf(i_0_32, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.21/0.41 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_35, plain, (~empty(unordered_pair(X1,X2)))).
% 0.21/0.41 cnf(i_0_45, negated_conjecture, (~in(esk12_0,relation_field(esk14_0))|~in(esk13_0,relation_field(esk14_0)))).
% 0.21/0.41 cnf(i_0_36, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.21/0.41 cnf(i_0_34, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.21/0.41 cnf(i_0_7, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_8, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_9, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_46, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0))).
% 0.21/0.41 cnf(i_0_31, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.41 cnf(i_0_16, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.21/0.41 cnf(i_0_12, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.21/0.41 cnf(i_0_4, plain, (X3=set_union2(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(esk1_3(X1,X2,X3),X2)|in(esk1_3(X1,X2,X3),X1))).
% 0.21/0.41 cnf(i_0_5, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2))).
% 0.21/0.41 cnf(i_0_6, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X1))).
% 0.21/0.41 cnf(i_0_15, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk6_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk6_2(X1,X2)),singleton(X3)),X1))).
% 0.21/0.41 cnf(i_0_10, plain, (X2=relation_dom(X1)|in(esk3_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_14, plain, (X2=relation_rng(X1)|in(esk6_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),singleton(esk7_2(X1,X2))),X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_11, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk3_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),X3),singleton(esk3_2(X1,X2))),X1))).
% 0.21/0.41 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_17, plain, (in(unordered_pair(unordered_pair(esk5_3(X3,X2,X1),X1),singleton(esk5_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 6 steps
% 0.21/0.41 cnf(i_0_46, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_51, plain, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0)), inference(extension_rule, [i_0_12])).
% 0.21/0.41 cnf(i_0_93, plain, (set_union2(relation_dom(esk14_0),empty_set)!=relation_dom(esk14_0)), inference(closure_rule, [i_0_42])).
% 0.21/0.41 cnf(i_0_94, plain, (~relation(esk14_0)), infer# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_38, plain, (relation(esk9_0))).
% 0.21/0.41 cnf(i_0_47, negated_conjecture, (relation(esk14_0))).
% 0.21/0.41 cnf(i_0_30, plain, (empty(empty_set))).
% 0.21/0.41 cnf(i_0_39, plain, (empty(esk9_0))).
% 0.21/0.41 cnf(i_0_40, plain, (empty(esk10_0))).
% 0.21/0.41 cnf(i_0_41, plain, (~empty(esk11_0))).
% 0.21/0.41 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 0.21/0.41 cnf(i_0_42, plain, (set_union2(X1,empty_set)=X1)).
% 0.21/0.41 cnf(i_0_37, plain, (set_union2(X1,X1)=X1)).
% 0.21/0.41 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.21/0.41 cnf(i_0_33, plain, (~empty(singleton(X1)))).
% 0.21/0.41 cnf(i_0_29, plain, (element(esk8_1(X1),X1))).
% 0.21/0.41 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.41 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.21/0.41 cnf(i_0_49, plain, (~empty(X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_19, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_44, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.21/0.41 cnf(i_0_32, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.21/0.41 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_35, plain, (~empty(unordered_pair(X1,X2)))).
% 0.21/0.41 cnf(i_0_45, negated_conjecture, (~in(esk12_0,relation_field(esk14_0))|~in(esk13_0,relation_field(esk14_0)))).
% 0.21/0.41 cnf(i_0_36, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.21/0.41 cnf(i_0_34, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.21/0.41 cnf(i_0_7, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_8, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_9, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_46, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0))).
% 0.21/0.41 cnf(i_0_31, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.21/0.41 cnf(i_0_16, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.21/0.41 cnf(i_0_12, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.21/0.41 cnf(i_0_4, plain, (X3=set_union2(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(esk1_3(X1,X2,X3),X2)|in(esk1_3(X1,X2,X3),X1))).
% 0.21/0.41 cnf(i_0_5, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2))).
% 0.21/0.41 cnf(i_0_6, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X1))).
% 0.21/0.41 cnf(i_0_15, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk6_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk6_2(X1,X2)),singleton(X3)),X1))).
% 0.21/0.41 cnf(i_0_10, plain, (X2=relation_dom(X1)|in(esk3_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_14, plain, (X2=relation_rng(X1)|in(esk6_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),singleton(esk7_2(X1,X2))),X1)|~relation(X1))).
% 0.21/0.41 cnf(i_0_11, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk3_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),X3),singleton(esk3_2(X1,X2))),X1))).
% 0.21/0.41 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 0.21/0.41 cnf(i_0_17, plain, (in(unordered_pair(unordered_pair(esk5_3(X3,X2,X1),X1),singleton(esk5_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 6 steps
% 0.21/0.41 cnf(i_0_46, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_51, plain, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0)), inference(extension_rule, [i_0_16])).
% 0.21/0.41 cnf(i_0_89, plain, (set_union2(relation_rng(esk14_0),empty_set)!=relation_rng(esk14_0)), inference(closure_rule, [i_0_42])).
% 0.21/0.41 cnf(i_0_90, plain, (~relation(esk14_0)), inference(closure_rule, [i_0_47])).
% 0.21/0.41 cnf(i_0_88, plain, (in(esk13_0,set_union2(relation_rng(esk14_0),empty_set))), inference(extension_rule, [i_0_49])).
% 0.21/0.41 cnf(i_0_137, plain, (~empty(set_union2(relation_rng(esk14_0),empty_set))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 ence(closure_rule, [i_0_47])).
% 0.21/0.41 cnf(i_0_92, plain, (in(esk12_0,set_union2(relation_dom(esk14_0),empty_set))), inference(extension_rule, [i_0_49])).
% 0.21/0.41 cnf(i_0_137, plain, (~empty(set_union2(relation_dom(esk14_0),empty_set))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # Child (14868) has found a proof.
% 0.21/0.41
% 0.21/0.41 # Proof search is over...
% 0.21/0.41 # Freeing feature tree
%------------------------------------------------------------------------------