%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU020+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 : 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:23:30 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU020+1 : TPTP v8.1.0. Released v3.2.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.34 % Computer : n005.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % 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 : Mon Jun 20 10:57:38 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: 62 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.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 57 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 6 conjectures. % 0.13/0.38 # There are 6 start rule candidates: % 0.13/0.38 # Found 29 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 6 start rule tableaux created. % 0.13/0.38 # 28 extension rule candidate clauses % 0.13/0.38 # 29 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.38 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 18 tableaux to operate on % 0.20/0.39 # There were 6 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 6 total successful branch saturations. % 0.20/0.39 # There were 5 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_55, negated_conjecture, (function(esk10_0))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (function(esk11_0))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (relation(esk10_0))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (relation(esk11_0))). % 0.20/0.39 cnf(i_0_11, plain, (empty(empty_set))). % 0.20/0.39 cnf(i_0_28, plain, (function(esk2_0))). % 0.20/0.39 cnf(i_0_10, plain, (relation(empty_set))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (relation_composition(esk10_0,esk11_0)=identity_relation(relation_dom(esk10_0)))). % 0.20/0.39 cnf(i_0_29, plain, (relation(esk2_0))). % 0.20/0.39 cnf(i_0_30, plain, (relation(esk3_0))). % 0.20/0.39 cnf(i_0_35, plain, (relation(esk6_0))). % 0.20/0.39 cnf(i_0_31, plain, (empty(esk3_0))). % 0.20/0.39 cnf(i_0_34, plain, (empty(esk5_0))). % 0.20/0.39 cnf(i_0_41, plain, (relation(esk9_0))). % 0.20/0.39 cnf(i_0_9, plain, (relation_empty_yielding(empty_set))). % 0.20/0.39 cnf(i_0_16, plain, (function(identity_relation(X1)))). % 0.20/0.39 cnf(i_0_5, plain, (relation(identity_relation(X1)))). % 0.20/0.39 cnf(i_0_50, plain, (one_to_one(identity_relation(X1)))). % 0.20/0.39 cnf(i_0_40, plain, (relation_empty_yielding(esk9_0))). % 0.20/0.39 cnf(i_0_60, plain, (relation_dom(identity_relation(X1))=X1)). % 0.20/0.39 cnf(i_0_42, plain, (subset(X1,X1))). % 0.20/0.39 cnf(i_0_59, plain, (relation_rng(identity_relation(X1))=X1)). % 0.20/0.39 cnf(i_0_37, plain, (empty(esk7_1(X1)))). % 0.20/0.39 cnf(i_0_6, plain, (element(esk1_1(X1),X1))). % 0.20/0.39 cnf(i_0_38, plain, (element(esk7_1(X1),powerset(X1)))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (~one_to_one(esk10_0))). % 0.20/0.39 cnf(i_0_36, plain, (~empty(esk6_0))). % 0.20/0.39 cnf(i_0_39, plain, (~empty(esk8_0))). % 0.20/0.39 cnf(i_0_14, plain, (~empty(powerset(X1)))). % 0.20/0.39 cnf(i_0_61, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.39 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.20/0.39 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 0.20/0.39 cnf(i_0_58, plain, (X1=empty_set|~empty(X1))). % 0.20/0.39 cnf(i_0_22, plain, (relation(relation_dom(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_23, plain, (empty(relation_dom(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_24, plain, (relation(relation_rng(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_62, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.39 cnf(i_0_32, plain, (empty(X1)|~empty(esk4_1(X1)))). % 0.20/0.39 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.39 cnf(i_0_20, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 0.20/0.39 cnf(i_0_25, plain, (empty(relation_rng(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_4, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))). % 0.20/0.39 cnf(i_0_7, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 0.20/0.39 cnf(i_0_26, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 0.20/0.39 cnf(i_0_21, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 0.20/0.39 cnf(i_0_46, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_47, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.39 cnf(i_0_57, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.20/0.39 cnf(i_0_45, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.39 cnf(i_0_8, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 0.20/0.39 cnf(i_0_27, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 0.20/0.39 cnf(i_0_12, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))). % 0.20/0.39 cnf(i_0_33, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))). % 0.20/0.39 cnf(i_0_48, plain, (one_to_one(X1)|~one_to_one(relation_composition(X1,X2))|~subset(relation_rng(X1),relation_dom(X2))|~relation(X1)|~relation(X2)|~function(X1)|~function(X2))). % 0.20/0.39 cnf(i_0_49, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.39 cnf(i_0_44, plain, (subset(relation_rng(X1),relation_dom(X2))|relation_dom(relation_composition(X1,X2))!=relation_dom(X1)|~relation(X1)|~relation(X2)|~function(X1)|~function(X2))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 14 steps % 0.20/0.39 cnf(i_0_54, negated_conjecture, (relation(esk11_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_65, plain, (relation(esk11_0)), inference(extension_rule, [i_0_48])). % 0.20/0.39 cnf(i_0_290, plain, (one_to_one(esk10_0)), inference(closure_rule, [i_0_51])). % 0.20/0.39 cnf(i_0_293, plain, (~relation(esk10_0)), inference(closure_rule, [i_0_56])). % 0.20/0.39 cnf(i_0_295, plain, (~function(esk10_0)), inference(closure_rule, [i_0_55])). % 0.20/0.39 cnf(i_0_296, plain, (~function(esk11_0)), inference(closure_rule, [i_0_53])). % 0.20/0.39 cnf(i_0_291, plain, (~one_to_one(relation_composition(esk10_0,esk11_0))), inference(extension_rule, [i_0_48])). % 0.20/0.39 cnf(i_0_373, plain, (~relation(empty_set)), inference(closure_rule, [i_0_10])). % 0.20/0.39 cnf(i_0_292, plain, (~subset(relation_rng(esk10_0),relation_dom(esk11_0))), inference(etableau_closure_rule, [i_0_292, ...])). % 0.20/0.39 cnf(i_0_370, plain, (~one_to_one(relation_composition(relation_composition(esk10_0,esk11_0),empty_set))), inference(etableau_closure_rule, [i_0_370, ...])). % 0.20/0.39 cnf(i_0_371, plain, (~subset(relation_rng(relation_composition(esk10_0,esk11_0)),relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_371, ...])). % 0.20/0.39 cnf(i_0_372, plain, (~relation(relation_composition(esk10_0,esk11_0))), inference(etableau_closure_rule, [i_0_372, ...])). % 0.20/0.39 cnf(i_0_374, plain, (~function(relation_composition(esk10_0,esk11_0))), inference(etableau_closure_rule, [i_0_374, ...])). % 0.20/0.39 cnf(i_0_375, plain, (~function(empty_set)), inference(etableau_closure_rule, [i_0_375, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (27737) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------