TSTP Solution File: SEU249+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU249+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 : n024.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:25:12 EDT 2022
% Result : Theorem 5.34s 1.08s
% Output : CNFRefutation 5.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU249+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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 : n024.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 Jun 19 00:07:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.14/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.38 #
% 0.14/0.38 # Number of axioms: 63 Number of unprocessed: 63
% 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 # 63 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 3 conjectures.
% 0.14/0.38 # There are 3 start rule candidates:
% 0.14/0.38 # Found 21 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 3 start rule tableaux created.
% 0.14/0.38 # 42 extension rule candidate clauses
% 0.14/0.38 # 21 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 3
% 0.14/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 15 tableaux to operate on
% 5.34/1.08 # There were 1 total branch saturation attempts.
% 5.34/1.08 # There were 0 of these attempts blocked.
% 5.34/1.08 # There were 0 deferred branch saturation attempts.
% 5.34/1.08 # There were 0 free duplicated saturations.
% 5.34/1.08 # There were 1 total successful branch saturations.
% 5.34/1.08 # There were 0 successful branch saturations in interreduction.
% 5.34/1.08 # There were 0 successful branch saturations on the branch.
% 5.34/1.08 # There were 1 successful branch saturations after the branch.
% 5.34/1.08 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.34/1.08 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.34/1.08 # Begin clausification derivation
% 5.34/1.08
% 5.34/1.08 # End clausification derivation
% 5.34/1.08 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.34/1.08 cnf(i_0_35, plain, (empty(empty_set))).
% 5.34/1.08 cnf(i_0_47, plain, (empty(esk5_0))).
% 5.34/1.08 cnf(i_0_49, plain, (empty(esk6_0))).
% 5.34/1.08 cnf(i_0_45, plain, (function(esk4_0))).
% 5.34/1.08 cnf(i_0_48, plain, (function(esk6_0))).
% 5.34/1.08 cnf(i_0_53, plain, (function(esk8_0))).
% 5.34/1.08 cnf(i_0_46, plain, (relation(esk4_0))).
% 5.34/1.08 cnf(i_0_50, plain, (relation(esk6_0))).
% 5.34/1.08 cnf(i_0_54, plain, (relation(esk8_0))).
% 5.34/1.08 cnf(i_0_61, negated_conjecture, (relation(esk11_0))).
% 5.34/1.08 cnf(i_0_52, plain, (one_to_one(esk8_0))).
% 5.34/1.08 cnf(i_0_51, plain, (~empty(esk7_0))).
% 5.34/1.08 cnf(i_0_70, plain, (X1=empty_set|~empty(X1))).
% 5.34/1.08 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 5.34/1.08 cnf(i_0_64, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 5.34/1.08 cnf(i_0_62, plain, (set_union2(X1,empty_set)=X1)).
% 5.34/1.08 cnf(i_0_55, plain, (subset(X1,X1))).
% 5.34/1.08 cnf(i_0_42, plain, (set_union2(X1,X1)=X1)).
% 5.34/1.08 cnf(i_0_43, plain, (set_intersection2(X1,X1)=X1)).
% 5.34/1.08 cnf(i_0_72, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 5.34/1.08 cnf(i_0_34, plain, (element(esk3_1(X1),X1))).
% 5.34/1.08 cnf(i_0_3, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 5.34/1.08 cnf(i_0_6, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 5.34/1.08 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 5.34/1.08 cnf(i_0_71, plain, (~empty(X2)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_63, plain, (element(X1,X2)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_26, plain, (relation(relation_restriction(X1,X2))|~relation(X1))).
% 5.34/1.08 cnf(i_0_31, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1))).
% 5.34/1.08 cnf(i_0_32, plain, (relation(relation_rng_restriction(X2,X1))|~relation(X1))).
% 5.34/1.08 cnf(i_0_20, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 5.34/1.08 cnf(i_0_65, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 5.34/1.08 cnf(i_0_59, negated_conjecture, (~in(esk9_0,esk10_0)|~in(esk9_0,relation_field(esk11_0)))).
% 5.34/1.08 cnf(i_0_66, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 5.34/1.08 cnf(i_0_38, plain, (function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))).
% 5.34/1.08 cnf(i_0_40, plain, (function(relation_rng_restriction(X1,X2))|~function(X2)|~relation(X2))).
% 5.34/1.08 cnf(i_0_39, plain, (relation(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))).
% 5.34/1.08 cnf(i_0_41, plain, (relation(relation_rng_restriction(X1,X2))|~function(X2)|~relation(X2))).
% 5.34/1.08 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_67, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 5.34/1.08 cnf(i_0_37, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 5.34/1.08 cnf(i_0_36, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 5.34/1.08 cnf(i_0_73, plain, (relation_dom(relation_dom_restriction(X1,X2))=set_intersection2(relation_dom(X1),X2)|~relation(X1))).
% 5.34/1.08 cnf(i_0_56, plain, (relation_rng(relation_rng_restriction(X2,X1))=set_intersection2(relation_rng(X1),X2)|~relation(X1))).
% 5.34/1.08 cnf(i_0_60, negated_conjecture, (in(esk9_0,relation_field(relation_restriction(esk11_0,esk10_0))))).
% 5.34/1.08 cnf(i_0_11, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_12, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_18, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 5.34/1.08 cnf(i_0_19, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 5.34/1.08 cnf(i_0_21, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))).
% 5.34/1.08 cnf(i_0_58, plain, (relation_rng_restriction(X2,relation_dom_restriction(X1,X2))=relation_restriction(X1,X2)|~relation(X1))).
% 5.34/1.08 cnf(i_0_57, plain, (relation_dom_restriction(relation_rng_restriction(X2,X1),X2)=relation_restriction(X1,X2)|~relation(X1))).
% 5.34/1.08 cnf(i_0_69, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 5.34/1.08 cnf(i_0_68, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 5.34/1.08 cnf(i_0_13, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_17, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 5.34/1.08 cnf(i_0_44, plain, (subset(relation_dom(relation_rng_restriction(X2,X1)),relation_dom(X1))|~relation(X1))).
% 5.34/1.08 cnf(i_0_74, plain, (subset(relation_rng(relation_dom_restriction(X1,X2)),relation_rng(X1))|~relation(X1))).
% 5.34/1.08 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2))).
% 5.34/1.08 cnf(i_0_15, plain, (X3=set_intersection2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X1))).
% 5.34/1.08 cnf(i_0_8, 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))).
% 5.34/1.08 cnf(i_0_9, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2))).
% 5.34/1.08 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X1))).
% 5.34/1.08 cnf(i_0_16, plain, (X3=set_intersection2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2)|~in(esk2_3(X1,X2,X3),X1))).
% 5.34/1.08 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.34/1.08 # Begin printing tableau
% 5.34/1.08 # Found 5 steps
% 5.34/1.08 cnf(i_0_60, negated_conjecture, (in(esk9_0,relation_field(relation_restriction(esk11_0,esk10_0)))), inference(start_rule)).
% 5.34/1.08 cnf(i_0_75, plain, (in(esk9_0,relation_field(relation_restriction(esk11_0,esk10_0)))), inference(extension_rule, [i_0_19])).
% 5.34/1.08 cnf(i_0_140, plain, (in(esk9_0,relation_field(relation_restriction(esk11_0,esk10_0)))), inference(extension_rule, [i_0_71])).
% 5.34/1.08 cnf(i_0_141, plain, (relation_field(relation_restriction(esk11_0,esk10_0))!=set_intersection2(relation_field(relation_restriction(esk11_0,esk10_0)),relation_field(relation_restriction(esk11_0,esk10_0)))), inference(closure_rule, [i_0_43])).
% 5.34/1.08 cnf(i_0_200, plain, (~empty(relation_field(relation_restriction(esk11_0,esk10_0)))), inference(etableau_closure_rule, [i_0_200, ...])).
% 5.34/1.08 # End printing tableau
% 5.34/1.08 # SZS output end
% 5.34/1.08 # Branches closed with saturation will be marked with an "s"
% 5.34/1.09 # Child (13924) has found a proof.
% 5.34/1.09
% 5.34/1.09 # Proof search is over...
% 5.34/1.09 # Freeing feature tree
%------------------------------------------------------------------------------