TSTP Solution File: SEU013+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU013+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 : n018.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:28 EDT 2022
% Result : Theorem 192.77s 24.59s
% Output : CNFRefutation 192.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU013+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % 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 : n018.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 23:59:18 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 61 Number of unprocessed: 57
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 57 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 7 conjectures.
% 0.19/0.37 # There are 7 start rule candidates:
% 0.19/0.37 # Found 25 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 7 start rule tableaux created.
% 0.19/0.37 # 32 extension rule candidate clauses
% 0.19/0.37 # 25 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 7
% 0.19/0.37 # Returning from population with 31 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 31 tableaux to operate on
% 192.77/24.59 # There were 68 total branch saturation attempts.
% 192.77/24.59 # There were 5 of these attempts blocked.
% 192.77/24.59 # There were 0 deferred branch saturation attempts.
% 192.77/24.59 # There were 1 free duplicated saturations.
% 192.77/24.59 # There were 24 total successful branch saturations.
% 192.77/24.59 # There were 0 successful branch saturations in interreduction.
% 192.77/24.59 # There were 0 successful branch saturations on the branch.
% 192.77/24.59 # There were 23 successful branch saturations after the branch.
% 192.77/24.59 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 192.77/24.59 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 192.77/24.59 # Begin clausification derivation
% 192.77/24.59
% 192.77/24.59 # End clausification derivation
% 192.77/24.59 # Begin listing active clauses obtained from FOF to CNF conversion
% 192.77/24.59 cnf(i_0_55, negated_conjecture, (function(esk12_0))).
% 192.77/24.59 cnf(i_0_53, negated_conjecture, (function(esk13_0))).
% 192.77/24.59 cnf(i_0_56, negated_conjecture, (relation(esk12_0))).
% 192.77/24.59 cnf(i_0_54, negated_conjecture, (relation(esk13_0))).
% 192.77/24.59 cnf(i_0_52, negated_conjecture, (one_to_one(esk12_0))).
% 192.77/24.59 cnf(i_0_15, plain, (empty(empty_set))).
% 192.77/24.59 cnf(i_0_51, negated_conjecture, (one_to_one(esk13_0))).
% 192.77/24.59 cnf(i_0_27, plain, (function(esk4_0))).
% 192.77/24.59 cnf(i_0_14, plain, (relation(empty_set))).
% 192.77/24.59 cnf(i_0_28, plain, (relation(esk4_0))).
% 192.77/24.59 cnf(i_0_29, plain, (relation(esk5_0))).
% 192.77/24.59 cnf(i_0_30, plain, (empty(esk5_0))).
% 192.77/24.59 cnf(i_0_33, plain, (empty(esk7_0))).
% 192.77/24.59 cnf(i_0_34, plain, (relation(esk8_0))).
% 192.77/24.59 cnf(i_0_40, plain, (relation(esk11_0))).
% 192.77/24.59 cnf(i_0_13, plain, (relation_empty_yielding(empty_set))).
% 192.77/24.59 cnf(i_0_39, plain, (relation_empty_yielding(esk11_0))).
% 192.77/24.59 cnf(i_0_36, plain, (empty(esk9_1(X1)))).
% 192.77/24.59 cnf(i_0_41, plain, (subset(X1,X1))).
% 192.77/24.59 cnf(i_0_10, plain, (element(esk3_1(X1),X1))).
% 192.77/24.59 cnf(i_0_37, plain, (element(esk9_1(X1),powerset(X1)))).
% 192.77/24.59 cnf(i_0_35, plain, (~empty(esk8_0))).
% 192.77/24.59 cnf(i_0_38, plain, (~empty(esk10_0))).
% 192.77/24.59 cnf(i_0_18, plain, (~empty(powerset(X1)))).
% 192.77/24.59 cnf(i_0_50, negated_conjecture, (~one_to_one(relation_composition(esk12_0,esk13_0)))).
% 192.77/24.59 cnf(i_0_60, plain, (~empty(X1)|~in(X2,X1))).
% 192.77/24.59 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 192.77/24.59 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 192.77/24.59 cnf(i_0_59, plain, (X1=empty_set|~empty(X1))).
% 192.77/24.59 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 192.77/24.59 cnf(i_0_31, plain, (empty(X1)|~empty(esk6_1(X1)))).
% 192.77/24.59 cnf(i_0_42, plain, (element(X1,X2)|~in(X1,X2))).
% 192.77/24.59 cnf(i_0_23, plain, (relation(relation_dom(X1))|~empty(X1))).
% 192.77/24.59 cnf(i_0_9, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 192.77/24.59 cnf(i_0_11, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 192.77/24.59 cnf(i_0_25, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 192.77/24.59 cnf(i_0_61, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 192.77/24.59 cnf(i_0_24, plain, (empty(relation_dom(X1))|~empty(X1))).
% 192.77/24.59 cnf(i_0_22, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 192.77/24.59 cnf(i_0_49, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 192.77/24.59 cnf(i_0_58, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 192.77/24.59 cnf(i_0_4, plain, (one_to_one(X1)|esk2_1(X1)!=esk1_1(X1)|~relation(X1)|~function(X1))).
% 192.77/24.59 cnf(i_0_16, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))).
% 192.77/24.59 cnf(i_0_12, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 192.77/24.59 cnf(i_0_26, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 192.77/24.59 cnf(i_0_32, plain, (element(esk6_1(X1),powerset(X1))|empty(X1))).
% 192.77/24.59 cnf(i_0_48, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 192.77/24.59 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 192.77/24.59 cnf(i_0_57, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 192.77/24.59 cnf(i_0_7, plain, (one_to_one(X1)|in(esk1_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))).
% 192.77/24.59 cnf(i_0_6, plain, (one_to_one(X1)|in(esk2_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))).
% 192.77/24.59 cnf(i_0_5, plain, (apply(X1,esk2_1(X1))=apply(X1,esk1_1(X1))|one_to_one(X1)|~relation(X1)|~function(X1))).
% 192.77/24.59 cnf(i_0_45, plain, (in(X1,relation_dom(X2))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(X1,relation_dom(relation_composition(X2,X3))))).
% 192.77/24.59 cnf(i_0_44, plain, (in(apply(X1,X2),relation_dom(X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1)|~in(X2,relation_dom(relation_composition(X1,X3))))).
% 192.77/24.59 cnf(i_0_46, plain, (apply(relation_composition(X1,X2),X3)=apply(X2,apply(X1,X3))|~relation(X1)|~relation(X2)|~function(X1)|~function(X2)|~in(X3,relation_dom(relation_composition(X1,X2))))).
% 192.77/24.59 cnf(i_0_43, plain, (in(X1,relation_dom(relation_composition(X2,X3)))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(apply(X2,X1),relation_dom(X3))|~in(X1,relation_dom(X2)))).
% 192.77/24.59 cnf(i_0_8, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~one_to_one(X3)|~relation(X3)|~function(X3)|~in(X2,relation_dom(X3))|~in(X1,relation_dom(X3)))).
% 192.77/24.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 192.77/24.59 # Begin printing tableau
% 192.77/24.59 # Found 26 steps
% 192.77/24.59 cnf(i_0_50, negated_conjecture, (~one_to_one(relation_composition(esk12_0,esk13_0))), inference(start_rule)).
% 192.77/24.59 cnf(i_0_62, plain, (~one_to_one(relation_composition(esk12_0,esk13_0))), inference(extension_rule, [i_0_6])).
% 192.77/24.59 cnf(i_0_139, plain, (~function(relation_composition(esk12_0,esk13_0))), inference(extension_rule, [i_0_16])).
% 192.77/24.59 cnf(i_0_3083973, plain, (~relation(esk13_0)), inference(closure_rule, [i_0_54])).
% 192.77/24.59 cnf(i_0_3083974, plain, (~relation(esk12_0)), inference(closure_rule, [i_0_56])).
% 192.77/24.59 cnf(i_0_3083975, plain, (~function(esk13_0)), inference(closure_rule, [i_0_53])).
% 192.77/24.59 cnf(i_0_3083976, plain, (~function(esk12_0)), inference(closure_rule, [i_0_55])).
% 192.77/24.59 cnf(i_0_138, plain, (~relation(relation_composition(esk12_0,esk13_0))), inference(extension_rule, [i_0_25])).
% 192.77/24.59 cnf(i_0_3084014, plain, (~relation(esk13_0)), inference(closure_rule, [i_0_54])).
% 192.77/24.59 cnf(i_0_3084015, plain, (~empty(esk12_0)), inference(extension_rule, [i_0_32])).
% 192.77/24.59 cnf(i_0_3084064, plain, (element(esk6_1(esk12_0),powerset(esk12_0))), inference(extension_rule, [i_0_47])).
% 192.77/24.59 cnf(i_0_3084254, plain, (empty(powerset(esk12_0))), inference(closure_rule, [i_0_18])).
% 192.77/24.59 cnf(i_0_3084255, plain, (in(esk6_1(esk12_0),powerset(esk12_0))), inference(extension_rule, [i_0_1])).
% 192.77/24.59 cnf(i_0_3084258, plain, (~in(powerset(esk12_0),esk6_1(esk12_0))), inference(extension_rule, [i_0_47])).
% 192.77/24.59 cnf(i_0_3084361, plain, (empty(esk6_1(esk12_0))), inference(extension_rule, [i_0_58])).
% 192.77/24.59 cnf(i_0_3118936, plain, (~element(esk3_1(powerset(esk6_1(esk12_0))),powerset(esk6_1(esk12_0)))), inference(closure_rule, [i_0_10])).
% 192.77/24.59 cnf(i_0_3084363, plain, (~element(powerset(esk12_0),esk6_1(esk12_0))), inference(extension_rule, [i_0_57])).
% 192.77/24.59 cnf(i_0_3119024, plain, (~element(esk3_1(powerset(esk6_1(esk12_0))),powerset(esk6_1(esk12_0)))), inference(closure_rule, [i_0_10])).
% 192.77/24.59 cnf(i_0_137, plain, (in(esk2_1(relation_composition(esk12_0,esk13_0)),relation_dom(relation_composition(esk12_0,esk13_0)))), inference(extension_rule, [i_0_46])).
% 192.77/24.59 cnf(i_0_3119042, plain, (~relation(esk12_0)), inference(closure_rule, [i_0_56])).
% 192.77/24.59 cnf(i_0_3119043, plain, (~relation(esk13_0)), inference(closure_rule, [i_0_54])).
% 192.77/24.59 cnf(i_0_3119044, plain, (~function(esk12_0)), inference(closure_rule, [i_0_55])).
% 192.77/24.59 cnf(i_0_3119045, plain, (~function(esk13_0)), inference(closure_rule, [i_0_53])).
% 192.77/24.59 cnf(i_0_3118938, plain, (~in(X6,esk3_1(powerset(esk6_1(esk12_0))))), inference(etableau_closure_rule, [i_0_3118938, ...])).
% 192.77/24.59 cnf(i_0_3119025, plain, (~in(powerset(esk12_0),esk3_1(powerset(esk6_1(esk12_0))))), inference(etableau_closure_rule, [i_0_3119025, ...])).
% 192.77/24.59 cnf(i_0_3119041, plain, (apply(relation_composition(esk12_0,esk13_0),esk2_1(relation_composition(esk12_0,esk13_0)))=apply(esk13_0,apply(esk12_0,esk2_1(relation_composition(esk12_0,esk13_0))))), inference(etableau_closure_rule, [i_0_3119041, ...])).
% 192.77/24.59 # End printing tableau
% 192.77/24.59 # SZS output end
% 192.77/24.59 # Branches closed with saturation will be marked with an "s"
% 192.77/24.60 # Child (30033) has found a proof.
% 192.77/24.60
% 192.77/24.60 # Proof search is over...
% 192.77/24.60 # Freeing feature tree
%------------------------------------------------------------------------------