TSTP Solution File: SEU304+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU304+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 : n032.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:41 EDT 2022
% Result : Theorem 0.10s 0.31s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEU304+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Sun Jun 19 18:21:03 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.29 # No SInE strategy applied
% 0.10/0.29 # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 0.10/0.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.10/0.29 #
% 0.10/0.29 # Number of axioms: 65 Number of unprocessed: 65
% 0.10/0.29 # Tableaux proof search.
% 0.10/0.29 # APR header successfully linked.
% 0.10/0.29 # Hello from C++
% 0.10/0.30 # The folding up rule is enabled...
% 0.10/0.30 # Local unification is enabled...
% 0.10/0.30 # Any saturation attempts will use folding labels...
% 0.10/0.30 # 65 beginning clauses after preprocessing and clausification
% 0.10/0.30 # Creating start rules for all 7 conjectures.
% 0.10/0.30 # There are 7 start rule candidates:
% 0.10/0.30 # Found 21 unit axioms.
% 0.10/0.30 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.10/0.30 # 7 start rule tableaux created.
% 0.10/0.30 # 44 extension rule candidate clauses
% 0.10/0.30 # 21 unit axiom clauses
% 0.10/0.30
% 0.10/0.30 # Requested 8, 32 cores available to the main process.
% 0.10/0.30 # There are not enough tableaux to fork, creating more from the initial 7
% 0.10/0.30 # Returning from population with 31 new_tableaux and 0 remaining starting tableaux.
% 0.10/0.30 # We now have 31 tableaux to operate on
% 0.10/0.31 # There were 2 total branch saturation attempts.
% 0.10/0.31 # There were 0 of these attempts blocked.
% 0.10/0.31 # There were 0 deferred branch saturation attempts.
% 0.10/0.31 # There were 0 free duplicated saturations.
% 0.10/0.31 # There were 2 total successful branch saturations.
% 0.10/0.31 # There were 0 successful branch saturations in interreduction.
% 0.10/0.31 # There were 0 successful branch saturations on the branch.
% 0.10/0.31 # There were 2 successful branch saturations after the branch.
% 0.10/0.31 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.31 # Begin clausification derivation
% 0.10/0.31
% 0.10/0.31 # End clausification derivation
% 0.10/0.31 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.31 cnf(i_0_64, negated_conjecture, (meet_commutative(esk12_0))).
% 0.10/0.31 cnf(i_0_37, plain, (meet_semilatt_str(esk3_0))).
% 0.10/0.31 cnf(i_0_39, plain, (join_semilatt_str(esk5_0))).
% 0.10/0.31 cnf(i_0_40, plain, (latt_str(esk6_0))).
% 0.10/0.31 cnf(i_0_62, negated_conjecture, (latt_str(esk12_0))).
% 0.10/0.31 cnf(i_0_63, negated_conjecture, (meet_absorbing(esk12_0))).
% 0.10/0.31 cnf(i_0_38, plain, (one_sorted_str(esk4_0))).
% 0.10/0.31 cnf(i_0_50, plain, (one_sorted_str(esk10_0))).
% 0.10/0.31 cnf(i_0_49, plain, (~empty_carrier(esk10_0))).
% 0.10/0.31 cnf(i_0_65, negated_conjecture, (~empty_carrier(esk12_0))).
% 0.10/0.31 cnf(i_0_71, plain, (X1=empty_set|~empty(X1))).
% 0.10/0.31 cnf(i_0_44, plain, (preboolean(powerset(X1)))).
% 0.10/0.31 cnf(i_0_46, plain, (cup_closed(powerset(X1)))).
% 0.10/0.31 cnf(i_0_45, plain, (diff_closed(powerset(X1)))).
% 0.10/0.31 cnf(i_0_3, plain, (cup_closed(X1)|~preboolean(X1))).
% 0.10/0.31 cnf(i_0_2, plain, (diff_closed(X1)|~preboolean(X1))).
% 0.10/0.31 cnf(i_0_26, plain, (meet_semilatt_str(X1)|~latt_str(X1))).
% 0.10/0.31 cnf(i_0_25, plain, (join_semilatt_str(X1)|~latt_str(X1))).
% 0.10/0.31 cnf(i_0_22, plain, (one_sorted_str(X1)|~meet_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_24, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_57, plain, (subset(X1,X1))).
% 0.10/0.31 cnf(i_0_61, negated_conjecture, (element(esk13_0,the_carrier(esk12_0)))).
% 0.10/0.31 cnf(i_0_60, negated_conjecture, (element(esk14_0,the_carrier(esk12_0)))).
% 0.10/0.31 cnf(i_0_73, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.10/0.31 cnf(i_0_47, plain, (~empty(powerset(X1)))).
% 0.10/0.31 cnf(i_0_36, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_32, plain, (function(the_L_meet(X1))|~meet_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_4, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))).
% 0.10/0.31 cnf(i_0_42, plain, (element(esk8_1(X1),X1))).
% 0.10/0.31 cnf(i_0_48, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_51, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk11_1(X1)))).
% 0.10/0.31 cnf(i_0_72, plain, (~empty(X2)|~in(X1,X2))).
% 0.10/0.31 cnf(i_0_58, plain, (element(X1,X2)|~in(X1,X2))).
% 0.10/0.31 cnf(i_0_66, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.10/0.31 cnf(i_0_12, plain, (empty_carrier(X1)|meet_absorbing(X1)|element(esk1_1(X1),the_carrier(X1))|~latt_str(X1))).
% 0.10/0.31 cnf(i_0_11, plain, (empty_carrier(X1)|meet_absorbing(X1)|element(esk2_1(X1),the_carrier(X1))|~latt_str(X1))).
% 0.10/0.31 cnf(i_0_67, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.10/0.31 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.10/0.31 cnf(i_0_68, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.10/0.31 cnf(i_0_52, plain, (empty_carrier(X1)|element(esk11_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.10/0.31 cnf(i_0_70, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.10/0.31 cnf(i_0_69, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.10/0.31 cnf(i_0_41, plain, (relation_of2(esk7_2(X1,X2),X1,X2))).
% 0.10/0.31 cnf(i_0_43, plain, (relation_of2_as_subset(esk9_2(X1,X2),X1,X2))).
% 0.10/0.31 cnf(i_0_35, plain, (quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_31, plain, (quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_34, plain, (relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_30, plain, (relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 0.10/0.31 cnf(i_0_56, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.10/0.31 cnf(i_0_55, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.10/0.31 cnf(i_0_29, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.10/0.31 cnf(i_0_5, plain, (meet_commut(X1,X2,X3)=meet_commut(X1,X3,X2)|empty_carrier(X1)|~meet_commutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_54, plain, (meet_commut(X1,X2,X3)=meet(X1,X2,X3)|empty_carrier(X1)|~meet_com# Creating equality axioms
% 0.10/0.31 # Ran out of tableaux, making start rules for all clauses
% 0.10/0.31 mutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_15, plain, (empty_carrier(X1)|element(join(X1,X2,X3),the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_19, plain, (empty_carrier(X1)|element(meet(X1,X2,X3),the_carrier(X1))|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_21, plain, (empty_carrier(X1)|element(meet_commut(X1,X2,X3),the_carrier(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_9, plain, (join(X1,X2,X3)=X3|empty_carrier(X1)|~join_semilatt_str(X1)|~below(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_8, plain, (empty_carrier(X1)|below(X1,X2,X3)|join(X1,X2,X3)!=X3|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_59, negated_conjecture, (~below(esk12_0,meet_commut(esk12_0,esk13_0,esk14_0),esk13_0))).
% 0.10/0.31 cnf(i_0_13, plain, (join(X1,meet(X1,X2,X3),X3)=X3|empty_carrier(X1)|~latt_str(X1)|~meet_absorbing(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_10, plain, (empty_carrier(X1)|meet_absorbing(X1)|join(X1,meet(X1,esk1_1(X1),esk2_1(X1)),esk2_1(X1))!=esk2_1(X1)|~latt_str(X1))).
% 0.10/0.31 cnf(i_0_6, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_7, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty_carrier(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.10/0.31 cnf(i_0_53, plain, (apply_binary_as_element(X1,X2,X4,X3,X5,X6)=apply_binary(X3,X5,X6)|empty(X2)|empty(X1)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.10/0.31 cnf(i_0_18, plain, (empty(X2)|empty(X1)|element(apply_binary_as_element(X1,X2,X4,X3,X5,X6),X4)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.10/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.10/0.31 # Begin printing tableau
% 0.10/0.31 # Found 5 steps
% 0.10/0.31 cnf(i_0_65, negated_conjecture, (~empty_carrier(esk12_0)), inference(start_rule)).
% 0.10/0.31 cnf(i_0_77, plain, (~empty_carrier(esk12_0)), inference(extension_rule, [i_0_48])).
% 0.10/0.31 cnf(i_0_406, plain, (~one_sorted_str(esk12_0)), inference(extension_rule, [i_0_22])).
% 0.10/0.31 cnf(i_0_407, plain, (~empty(the_carrier(esk12_0))), inference(etableau_closure_rule, [i_0_407, ...])).
% 0.10/0.31 cnf(i_0_419, plain, (~meet_semilatt_str(esk12_0)), inference(etableau_closure_rule, [i_0_419, ...])).
% 0.10/0.31 # End printing tableau
% 0.10/0.31 # SZS output end
% 0.10/0.31 # Branches closed with saturation will be marked with an "s"
% 0.10/0.31 # Child (7077) has found a proof.
% 0.10/0.31
% 0.10/0.31 # Proof search is over...
% 0.10/0.31 # Freeing feature tree
%------------------------------------------------------------------------------