TSTP Solution File: SEU128+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU128+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 : n012.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:00 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU128+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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 : n012.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 22:23:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.13/0.38 # and selection function SelectCQArNTNpEqFirst.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 54 Number of unprocessed: 52
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 52 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 17 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 35 extension rule candidate clauses
% 0.13/0.38 # 17 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 12 tableaux to operate on
% 0.21/0.53 # There were 1 total branch saturation attempts.
% 0.21/0.53 # There were 0 of these attempts blocked.
% 0.21/0.53 # There were 0 deferred branch saturation attempts.
% 0.21/0.53 # There were 0 free duplicated saturations.
% 0.21/0.53 # There were 1 total successful branch saturations.
% 0.21/0.53 # There were 0 successful branch saturations in interreduction.
% 0.21/0.53 # There were 0 successful branch saturations on the branch.
% 0.21/0.53 # There were 1 successful branch saturations after the branch.
% 0.21/0.53 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 # Begin clausification derivation
% 0.21/0.53
% 0.21/0.53 # End clausification derivation
% 0.21/0.53 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.53 cnf(i_0_42, negated_conjecture, (subset(esk7_0,esk8_0))).
% 0.21/0.53 cnf(i_0_41, negated_conjecture, (subset(esk7_0,esk9_0))).
% 0.21/0.53 cnf(i_0_29, plain, (empty(empty_set))).
% 0.21/0.53 cnf(i_0_34, plain, (empty(esk5_0))).
% 0.21/0.53 cnf(i_0_46, lemma, (subset(empty_set,X1))).
% 0.21/0.53 cnf(i_0_36, plain, (subset(X1,X1))).
% 0.21/0.53 cnf(i_0_45, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.21/0.53 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)).
% 0.21/0.53 cnf(i_0_43, plain, (set_union2(X1,empty_set)=X1)).
% 0.21/0.53 cnf(i_0_32, plain, (set_union2(X1,X1)=X1)).
% 0.21/0.53 cnf(i_0_39, lemma, (subset(set_intersection2(X1,X2),X1))).
% 0.21/0.53 cnf(i_0_55, lemma, (subset(X1,set_union2(X1,X2)))).
% 0.21/0.53 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.21/0.53 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.21/0.53 cnf(i_0_40, negated_conjecture, (~subset(esk7_0,set_intersection2(esk8_0,esk9_0)))).
% 0.21/0.53 cnf(i_0_35, plain, (~empty(esk6_0))).
% 0.21/0.53 cnf(i_0_8, plain, (~in(X1,empty_set))).
% 0.21/0.53 cnf(i_0_54, plain, (~empty(X1)|~in(X2,X1))).
% 0.21/0.53 cnf(i_0_53, plain, (X1=empty_set|~empty(X1))).
% 0.21/0.53 cnf(i_0_50, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 0.21/0.53 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.53 cnf(i_0_51, lemma, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))).
% 0.21/0.53 cnf(i_0_47, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 0.21/0.53 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.21/0.53 cnf(i_0_25, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.21/0.53 cnf(i_0_38, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.21/0.53 cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.21/0.53 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.21/0.53 cnf(i_0_30, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.21/0.53 cnf(i_0_24, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.21/0.53 cnf(i_0_37, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.21/0.53 cnf(i_0_17, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.21/0.53 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.21/0.53 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))).
% 0.21/0.53 cnf(i_0_44, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.21/0.53 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))).
% 0.21/0.53 cnf(i_0_48, lemma, (disjoint(X1,X2)|in(esk10_2(X1,X2),X2))).
% 0.21/0.53 cnf(i_0_22, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))).
% 0.21/0.53 cnf(i_0_49, lemma, (disjoint(X1,X2)|in(esk10_2(X1,X2),X1))).
% 0.21/0.53 cnf(i_0_57, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))).
% 0.21/0.53 cnf(i_0_12, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.21/0.53 cnf(i_0_13, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.21/0.53 cnf(i_0_23, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))).
% 0.21/0.53 cnf(i_0_52, lemma, (disjoint(X1,X2)|in(esk11_2(X1,X2),set_intersection2(X1,X2)))).
% 0.21/0.53 cnf(i_0_21, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))).
% 0.21/0.53 cnf(i_0_14, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.21/0.53 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.21/0.53 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.21/0.53 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.21/0.53 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.21/0.53 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.21/0.53 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.21/0.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.53 # Begin printing tableau
% 0.21/0.53 # Found 5 steps
% 0.21/0.53 cnf(i_0_41, negated_conjecture, (subset(esk7_0,esk9_0)), inference(start_rule)).
% 0.21/0.53 cnf(i_0_68, plain, (subset(esk7_0,esk9_0)), inference(extension_rule, [i_0_44])).
% 0.21/0.53 cnf(i_0_196, plain, (~subset(empty_set,esk7_0)), inference(closure_rule, [i_0_46])).
% 0.21/0.53 cnf(i_0_194, plain, (subset(empty_set,esk9_0)), inference(extension_rule, [i_0_38])).
% 0.21/0.53 cnf(i_0_259, plain, (set_union2(empty_set,esk9_0)=esk9_0), inference(etableau_closure_rule, [i_0_259, ...])).
% 0.21/0.53 # End printing tableau
% 0.21/0.53 # SZS output end
% 0.21/0.53 # Branches closed with saturation will be marked with an "s"
% 0.21/0.53 # Child (25897) has found a proof.
% 0.21/0.53
% 0.21/0.53 # Proof search is over...
% 0.21/0.53 # Freeing feature tree
%------------------------------------------------------------------------------