TSTP Solution File: SEU126+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU126+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 : n021.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.11s 0.37s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 10:25:18 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.11/0.36 # and selection function SelectCQArNTNpEqFirst.
% 0.11/0.36 #
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36 # Number of axioms: 50 Number of unprocessed: 48
% 0.11/0.36 # Tableaux proof search.
% 0.11/0.36 # APR header successfully linked.
% 0.11/0.36 # Hello from C++
% 0.11/0.36 # The folding up rule is enabled...
% 0.11/0.36 # Local unification is enabled...
% 0.11/0.36 # Any saturation attempts will use folding labels...
% 0.11/0.36 # 48 beginning clauses after preprocessing and clausification
% 0.11/0.36 # Creating start rules for all 2 conjectures.
% 0.11/0.36 # There are 2 start rule candidates:
% 0.11/0.36 # Found 14 unit axioms.
% 0.11/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.36 # 2 start rule tableaux created.
% 0.11/0.36 # 34 extension rule candidate clauses
% 0.11/0.36 # 14 unit axiom clauses
% 0.11/0.36
% 0.11/0.36 # Requested 8, 32 cores available to the main process.
% 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.11/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.36 # We now have 12 tableaux to operate on
% 0.11/0.37 # There were 2 total branch saturation attempts.
% 0.11/0.37 # There were 0 of these attempts blocked.
% 0.11/0.37 # There were 0 deferred branch saturation attempts.
% 0.11/0.37 # There were 0 free duplicated saturations.
% 0.11/0.37 # There were 2 total successful branch saturations.
% 0.11/0.37 # There were 1 successful branch saturations in interreduction.
% 0.11/0.37 # There were 0 successful branch saturations on the branch.
% 0.11/0.37 # There were 1 successful branch saturations after the branch.
% 0.11/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 # Begin clausification derivation
% 0.11/0.37
% 0.11/0.37 # End clausification derivation
% 0.11/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.37 cnf(i_0_39, negated_conjecture, (subset(esk7_0,esk8_0))).
% 0.11/0.37 cnf(i_0_29, plain, (empty(empty_set))).
% 0.11/0.37 cnf(i_0_34, plain, (empty(esk5_0))).
% 0.11/0.37 cnf(i_0_42, lemma, (subset(empty_set,X1))).
% 0.11/0.37 cnf(i_0_36, plain, (subset(X1,X1))).
% 0.11/0.37 cnf(i_0_40, plain, (set_union2(X1,empty_set)=X1)).
% 0.11/0.37 cnf(i_0_32, plain, (set_union2(X1,X1)=X1)).
% 0.11/0.37 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)).
% 0.11/0.37 cnf(i_0_51, lemma, (subset(X1,set_union2(X1,X2)))).
% 0.11/0.37 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.11/0.37 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.11/0.37 cnf(i_0_35, plain, (~empty(esk6_0))).
% 0.11/0.37 cnf(i_0_8, plain, (~in(X1,empty_set))).
% 0.11/0.37 cnf(i_0_38, negated_conjecture, (set_union2(esk8_0,esk7_0)!=esk8_0)).
% 0.11/0.37 cnf(i_0_49, plain, (X1=empty_set|~empty(X1))).
% 0.11/0.37 cnf(i_0_50, plain, (~empty(X1)|~in(X2,X1))).
% 0.11/0.37 cnf(i_0_46, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 0.11/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.11/0.37 cnf(i_0_47, lemma, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))).
% 0.11/0.37 cnf(i_0_43, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 0.11/0.37 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.11/0.37 cnf(i_0_30, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.11/0.37 cnf(i_0_52, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.11/0.37 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.11/0.37 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.11/0.37 cnf(i_0_25, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.11/0.37 cnf(i_0_24, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.11/0.37 cnf(i_0_37, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.11/0.37 cnf(i_0_17, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.11/0.37 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))).
% 0.11/0.37 cnf(i_0_41, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.11/0.37 cnf(i_0_53, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))).
% 0.11/0.37 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))).
% 0.11/0.37 cnf(i_0_44, lemma, (disjoint(X1,X2)|in(esk9_2(X1,X2),X2))).
% 0.11/0.37 cnf(i_0_45, lemma, (disjoint(X1,X2)|in(esk9_2(X1,X2),X1))).
% 0.11/0.37 cnf(i_0_48, lemma, (disjoint(X1,X2)|in(esk10_2(X1,X2),set_intersection2(X1,X2)))).
% 0.11/0.37 cnf(i_0_22, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))).
% 0.11/0.37 cnf(i_0_12, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.11/0.37 cnf(i_0_13, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.11/0.37 cnf(i_0_23, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))).
% 0.11/0.37 cnf(i_0_21, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))).
% 0.11/0.37 cnf(i_0_14, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.11/0.37 cnf(i_0_10, plain, (X1=set_union2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3))).
% 0.11/0.37 cnf(i_0_11, plain, (X1=set_union2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X2))).
% 0.11/0.37 cnf(i_0_20, plain, (X1=set_intersection2(X2,X3)|~in(esk4_3(X2,X3,X1),X1)|~in(esk4_3(X2,X3,X1),X3)|~in(esk4_3(X2,X3,X1),X2))).
% 0.11/0.37 cnf(i_0_18, plain, (X1=set_intersection2(X2,X3)|in(esk4_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))).
% 0.11/0.37 cnf(i_0_19, plain, (X1=set_intersection2(X2,X3)|in(esk4_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X1))).
% 0.11/0.37 cnf(i_0_9, plain, (X1=set_union2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))).
% 0.11/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.37 # Begin printing tableau
% 0.11/0.37 # Found 6 steps
% 0.11/0.37 cnf(i_0_39, negated_conjecture, (subset(esk7_0,esk8_0)), inference(start_rule)).
% 0.11/0.37 cnf(i_0_64, plain, (subset(esk7_0,esk8_0)), inference(extension_rule, [i_0_53])).
% 0.11/0.37 cnf(i_0_189, plain, (~subset(empty_set,esk8_0)), inference(closure_rule, [i_0_42])).
% 0.11/0.37 cnf(i_0_188, plain, (subset(set_union2(esk7_0,empty_set),esk8_0)), inference(extension_rule, [i_0_4])).
% 0.11/0.37 cnf(i_0_253, plain, (set_union2(esk7_0,empty_set)=esk8_0), inference(etableau_closure_rule, [i_0_253, ...])).
% 0.11/0.37 cnf(i_0_255, plain, (~subset(esk8_0,set_union2(esk7_0,empty_set))), inference(etableau_closure_rule, [i_0_255, ...])).
% 0.11/0.37 # End printing tableau
% 0.11/0.37 # SZS output end
% 0.11/0.37 # Branches closed with saturation will be marked with an "s"
% 0.11/0.37 # Child (5241) has found a proof.
% 0.11/0.37
% 0.11/0.37 # Proof search is over...
% 0.11/0.37 # Freeing feature tree
%------------------------------------------------------------------------------