TSTP Solution File: SEU342+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU342+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 : n024.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:26:01 EDT 2022
% Result : Theorem 12.77s 1.98s
% Output : CNFRefutation 12.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU342+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 04:18:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.12/0.37 # and selection function SelectComplexG.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 55 Number of unprocessed: 55
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 55 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 7 conjectures.
% 0.12/0.37 # There are 7 start rule candidates:
% 0.12/0.37 # Found 18 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 7 start rule tableaux created.
% 0.12/0.37 # 37 extension rule candidate clauses
% 0.12/0.37 # 18 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 7
% 0.12/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 13 tableaux to operate on
% 12.77/1.98 # There were 2 total branch saturation attempts.
% 12.77/1.98 # There were 0 of these attempts blocked.
% 12.77/1.98 # There were 0 deferred branch saturation attempts.
% 12.77/1.98 # There were 0 free duplicated saturations.
% 12.77/1.98 # There were 2 total successful branch saturations.
% 12.77/1.98 # There were 0 successful branch saturations in interreduction.
% 12.77/1.98 # There were 0 successful branch saturations on the branch.
% 12.77/1.98 # There were 2 successful branch saturations after the branch.
% 12.77/1.98 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.77/1.98 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.77/1.98 # Begin clausification derivation
% 12.77/1.98
% 12.77/1.98 # End clausification derivation
% 12.77/1.98 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.77/1.98 cnf(i_0_59, negated_conjecture, (latt_str(esk12_0))).
% 12.77/1.98 cnf(i_0_60, negated_conjecture, (lattice(esk12_0))).
% 12.77/1.98 cnf(i_0_58, negated_conjecture, (element(esk13_0,the_carrier(esk12_0)))).
% 12.77/1.98 cnf(i_0_57, negated_conjecture, (element(esk14_0,the_carrier(esk12_0)))).
% 12.77/1.98 cnf(i_0_31, plain, (latt_str(esk4_0))).
% 12.77/1.98 cnf(i_0_34, plain, (empty(empty_set))).
% 12.77/1.98 cnf(i_0_43, plain, (empty(esk8_0))).
% 12.77/1.98 cnf(i_0_28, plain, (meet_semilatt_str(esk1_0))).
% 12.77/1.98 cnf(i_0_29, plain, (one_sorted_str(esk2_0))).
% 12.77/1.98 cnf(i_0_46, plain, (one_sorted_str(esk10_0))).
% 12.77/1.98 cnf(i_0_30, plain, (join_semilatt_str(esk3_0))).
% 12.77/1.98 cnf(i_0_32, plain, (element(esk5_1(X1),X1))).
% 12.77/1.98 cnf(i_0_11, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 12.77/1.98 cnf(i_0_61, negated_conjecture, (~empty_carrier(esk12_0))).
% 12.77/1.98 cnf(i_0_45, plain, (~empty_carrier(esk10_0))).
% 12.77/1.98 cnf(i_0_44, plain, (~empty(esk9_0))).
% 12.77/1.98 cnf(i_0_35, plain, (~empty(singleton(X1)))).
% 12.77/1.98 cnf(i_0_36, plain, (~empty(unordered_pair(X1,X2)))).
% 12.77/1.98 cnf(i_0_56, negated_conjecture, (~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)))).
% 12.77/1.98 cnf(i_0_55, negated_conjecture, (below_refl(esk12_0,esk13_0,esk14_0)|in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)))).
% 12.77/1.98 cnf(i_0_25, plain, (meet_semilatt_str(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_65, plain, (~empty(X1)|~in(X2,X1))).
% 12.77/1.98 cnf(i_0_21, plain, (one_sorted_str(X1)|~meet_semilatt_str(X1))).
% 12.77/1.98 cnf(i_0_23, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 12.77/1.98 cnf(i_0_24, plain, (join_semilatt_str(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_64, plain, (X1=empty_set|~empty(X1))).
% 12.77/1.98 cnf(i_0_51, plain, (element(X1,X2)|~in(X1,X2))).
% 12.77/1.98 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 12.77/1.98 cnf(i_0_33, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 12.77/1.98 cnf(i_0_66, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 12.77/1.98 cnf(i_0_7, plain, (join_commutative(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_6, plain, (join_associative(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_5, plain, (meet_commutative(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_4, plain, (meet_associative(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_3, plain, (meet_absorbing(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_2, plain, (join_absorbing(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_20, plain, (relation(relation_of_lattice(X1))|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_13, plain, (relation_of_lattice(X1)=a_1_0_filter_1(X1)|empty_carrier(X1)|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_52, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 12.77/1.98 cnf(i_0_37, plain, (empty(X1)|empty(X2)|~empty(cartesian_product2(X1,X2)))).
% 12.77/1.98 cnf(i_0_54, plain, (X1=X2|~in(esk11_2(X1,X2),X2)|~in(esk11_2(X1,X2),X1))).
% 12.77/1.98 cnf(i_0_9, plain, (lattice(X1)|empty_carrier(X1)|~join_absorbing(X1)|~meet_absorbing(X1)|~meet_associative(X1)|~meet_commutative(X1)|~join_associative(X1)|~join_commutative(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_62, plain, (X1=X2|unordered_pair(unordered_pair(X3,X1),singleton(X3))!=unordered_pair(unordered_pair(X4,X2),singleton(X4)))).
% 12.77/1.98 cnf(i_0_63, plain, (X1=X2|unordered_pair(unordered_pair(X1,X3),singleton(X1))!=unordered_pair(unordered_pair(X2,X4),singleton(X2)))).
% 12.77/1.98 cnf(i_0_53, plain, (X1=X2|in(esk11_2(X1,X2),X1)|in(esk11_2(X1,X2),X2))).
% 12.77/1.98 cnf(i_0_42, plain, (element(esk6_2(X1,X2),the_carrier(X2))|empty_carrier(X2)|~lattice(X2)|~latt_str(X2)|~in(X1,a_1_0_filter_1(X2)))).
% 12.77/1.98 cnf(i_0_41, plain, (element(esk7_2(X1,X2),the_carrier(X2))|empty_carrier(X2)|~lattice(X2)|~latt_str(X2)|~in(X1,a_1_0_filter_1(X2)))).
% 12.77/1.98 cnf(i_0_50, plain, (below_refl(X1,X2,X2)|empty_carrier(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_absorbing(X1)|~meet_absorbing(X1)|~meet_commutative(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_39, plain, (below_refl(X1,esk6_2(X2,X1),esk7_2(X2,X1))|empty_carrier(X1)|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1)))).
% 12.77/1.98 cnf(i_0_48, plain, (below_refl(X1,X2,X3)|empty_carrier(X1)|~below(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_absorbing(X1)|~meet_absorbing(X1)|~meet_commutative(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_14, plain, (element(ordered_pair_as_product_element(X1,X2,X3,X4),cartesian_product2(X1,X2))|empty(X1)|empty(X2)|~element(X4,X2)|~element(X3,X1))).
% 12.77/1.98 cnf(i_0_49, plain, (below(X1,X2,X3)|empty_carrier(X1)|~below_refl(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_absorbing(X1)|~meet_absorbing(X1)|~meet_commutative(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_38, plain, (empty_carrier(X1)|in(X2,a_1_0_filter_1(X1))|X2!=ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X3,X4)|~below_refl(X1,X3,X4)|~element(X4,the_carrier(X1))|~element(X3,the_carrier(X1))|~lattice(X1)|~latt_str(X1))).
% 12.77/1.98 cnf(i_0_40, plain, (ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),esk6_2(X2,X1),esk7_2(X2,X1))=X2|empty_carrier(X1)|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1)))).
% 12.77/1.98 cnf(i_0_47, plain, (ordered_pair_as_product_element(X1,X2,X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3))|empty(X1)|empty(X2)|~element(X4,X2)|~element(X3,X1))).
% 12.77/1.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.77/1.98 # Begin printing tableau
% 12.77/1.98 # Found 5 steps
% 12.77/1.98 cnf(i_0_61, negated_conjecture, (~empty_carrier(esk12_0)), inference(start_rule)).
% 12.77/1.98 cnf(i_0_71, plain, (~empty_carrier(esk12_0)), inference(extension_rule, [i_0_33])).
% 12.77/1.98 cnf(i_0_681, plain, (~one_sorted_str(esk12_0)), inference(extension_rule, [i_0_21])).
% 12.77/1.98 cnf(i_0_682, plain, (~empty(the_carrier(esk12_0))), inference(etableau_closure_rule, [i_0_682, ...])).
% 12.77/1.98 cnf(i_0_688, plain, (~meet_semilatt_str(esk12_0)), inference(etableau_closure_rule, [i_0_688, ...])).
% 12.77/1.98 # End printing tableau
% 12.77/1.98 # SZS output end
% 12.77/1.98 # Branches closed with saturation will be marked with an "s"
% 12.77/1.99 # Child (27111) has found a proof.
% 12.77/1.99
% 12.77/1.99 # Proof search is over...
% 12.77/1.99 # Freeing feature tree
%------------------------------------------------------------------------------