TSTP Solution File: SEU135+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU135+2 : 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 : 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 09:24:04 EDT 2022
% Result : Theorem 34.63s 5.50s
% Output : CNFRefutation 34.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU135+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 23:53:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 71 Number of unprocessed: 71
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.94/1.14 # The folding up rule is enabled...
% 0.94/1.14 # Local unification is enabled...
% 0.94/1.14 # Any saturation attempts will use folding labels...
% 0.94/1.14 # 71 beginning clauses after preprocessing and clausification
% 0.94/1.14 # Creating start rules for all 1 conjectures.
% 0.94/1.14 # There are 1 start rule candidates:
% 0.94/1.14 # Found 17 unit axioms.
% 0.94/1.14 # 1 start rule tableaux created.
% 0.94/1.14 # 54 extension rule candidate clauses
% 0.94/1.14 # 17 unit axiom clauses
% 0.94/1.14
% 0.94/1.14 # Requested 8, 32 cores available to the main process.
% 0.94/1.14 # There are not enough tableaux to fork, creating more from the initial 1
% 1.08/1.23 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
% 1.08/1.23 # We now have 17 tableaux to operate on
% 34.63/5.50 # There were 23 total branch saturation attempts.
% 34.63/5.50 # There were 13 of these attempts blocked.
% 34.63/5.50 # There were 0 deferred branch saturation attempts.
% 34.63/5.50 # There were 0 free duplicated saturations.
% 34.63/5.50 # There were 7 total successful branch saturations.
% 34.63/5.50 # There were 0 successful branch saturations in interreduction.
% 34.63/5.50 # There were 0 successful branch saturations on the branch.
% 34.63/5.50 # There were 7 successful branch saturations after the branch.
% 34.63/5.50 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.63/5.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.63/5.50 # Begin clausification derivation
% 34.63/5.50
% 34.63/5.50 # End clausification derivation
% 34.63/5.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 34.63/5.50 cnf(i_0_36, plain, (empty(empty_set))).
% 34.63/5.50 cnf(i_0_43, plain, (empty(esk6_0))).
% 34.63/5.50 cnf(i_0_44, plain, (~empty(esk7_0))).
% 34.63/5.50 cnf(i_0_71, plain, (X1=empty_set|~empty(X1))).
% 34.63/5.50 cnf(i_0_54, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 34.63/5.50 cnf(i_0_68, plain, (set_difference(empty_set,X1)=empty_set)).
% 34.63/5.50 cnf(i_0_57, lemma, (subset(empty_set,X1))).
% 34.63/5.50 cnf(i_0_50, plain, (set_union2(X1,empty_set)=X1)).
% 34.63/5.50 cnf(i_0_63, plain, (set_difference(X1,empty_set)=X1)).
% 34.63/5.50 cnf(i_0_45, plain, (subset(X1,X1))).
% 34.63/5.50 cnf(i_0_39, plain, (set_union2(X1,X1)=X1)).
% 34.63/5.50 cnf(i_0_40, plain, (set_intersection2(X1,X1)=X1)).
% 34.63/5.50 cnf(i_0_74, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 34.63/5.50 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 34.63/5.50 cnf(i_0_6, plain, (subset(X1,X2)|X1!=X2)).
% 34.63/5.50 cnf(i_0_67, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 34.63/5.50 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 34.63/5.50 cnf(i_0_8, plain, (X1!=empty_set|~in(X2,X1))).
% 34.63/5.50 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 34.63/5.50 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 34.63/5.50 cnf(i_0_72, plain, (~empty(X2)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_31, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 34.63/5.50 cnf(i_0_41, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_60, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_42, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 34.63/5.50 cnf(i_0_61, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 34.63/5.50 cnf(i_0_30, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 34.63/5.50 cnf(i_0_46, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 34.63/5.50 cnf(i_0_47, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_53, lemma, (set_intersection2(X1,X2)=X1|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_73, lemma, (subset(X1,set_union2(X1,X2)))).
% 34.63/5.50 cnf(i_0_48, lemma, (subset(set_intersection2(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_59, lemma, (subset(set_difference(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_38, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 34.63/5.50 cnf(i_0_37, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 34.63/5.50 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_65, lemma, (disjoint(X1,X2)|in(esk11_2(X1,X2),X2))).
% 34.63/5.50 cnf(i_0_66, lemma, (disjoint(X1,X2)|in(esk11_2(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_17, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_51, lemma, (subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_12, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_22, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 34.63/5.50 cnf(i_0_23, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 34.63/5.50 cnf(i_0_29, plain, (in(X1,X2)|X3!=set_difference(X2,X4)|~in(X1,X3))).
% 34.63/5.50 cnf(i_0_62, negated_conjecture, (set_union2(esk9_0,set_difference(esk10_0,esk9_0))!=set_union2(esk9_0,esk10_0))).
% 34.63/5.50 cnf(i_0_64, lemma, (~in(X1,X3)|~in(X1,X2)|~disjoint(X2,X3))).
% 34.63/5.50 cnf(i_0_28, plain, (X3!=set_difference(X4,X2)|~in(X1,X3)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_27, plain, (in(X1,X4)|in(X1,X3)|X4!=set_difference(X2,X3)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_14, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))).
% 34.63/5.50 cnf(i_0_70, lemma, (disjoint(X1,X2)|in(esk12_2(X1,X2),set_intersection2(X1,X2)))).
% 34.63/5.50 cnf(i_0_55, plain, (X1=X2|in(esk8_2(X1,X2),X2)|in(esk8_2(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_21, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 34.63/5.50 cnf(i_0_49, lemma, (subset(X1,set_intersection2(X2,X3))|~subset(X1,X3)|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_75, lemma, (subset(set_union2(X1,X3),X2)|~subset(X3,X2)|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_69, lemma, (~disjoint(X2,X3)|~in(X1,set_intersection2(X2,X3)))).
% 34.63/5.50 cnf(i_0_52, lemma, (subset(set_intersection2(X1,X3),set_intersection2(X2,X3))|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_58, lemma, (subset(set_difference(X1,X3),set_difference(X2,X3))|~subset(X1,X2))).
% 34.63/5.50 cnf(i_0_56, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))).
% 34.63/5.50 cnf(i_0_18, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X2))).
% 34.63/5.50 cnf(i_0_19, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X1))).
% 34.63/5.50 cnf(i_0_25, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X3)|in(esk5_3(X1,X2,X3),X1))).
% 34.63/5.50 cnf(i_0_24, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X3)|~in(esk5_3(X1,X2,X3),X2))).
% 34.63/5.50 cnf(i_0_9, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))).
% 34.63/5.50 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))).
% 34.63/5.50 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))).
% 34.63/5.50 cnf(i_0_26, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X2)|~in(esk5_3(X1,X2,X3),X3)|~in(esk5_3(X1,X2,X3),X1))).
% 34.63/5.50 cnf(i_0_20, plain, (X3=set_intersection2(X1,X2)|~in(esk4_3(X1,X2,X3),X3)|~in(esk4_3(X1,X2,X3),X2)|~in(esk4_3(X1,X2,X3),X1))).
% 34.63/5.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 34.63/5.50 # Begin printing tableau
% 34.63/5.50 # Found 6 steps
% 34.63/5.50 cnf(i_0_62, negated_conjecture, (set_union2(esk9_0,set_difference(esk10_0,esk9_0))!=set_union2(esk9_0,esk10_0)), inference(start_rule)).
% 34.63/5.50 cnf(i_0_76, plain, (set_union2(esk9_0,set_difference(esk10_0,esk9_0))!=set_union2(esk9_0,esk10_0)), inference(extension_rule, [i_0_9])).
% 34.63/5.50 cnf(i_0_201, plain, (in(esk2_3(esk9_0,esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),set_union2(esk9_0,set_difference(esk10_0,esk9_0)))), inference(extension_rule, [i_0_8])).
% 34.63/5.50 cnf(i_0_202, plain, (in(esk2_3(esk9_0,esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),esk10_0)), inference(etableau_closure_rule, [i_0_202, ...])).
% 34.63/5.50 cnf(i_0_203, plain, (in(esk2_3(esk9_0,esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),esk9_0)), inference(etableau_closure_rule, [i_0_203, ...])).
% 34.63/5.50 cnf(i_0_570836, plain, (set_union2(esk9_0,set_difference(esk10_0,esk9_0))!=empty_set), inference(etableau_closure_rule, [i_0_570836, ...])).
% 34.63/5.50 # End printing tableau
% 34.63/5.50 # SZS output end
% 34.63/5.50 # Branches closed with saturation will be marked with an "s"
% 34.89/5.51 # Child (9981) has found a proof.
% 34.89/5.51
% 34.89/5.51 # Proof search is over...
% 34.89/5.51 # Freeing feature tree
%------------------------------------------------------------------------------