TSTP Solution File: SEU075+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU075+1 : TPTP v8.1.0. Released v3.2.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 : n013.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:43 EDT 2022
% Result : Theorem 5.72s 1.11s
% Output : CNFRefutation 5.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU075+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 08:04:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.36 #
% 0.18/0.36 # Number of axioms: 75 Number of unprocessed: 75
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 75 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 11 conjectures.
% 0.18/0.37 # There are 11 start rule candidates:
% 0.18/0.37 # Found 38 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 11 start rule tableaux created.
% 0.18/0.37 # 37 extension rule candidate clauses
% 0.18/0.37 # 38 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 5.72/1.11 # There were 2 total branch saturation attempts.
% 5.72/1.11 # There were 0 of these attempts blocked.
% 5.72/1.11 # There were 0 deferred branch saturation attempts.
% 5.72/1.11 # There were 0 free duplicated saturations.
% 5.72/1.11 # There were 2 total successful branch saturations.
% 5.72/1.11 # There were 0 successful branch saturations in interreduction.
% 5.72/1.11 # There were 0 successful branch saturations on the branch.
% 5.72/1.11 # There were 2 successful branch saturations after the branch.
% 5.72/1.11 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.72/1.11 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.72/1.11 # Begin clausification derivation
% 5.72/1.11
% 5.72/1.11 # End clausification derivation
% 5.72/1.11 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.72/1.11 cnf(i_0_55, negated_conjecture, (esk18_0!=esk17_0)).
% 5.72/1.11 cnf(i_0_59, negated_conjecture, (relation_rng(esk16_0)=esk15_0)).
% 5.72/1.11 cnf(i_0_58, negated_conjecture, (relation_dom(esk17_0)=esk15_0)).
% 5.72/1.11 cnf(i_0_57, negated_conjecture, (relation_dom(esk18_0)=esk15_0)).
% 5.72/1.11 cnf(i_0_19, plain, (empty(empty_set))).
% 5.72/1.11 cnf(i_0_23, plain, (empty(empty_set))).
% 5.72/1.11 cnf(i_0_25, plain, (empty(empty_set))).
% 5.72/1.11 cnf(i_0_37, plain, (empty(esk6_0))).
% 5.72/1.11 cnf(i_0_40, plain, (empty(esk8_0))).
% 5.72/1.11 cnf(i_0_42, plain, (empty(esk9_0))).
% 5.72/1.11 cnf(i_0_34, plain, (function(esk5_0))).
% 5.72/1.11 cnf(i_0_41, plain, (function(esk9_0))).
% 5.72/1.11 cnf(i_0_50, plain, (function(esk13_0))).
% 5.72/1.11 cnf(i_0_64, negated_conjecture, (function(esk16_0))).
% 5.72/1.11 cnf(i_0_62, negated_conjecture, (function(esk17_0))).
% 5.72/1.11 cnf(i_0_60, negated_conjecture, (function(esk18_0))).
% 5.72/1.11 cnf(i_0_18, plain, (relation(empty_set))).
% 5.72/1.11 cnf(i_0_24, plain, (relation(empty_set))).
% 5.72/1.11 cnf(i_0_35, plain, (relation(esk5_0))).
% 5.72/1.11 cnf(i_0_36, plain, (relation(esk6_0))).
% 5.72/1.11 cnf(i_0_43, plain, (relation(esk9_0))).
% 5.72/1.11 cnf(i_0_44, plain, (relation(esk10_0))).
% 5.72/1.11 cnf(i_0_51, plain, (relation(esk13_0))).
% 5.72/1.11 cnf(i_0_53, plain, (relation(esk14_0))).
% 5.72/1.11 cnf(i_0_65, negated_conjecture, (relation(esk16_0))).
% 5.72/1.11 cnf(i_0_63, negated_conjecture, (relation(esk17_0))).
% 5.72/1.11 cnf(i_0_61, negated_conjecture, (relation(esk18_0))).
% 5.72/1.11 cnf(i_0_49, plain, (one_to_one(esk13_0))).
% 5.72/1.11 cnf(i_0_17, plain, (relation_empty_yielding(empty_set))).
% 5.72/1.11 cnf(i_0_52, plain, (relation_empty_yielding(esk14_0))).
% 5.72/1.11 cnf(i_0_45, plain, (~empty(esk10_0))).
% 5.72/1.11 cnf(i_0_48, plain, (~empty(esk12_0))).
% 5.72/1.11 cnf(i_0_73, plain, (X1=empty_set|~empty(X1))).
% 5.72/1.11 cnf(i_0_46, plain, (empty(esk11_1(X1)))).
% 5.72/1.11 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 5.72/1.11 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 5.72/1.11 cnf(i_0_54, plain, (subset(X1,X1))).
% 5.72/1.11 cnf(i_0_75, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 5.72/1.11 cnf(i_0_22, plain, (~empty(powerset(X1)))).
% 5.72/1.11 cnf(i_0_31, plain, (empty(relation_rng(X1))|~empty(X1))).
% 5.72/1.11 cnf(i_0_29, plain, (empty(relation_dom(X1))|~empty(X1))).
% 5.72/1.11 cnf(i_0_30, plain, (relation(relation_rng(X1))|~empty(X1))).
% 5.72/1.11 cnf(i_0_28, plain, (relation(relation_dom(X1))|~empty(X1))).
% 5.72/1.11 cnf(i_0_14, plain, (element(esk4_1(X1),X1))).
% 5.72/1.11 cnf(i_0_38, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 5.72/1.11 cnf(i_0_56, negated_conjecture, (relation_composition(esk16_0,esk18_0)=relation_composition(esk16_0,esk17_0))).
% 5.72/1.11 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 5.72/1.11 cnf(i_0_47, plain, (element(esk11_1(X1),powerset(X1)))).
% 5.72/1.11 cnf(i_0_27, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 5.72/1.11 cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 5.72/1.11 cnf(i_0_74, plain, (~empty(X2)|~in(X1,X2))).
% 5.72/1.11 cnf(i_0_39, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 5.72/1.11 cnf(i_0_66, plain, (element(X1,X2)|~in(X1,X2))).
% 5.72/1.11 cnf(i_0_68, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 5.72/1.11 cnf(i_0_69, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 5.72/1.11 cnf(i_0_16, plain, (empty(relation_composition(X1,X2))|~empty(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_33, plain, (empty(relation_composition(X1,X2))|~empty(X1)|~relation(X2))).
% 5.72/1.11 cnf(i_0_15, plain, (relation(relation_composition(X1,X2))|~empty(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_32, plain, (relation(relation_composition(X1,X2))|~empty(X1)|~relation(X2))).
% 5.72/1.11 cnf(i_0_13, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 5.72/1.11 cnf(i_0_70, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 5.72/1.11 cnf(i_0_20, plain, (function(relation_composition(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_21, plain, (relation(relation_composition(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_72, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 5.72/1.11 cnf(i_0_71, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 5.72/1.11 cnf(i_0_77, plain, (X1=X2|in(esk19_2(X1,X2),relation_dom(X1))|relation_dom(X1)!=relation_dom(X2)|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_10, plain, (in(X3,X4)|X4!=relation_rng(X2)|X3!=apply(X2,X1)|~function(X2)|~relation(X2)|~in(X1,relation_dom(X2)))).
% 5.72/1.11 cnf(i_0_8, plain, (X2=relation_rng(X1)|in(esk2_2(X1,X2),X2)|in(esk3_2(X1,X2),relation_dom(X1))|~function(X1)|~relation(X1))).
% 5.72/1.11 cnf(i_0_7, plain, (X2=relation_rng(X1)|apply(X1,esk3_2(X1,X2))=esk2_2(X1,X2)|in(esk2_2(X1,X2),X2)|~function(X1)|~relation(X1))).
% 5.72/1.11 cnf(i_0_67, plain, (apply(X2,apply(X1,X3))=apply(relation_composition(X1,X2),X3)|~function(X2)|~function(X1)|~relation(X2)|~relation(X1)|~in(X3,relation_dom(X1)))).
% 5.72/1.11 cnf(i_0_9, plain, (X2=relation_rng(X1)|esk2_2(X1,X2)!=apply(X1,X3)|~function(X1)|~relation(X1)|~in(X3,relation_dom(X1))|~in(esk2_2(X1,X2),X2))).
% 5.72/1.11 cnf(i_0_11, plain, (apply(X2,esk1_3(X2,X3,X1))=X1|X3!=relation_rng(X2)|~function(X2)|~relation(X2)|~in(X1,X3))).
% 5.72/1.11 cnf(i_0_76, plain, (X1=X2|relation_dom(X1)!=relation_dom(X2)|apply(X1,esk19_2(X1,X2))!=apply(X2,esk19_2(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 5.72/1.11 cnf(i_0_12, plain, (in(esk1_3(X1,X2,X3),relation_dom(X1))|X2!=relation_rng(X1)|~function(X1)|~relation(X1)|~in(X3,X2))).
% 5.72/1.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.72/1.11 # Begin printing tableau
% 5.72/1.11 # Found 10 steps
% 5.72/1.11 cnf(i_0_64, negated_conjecture, (function(esk16_0)), inference(start_rule)).
% 5.72/1.11 cnf(i_0_84, plain, (function(esk16_0)), inference(extension_rule, [i_0_20])).
% 5.72/1.11 cnf(i_0_423, plain, (~function(esk5_0)), inference(closure_rule, [i_0_34])).
% 5.72/1.11 cnf(i_0_424, plain, (~relation(esk16_0)), inference(closure_rule, [i_0_65])).
% 5.72/1.11 cnf(i_0_425, plain, (~relation(esk5_0)), inference(closure_rule, [i_0_35])).
% 5.72/1.11 cnf(i_0_421, plain, (function(relation_composition(esk5_0,esk16_0))), inference(extension_rule, [i_0_21])).
% 5.72/1.11 cnf(i_0_483, plain, (~function(esk5_0)), inference(closure_rule, [i_0_34])).
% 5.72/1.11 cnf(i_0_485, plain, (~relation(esk5_0)), inference(closure_rule, [i_0_35])).
% 5.72/1.11 cnf(i_0_481, plain, (relation(relation_composition(esk5_0,relation_composition(esk5_0,esk16_0)))), inference(etableau_closure_rule, [i_0_481, ...])).
% 5.72/1.11 cnf(i_0_484, plain, (~relation(relation_composition(esk5_0,esk16_0))), inference(etableau_closure_rule, [i_0_484, ...])).
% 5.72/1.11 # End printing tableau
% 5.72/1.11 # SZS output end
% 5.72/1.11 # Branches closed with saturation will be marked with an "s"
% 5.72/1.11 # Child (25509) has found a proof.
% 5.72/1.11
% 5.72/1.11 # Proof search is over...
% 5.72/1.11 # Freeing feature tree
%------------------------------------------------------------------------------