%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU215+3 : 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 : n005.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:24:50 EDT 2022 % Result : Theorem 14.77s 2.24s % Output : CNFRefutation 14.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU215+3 : TPTP v8.1.0. Released v3.2.0. % 0.06/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 : n005.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 : Sun Jun 19 10:38:38 EDT 2022 % 0.13/0.33 % 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: 63 Number of unprocessed: 57 % 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 # 57 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 6 conjectures. % 0.13/0.37 # There are 6 start rule candidates: % 0.13/0.37 # Found 27 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 6 start rule tableaux created. % 0.13/0.37 # 30 extension rule candidate clauses % 0.13/0.37 # 27 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 16 tableaux to operate on % 14.77/2.24 # There were 6 total branch saturation attempts. % 14.77/2.24 # There were 0 of these attempts blocked. % 14.77/2.24 # There were 0 deferred branch saturation attempts. % 14.77/2.24 # There were 0 free duplicated saturations. % 14.77/2.24 # There were 4 total successful branch saturations. % 14.77/2.24 # There were 0 successful branch saturations in interreduction. % 14.77/2.24 # There were 0 successful branch saturations on the branch. % 14.77/2.24 # There were 4 successful branch saturations after the branch. % 14.77/2.24 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.77/2.24 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.77/2.24 # Begin clausification derivation % 14.77/2.24 % 14.77/2.24 # End clausification derivation % 14.77/2.24 # Begin listing active clauses obtained from FOF to CNF conversion % 14.77/2.24 cnf(i_0_55, negated_conjecture, (function(esk11_0))). % 14.77/2.24 cnf(i_0_53, negated_conjecture, (function(esk12_0))). % 14.77/2.24 cnf(i_0_56, negated_conjecture, (relation(esk11_0))). % 14.77/2.24 cnf(i_0_54, negated_conjecture, (relation(esk12_0))). % 14.77/2.24 cnf(i_0_52, negated_conjecture, (in(esk10_0,relation_dom(esk11_0)))). % 14.77/2.24 cnf(i_0_16, plain, (empty(empty_set))). % 14.77/2.24 cnf(i_0_31, plain, (function(esk2_0))). % 14.77/2.24 cnf(i_0_15, plain, (relation(empty_set))). % 14.77/2.24 cnf(i_0_32, plain, (relation(esk2_0))). % 14.77/2.24 cnf(i_0_33, plain, (relation(esk3_0))). % 14.77/2.24 cnf(i_0_38, plain, (relation(esk6_0))). % 14.77/2.24 cnf(i_0_34, plain, (empty(esk3_0))). % 14.77/2.24 cnf(i_0_44, plain, (relation(esk9_0))). % 14.77/2.24 cnf(i_0_37, plain, (empty(esk5_0))). % 14.77/2.24 cnf(i_0_14, plain, (relation_empty_yielding(empty_set))). % 14.77/2.24 cnf(i_0_43, plain, (relation_empty_yielding(esk9_0))). % 14.77/2.24 cnf(i_0_40, plain, (empty(esk7_1(X1)))). % 14.77/2.24 cnf(i_0_45, plain, (subset(X1,X1))). % 14.77/2.24 cnf(i_0_11, plain, (element(esk1_1(X1),X1))). % 14.77/2.24 cnf(i_0_41, plain, (element(esk7_1(X1),powerset(X1)))). % 14.77/2.24 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 14.77/2.24 cnf(i_0_39, plain, (~empty(esk6_0))). % 14.77/2.24 cnf(i_0_42, plain, (~empty(esk8_0))). % 14.77/2.24 cnf(i_0_22, plain, (~empty(singleton(X1)))). % 14.77/2.24 cnf(i_0_19, plain, (~empty(powerset(X1)))). % 14.77/2.24 cnf(i_0_51, negated_conjecture, (apply(relation_composition(esk11_0,esk12_0),esk10_0)!=apply(esk12_0,apply(esk11_0,esk10_0)))). % 14.77/2.24 cnf(i_0_23, plain, (~empty(unordered_pair(X1,X2)))). % 14.77/2.24 cnf(i_0_63, plain, (~empty(X1)|~in(X2,X1))). % 14.77/2.24 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 14.77/2.24 cnf(i_0_62, plain, (X1=empty_set|~empty(X1))). % 14.77/2.24 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 14.77/2.24 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 14.77/2.24 cnf(i_0_35, plain, (empty(X1)|~empty(esk4_1(X1)))). % 14.77/2.24 cnf(i_0_27, plain, (relation(relation_dom(X1))|~empty(X1))). % 14.77/2.24 cnf(i_0_28, plain, (empty(relation_dom(X1))|~empty(X1))). % 14.77/2.24 cnf(i_0_10, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))). % 14.77/2.24 cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 14.77/2.24 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))). % 14.77/2.24 cnf(i_0_64, plain, (X1=X2|~empty(X2)|~empty(X1))). % 14.77/2.24 cnf(i_0_59, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 14.77/2.24 cnf(i_0_61, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 14.77/2.24 cnf(i_0_58, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 14.77/2.24 cnf(i_0_12, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 14.77/2.24 cnf(i_0_29, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 14.77/2.24 cnf(i_0_17, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))). % 14.77/2.24 cnf(i_0_57, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 14.77/2.24 cnf(i_0_13, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 14.77/2.24 cnf(i_0_30, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 14.77/2.24 cnf(i_0_60, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 14.77/2.24 cnf(i_0_36, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))). % 14.77/2.24 cnf(i_0_6, plain, (apply(X1,X2)=empty_set|in(X2,relation_dom(X1))|~relation(X1)|~function(X1))). % 14.77/2.24 cnf(i_0_49, plain, (in(X1,relation_dom(X2))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(X1,relation_dom(relation_composition(X2,X3))))). % 14.77/2.24 cnf(i_0_48, plain, (in(apply(X1,X2),relation_dom(X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1)|~in(X2,relation_dom(relation_composition(X1,X3))))). % 14.77/2.24 cnf(i_0_47, 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)))). % 14.77/2.24 cnf(i_0_7, plain, (X1=apply(X2,X3)|~relation(X2)|~function(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2)|~in(X3,relation_dom(X2)))). % 14.77/2.24 cnf(i_0_50, 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))))). % 14.77/2.24 cnf(i_0_8, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X2,X1))),X2)|~relation(X2)|~function(X2)|~in(X1,relation_dom(X2)))). % 14.77/2.24 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 14.77/2.24 # Begin printing tableau % 14.77/2.24 # Found 10 steps % 14.77/2.24 cnf(i_0_51, negated_conjecture, (apply(relation_composition(esk11_0,esk12_0),esk10_0)!=apply(esk12_0,apply(esk11_0,esk10_0))), inference(start_rule)). % 14.77/2.24 cnf(i_0_68, plain, (apply(relation_composition(esk11_0,esk12_0),esk10_0)!=apply(esk12_0,apply(esk11_0,esk10_0))), inference(extension_rule, [i_0_50])). % 14.77/2.24 cnf(i_0_162, plain, (~relation(esk11_0)), inference(closure_rule, [i_0_56])). % 14.77/2.24 cnf(i_0_163, plain, (~relation(esk12_0)), inference(closure_rule, [i_0_54])). % 14.77/2.24 cnf(i_0_164, plain, (~function(esk11_0)), inference(closure_rule, [i_0_55])). % 14.77/2.24 cnf(i_0_165, plain, (~function(esk12_0)), inference(closure_rule, [i_0_53])). % 14.77/2.24 cnf(i_0_166, plain, (~in(esk10_0,relation_dom(relation_composition(esk11_0,esk12_0)))), inference(extension_rule, [i_0_6])). % 14.77/2.24 cnf(i_0_158725, plain, (apply(relation_composition(esk11_0,esk12_0),esk10_0)=empty_set), inference(etableau_closure_rule, [i_0_158725, ...])). % 14.77/2.24 cnf(i_0_158727, plain, (~relation(relation_composition(esk11_0,esk12_0))), inference(etableau_closure_rule, [i_0_158727, ...])). % 14.77/2.24 cnf(i_0_158728, plain, (~function(relation_composition(esk11_0,esk12_0))), inference(etableau_closure_rule, [i_0_158728, ...])). % 14.77/2.24 # End printing tableau % 14.77/2.24 # SZS output end % 14.77/2.24 # Branches closed with saturation will be marked with an "s" % 14.77/2.25 # Child (24502) has found a proof. % 14.77/2.25 % 14.77/2.25 # Proof search is over... % 14.77/2.25 # Freeing feature tree %------------------------------------------------------------------------------