TSTP Solution File: SEU127+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU127+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 : n010.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:23:59 EDT 2022
% Result : Theorem 0.19s 0.42s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU127+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.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 13:27:37 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: 51 Number of unprocessed: 51
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.19/0.42 # The folding up rule is enabled...
% 0.19/0.42 # Local unification is enabled...
% 0.19/0.42 # Any saturation attempts will use folding labels...
% 0.19/0.42 # 51 beginning clauses after preprocessing and clausification
% 0.19/0.42 # Creating start rules for all 1 conjectures.
% 0.19/0.42 # There are 1 start rule candidates:
% 0.19/0.42 # Found 13 unit axioms.
% 0.19/0.42 # 1 start rule tableaux created.
% 0.19/0.42 # 38 extension rule candidate clauses
% 0.19/0.42 # 13 unit axiom clauses
% 0.19/0.42
% 0.19/0.42 # Requested 8, 32 cores available to the main process.
% 0.19/0.42 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.42 # There were 1 total branch saturation attempts.
% 0.19/0.42 # There were 0 of these attempts blocked.
% 0.19/0.42 # There were 0 deferred branch saturation attempts.
% 0.19/0.42 # There were 0 free duplicated saturations.
% 0.19/0.42 # There were 1 total successful branch saturations.
% 0.19/0.42 # There were 0 successful branch saturations in interreduction.
% 0.19/0.42 # There were 0 successful branch saturations on the branch.
% 0.19/0.42 # There were 1 successful branch saturations after the branch.
% 0.19/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 # Begin clausification derivation
% 0.19/0.42
% 0.19/0.42 # End clausification derivation
% 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.42 cnf(i_0_29, plain, (empty(empty_set))).
% 0.19/0.42 cnf(i_0_34, plain, (empty(esk5_0))).
% 0.19/0.42 cnf(i_0_35, plain, (~empty(esk6_0))).
% 0.19/0.42 cnf(i_0_50, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.42 cnf(i_0_42, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.19/0.42 cnf(i_0_43, lemma, (subset(empty_set,X1))).
% 0.19/0.42 cnf(i_0_40, plain, (set_union2(X1,empty_set)=X1)).
% 0.19/0.42 cnf(i_0_36, plain, (subset(X1,X1))).
% 0.19/0.42 cnf(i_0_32, plain, (set_union2(X1,X1)=X1)).
% 0.19/0.42 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)).
% 0.19/0.42 cnf(i_0_53, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.42 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 0.19/0.42 cnf(i_0_6, plain, (subset(X1,X2)|X1!=X2)).
% 0.19/0.42 cnf(i_0_47, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 0.19/0.42 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.19/0.42 cnf(i_0_8, plain, (X1!=empty_set|~in(X2,X1))).
% 0.19/0.42 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.19/0.42 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.19/0.42 cnf(i_0_51, plain, (~empty(X2)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_25, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.19/0.42 cnf(i_0_24, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.19/0.42 cnf(i_0_37, plain, (disjoint(X2,X1)|~disjoint(X1,X2))).
% 0.19/0.42 cnf(i_0_38, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.19/0.42 cnf(i_0_52, lemma, (subset(X1,set_union2(X1,X2)))).
% 0.19/0.42 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.19/0.42 cnf(i_0_39, negated_conjecture, (~subset(set_intersection2(esk7_0,esk8_0),esk7_0))).
% 0.19/0.42 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.19/0.42 cnf(i_0_30, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.19/0.42 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))).
% 0.19/0.42 cnf(i_0_45, lemma, (disjoint(X1,X2)|in(esk9_2(X1,X2),X2))).
% 0.19/0.42 cnf(i_0_46, lemma, (disjoint(X1,X2)|in(esk9_2(X1,X2),X1))).
% 0.19/0.42 cnf(i_0_17, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.19/0.42 cnf(i_0_41, lemma, (subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2))).
% 0.19/0.42 cnf(i_0_12, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_22, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.19/0.42 cnf(i_0_23, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.19/0.42 cnf(i_0_44, lemma, (~in(X1,X3)|~in(X1,X2)|~disjoint(X2,X3))).
% 0.19/0.42 cnf(i_0_14, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))).
% 0.19/0.42 cnf(i_0_49, lemma, (disjoint(X1,X2)|in(esk10_2(X1,X2),set_intersection2(X1,X2)))).
% 0.19/0.42 cnf(i_0_21, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.19/0.42 cnf(i_0_54, lemma, (subset(set_union2(X1,X3),X2)|~subset(X3,X2)|~subset(X1,X2))).
% 0.19/0.42 cnf(i_0_48, lemma, (~disjoint(X2,X3)|~in(X1,set_intersection2(X2,X3)))).
% 0.19/0.42 cnf(i_0_18, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X2))).
% 0.19/0.42 cnf(i_0_19, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X1))).
% 0.19/0.43 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))).
% 0.19/0.43 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))).
% 0.19/0.43 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))).
% 0.19/0.43 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))).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 5 steps
% 0.19/0.43 cnf(i_0_39, negated_conjecture, (~subset(set_intersection2(esk7_0,esk8_0),esk7_0)), inference(start_rule)).
% 0.19/0.43 cnf(i_0_55, plain, (~subset(set_intersection2(esk7_0,esk8_0),esk7_0)), inference(extension_rule, [i_0_15])).
% 0.19/0.43 cnf(i_0_122, plain, (~in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),esk7_0)), inference(extension_rule, [i_0_17])).
% 0.19/0.43 cnf(i_0_196, plain, (~subset(empty_set,esk7_0)), inference(closure_rule, [i_0_43])).
% 0.19/0.43 cnf(i_0_195, plain, (~in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),empty_set)), inference(etableau_closure_rule, [i_0_195, ...])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.43 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.43 # We now have 5 tableaux to operate on
% 0.19/0.43 # Found closed tableau during pool population.
% 0.19/0.43 # Proof search is over...
% 0.19/0.43 # Freeing feature tree
%------------------------------------------------------------------------------