TSTP Solution File: SEU362+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU362+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 : n008.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:12 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU362+1 : 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 : n008.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 00:34:07 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___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 53 Number of unprocessed: 53
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 53 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 10 conjectures.
% 0.13/0.37 # There are 10 start rule candidates:
% 0.13/0.37 # Found 21 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 10 start rule tableaux created.
% 0.13/0.37 # 32 extension rule candidate clauses
% 0.13/0.37 # 21 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.43 # There were 2 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 0 free duplicated saturations.
% 0.19/0.43 # There were 2 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 2 successful branch saturations after the branch.
% 0.19/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_52, negated_conjecture, (esk16_0=esk14_0)).
% 0.19/0.43 cnf(i_0_51, negated_conjecture, (esk15_0=esk17_0)).
% 0.19/0.43 cnf(i_0_58, negated_conjecture, (rel_str(esk12_0))).
% 0.19/0.43 cnf(i_0_57, negated_conjecture, (subrelstr(esk13_0,esk12_0))).
% 0.19/0.43 cnf(i_0_29, plain, (empty(empty_set))).
% 0.19/0.43 cnf(i_0_22, plain, (rel_str(esk1_0))).
% 0.19/0.43 cnf(i_0_32, plain, (empty(esk8_0))).
% 0.19/0.43 cnf(i_0_56, negated_conjecture, (element(esk14_0,the_carrier(esk12_0)))).
% 0.19/0.43 cnf(i_0_55, negated_conjecture, (element(esk17_0,the_carrier(esk12_0)))).
% 0.19/0.43 cnf(i_0_54, negated_conjecture, (element(esk14_0,the_carrier(esk13_0)))).
% 0.19/0.43 cnf(i_0_53, negated_conjecture, (element(esk17_0,the_carrier(esk13_0)))).
% 0.19/0.43 cnf(i_0_30, plain, (finite(esk7_0))).
% 0.19/0.43 cnf(i_0_23, plain, (one_sorted_str(esk2_0))).
% 0.19/0.43 cnf(i_0_42, plain, (subset(X1,X1))).
% 0.19/0.43 cnf(i_0_50, negated_conjecture, (related(esk13_0,esk14_0,esk17_0))).
% 0.19/0.43 cnf(i_0_25, plain, (element(esk4_1(X1),X1))).
% 0.19/0.43 cnf(i_0_27, plain, (relation_of2_as_subset(esk6_2(X1,X2),X1,X2))).
% 0.19/0.43 cnf(i_0_24, plain, (relation_of2(esk3_2(X1,X2),X1,X2))).
% 0.19/0.43 cnf(i_0_49, negated_conjecture, (~related(esk12_0,esk14_0,esk17_0))).
% 0.19/0.43 cnf(i_0_31, plain, (~empty(esk7_0))).
% 0.19/0.43 cnf(i_0_33, plain, (~empty(esk9_0))).
% 0.19/0.43 cnf(i_0_60, plain, (~empty(X1)|~in(X2,X1))).
% 0.19/0.43 cnf(i_0_14, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 0.19/0.43 cnf(i_0_2, plain, (finite(X1)|~empty(X1))).
% 0.19/0.43 cnf(i_0_59, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.43 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.43 cnf(i_0_18, plain, (rel_str(X1)|~subrelstr(X1,X2)|~rel_str(X2))).
% 0.19/0.43 cnf(i_0_35, plain, (empty(X1)|~empty(esk10_1(X1)))).
% 0.19/0.43 cnf(i_0_38, plain, (empty(X1)|~empty(esk11_1(X1)))).
% 0.19/0.43 cnf(i_0_34, plain, (finite(esk10_1(X1))|empty(X1))).
% 0.19/0.43 cnf(i_0_37, plain, (finite(esk11_1(X1))|empty(X1))).
% 0.19/0.43 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.43 cnf(i_0_46, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.19/0.43 cnf(i_0_4, plain, (finite(X1)|~element(X1,powerset(X2))|~finite(X2))).
% 0.19/0.43 cnf(i_0_48, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.19/0.43 cnf(i_0_26, plain, (subrelstr(esk5_1(X1),X1)|~rel_str(X1))).
% 0.19/0.43 cnf(i_0_45, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.19/0.43 cnf(i_0_61, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.43 cnf(i_0_3, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 0.19/0.43 cnf(i_0_44, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.19/0.43 cnf(i_0_36, plain, (element(esk10_1(X1),powerset(X1))|empty(X1))).
% 0.19/0.43 cnf(i_0_40, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.19/0.43 cnf(i_0_41, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.19/0.43 cnf(i_0_28, plain, (finite(cartesian_product2(X1,X2))|~finite(X2)|~finite(X1))).
% 0.19/0.43 cnf(i_0_39, plain, (element(esk11_1(X1),powerset(X1))|empty(X1))).
% 0.19/0.43 cnf(i_0_7, plain, (subset(the_carrier(X1),the_carrier(X2))|~subrelstr(X1,X2)|~rel_str(X2))).
% 0.19/0.43 cnf(i_0_20, plain, (relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1))).
% 0.19/0.43 cnf(i_0_47, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.19/0.43 cnf(i_0_5, plain, (subrelstr(X1,X2)|~subset(the_carrier(X1),the_carrier(X2))|~subset(the_InternalRel(X1),the_InternalRel(X2))|~rel_str(X2)|~rel_str(X1))).
% 0.19/0.43 cnf(i_0_6, plain, (subset(the_InternalRel(X1),the_InternalRel(X2))|~subrelstr(X1,X2)|~rel_str(X2))).
% 0.19/0.43 cnf(i_0_19, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.19/0.43 cnf(i_0_8, plain, (related(X1,X2,X3)|~rel_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~in(ordered_pair(X2,X3),the_InternalRel(X1)))).
% 0.19/0.43 cnf(i_0_9, plain, (in(ordered_pair(X1,X2),the_InternalRel(X3))|~related(X3,X1,X2)|~rel_str(X3)|~element(X2,the_carrier(X3))|~element(X1,the_carrier(X3)))).
% 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 7 steps
% 0.19/0.43 cnf(i_0_50, negated_conjecture, (related(esk13_0,esk14_0,esk17_0)), inference(start_rule)).
% 0.19/0.43 cnf(i_0_63, plain, (related(esk13_0,esk14_0,esk17_0)), inference(extension_rule, [i_0_9])).
% 0.19/0.43 cnf(i_0_152, plain, (~element(esk17_0,the_carrier(esk13_0))), inference(closure_rule, [i_0_53])).
% 0.19/0.43 cnf(i_0_153, plain, (~element(esk14_0,the_carrier(esk13_0))), inference(closure_rule, [i_0_54])).
% 0.19/0.43 cnf(i_0_149, plain, (in(ordered_pair(esk14_0,esk17_0),the_InternalRel(esk13_0))), inference(extension_rule, [i_0_60])).
% 0.19/0.43 cnf(i_0_151, plain, (~rel_str(esk13_0)), inference(etableau_closure_rule, [i_0_151, ...])).
% 0.19/0.43 cnf(i_0_154, plain, (~empty(the_InternalRel(esk13_0))), inference(etableau_closure_rule, [i_0_154, ...])).
% 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 # Child (6607) has found a proof.
% 0.19/0.43
% 0.19/0.43 # Proof search is over...
% 0.19/0.43 # Freeing feature tree
%------------------------------------------------------------------------------