%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU028+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 : n014.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:32 EDT 2022 % Result : Theorem 5.70s 1.09s % Output : CNFRefutation 5.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU028+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/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 : n014.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 09:22:32 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.20/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 76 Number of unprocessed: 71 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 71 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 4 conjectures. % 0.20/0.38 # There are 4 start rule candidates: % 0.20/0.38 # Found 30 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 4 start rule tableaux created. % 0.20/0.38 # 41 extension rule candidate clauses % 0.20/0.38 # 30 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 4 % 0.20/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 12 tableaux to operate on % 5.70/1.08 # There were 4 total branch saturation attempts. % 5.70/1.08 # There were 0 of these attempts blocked. % 5.70/1.08 # There were 0 deferred branch saturation attempts. % 5.70/1.08 # There were 0 free duplicated saturations. % 5.70/1.08 # There were 4 total successful branch saturations. % 5.70/1.08 # There were 0 successful branch saturations in interreduction. % 5.70/1.08 # There were 0 successful branch saturations on the branch. % 5.70/1.08 # There were 4 successful branch saturations after the branch. % 5.70/1.09 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.70/1.09 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.70/1.09 # Begin clausification derivation % 5.70/1.09 % 5.70/1.09 # End clausification derivation % 5.70/1.09 # Begin listing active clauses obtained from FOF to CNF conversion % 5.70/1.09 cnf(i_0_74, negated_conjecture, (function(esk13_0))). % 5.70/1.09 cnf(i_0_75, negated_conjecture, (relation(esk13_0))). % 5.70/1.09 cnf(i_0_73, negated_conjecture, (one_to_one(esk13_0))). % 5.70/1.09 cnf(i_0_33, plain, (function(esk2_0))). % 5.70/1.09 cnf(i_0_16, plain, (empty(empty_set))). % 5.70/1.09 cnf(i_0_40, plain, (function(esk6_0))). % 5.70/1.09 cnf(i_0_49, plain, (function(esk10_0))). % 5.70/1.09 cnf(i_0_15, plain, (relation(empty_set))). % 5.70/1.09 cnf(i_0_34, plain, (relation(esk2_0))). % 5.70/1.09 cnf(i_0_35, plain, (relation(esk3_0))). % 5.70/1.09 cnf(i_0_42, plain, (relation(esk6_0))). % 5.70/1.09 cnf(i_0_36, plain, (empty(esk3_0))). % 5.70/1.09 cnf(i_0_39, plain, (empty(esk5_0))). % 5.70/1.09 cnf(i_0_41, plain, (empty(esk6_0))). % 5.70/1.09 cnf(i_0_43, plain, (relation(esk7_0))). % 5.70/1.09 cnf(i_0_50, plain, (relation(esk10_0))). % 5.70/1.09 cnf(i_0_52, plain, (relation(esk11_0))). % 5.70/1.09 cnf(i_0_48, plain, (one_to_one(esk10_0))). % 5.70/1.09 cnf(i_0_21, plain, (function(identity_relation(X1)))). % 5.70/1.09 cnf(i_0_14, plain, (relation_empty_yielding(empty_set))). % 5.70/1.09 cnf(i_0_51, plain, (relation_empty_yielding(esk11_0))). % 5.70/1.09 cnf(i_0_53, plain, (subset(X1,X1))). % 5.70/1.09 cnf(i_0_10, plain, (relation(identity_relation(X1)))). % 5.70/1.09 cnf(i_0_45, plain, (empty(esk8_1(X1)))). % 5.70/1.09 cnf(i_0_11, plain, (element(esk1_1(X1),X1))). % 5.70/1.09 cnf(i_0_46, plain, (element(esk8_1(X1),powerset(X1)))). % 5.70/1.09 cnf(i_0_59, plain, (relation_dom(identity_relation(X1))=X1)). % 5.70/1.09 cnf(i_0_44, plain, (~empty(esk7_0))). % 5.70/1.09 cnf(i_0_47, plain, (~empty(esk9_0))). % 5.70/1.09 cnf(i_0_19, plain, (~empty(powerset(X1)))). % 5.70/1.09 cnf(i_0_72, negated_conjecture, (relation_composition(esk13_0,function_inverse(esk13_0))!=identity_relation(relation_dom(esk13_0))|relation_composition(function_inverse(esk13_0),esk13_0)!=identity_relation(relation_rng(esk13_0)))). % 5.70/1.09 cnf(i_0_77, plain, (~empty(X1)|~in(X2,X1))). % 5.70/1.09 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 5.70/1.09 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 5.70/1.09 cnf(i_0_76, plain, (X1=empty_set|~empty(X1))). % 5.70/1.09 cnf(i_0_7, plain, (function(function_inverse(X1))|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_27, plain, (relation(relation_dom(X1))|~empty(X1))). % 5.70/1.09 cnf(i_0_29, plain, (relation(relation_rng(X1))|~empty(X1))). % 5.70/1.09 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 5.70/1.09 cnf(i_0_37, plain, (empty(X1)|~empty(esk4_1(X1)))). % 5.70/1.09 cnf(i_0_25, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 5.70/1.09 cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 5.70/1.09 cnf(i_0_28, plain, (empty(relation_dom(X1))|~empty(X1))). % 5.70/1.09 cnf(i_0_8, plain, (relation(function_inverse(X1))|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))). % 5.70/1.09 cnf(i_0_30, plain, (empty(relation_rng(X1))|~empty(X1))). % 5.70/1.09 cnf(i_0_9, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))). % 5.70/1.09 cnf(i_0_78, plain, (X1=X2|~empty(X2)|~empty(X1))). % 5.70/1.09 cnf(i_0_54, plain, (element(X1,X2)|~in(X1,X2))). % 5.70/1.09 cnf(i_0_61, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 5.70/1.09 cnf(i_0_71, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 5.70/1.09 cnf(i_0_55, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 5.70/1.09 cnf(i_0_12, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 5.70/1.09 cnf(i_0_31, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 5.70/1.09 cnf(i_0_38, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))). % 5.70/1.09 cnf(i_0_60, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 5.70/1.09 cnf(i_0_13, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 5.70/1.09 cnf(i_0_32, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 5.70/1.09 cnf(i_0_62, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 5.70/1.09 cnf(i_0_17, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))). % 5.70/1.09 cnf(i_0_68, plain, (relation_dom(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_67, plain, (relation_rng(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_70, plain, (relation_dom(relation_composition(function_inverse(X1),X1))=relation_rng(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_69, plain, (relation_rng(relation_composition(function_inverse(X1),X1))=relation_rng(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_56, plain, (identity_relation(relation_dom(X1))=X1|apply(X1,esk12_2(relation_dom(X1),X1))!=esk12_2(relation_dom(X1),X1)|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_64, plain, (apply(function_inverse(X1),apply(X1,X2))=X2|~one_to_one(X1)|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1)))). % 5.70/1.09 cnf(i_0_66, plain, (apply(X1,apply(function_inverse(X1),X2))=X2|~one_to_one(X1)|~relation(X1)|~function(X1)|~in(X2,relation_rng(X1)))). % 5.70/1.09 cnf(i_0_63, plain, (apply(relation_composition(X1,function_inverse(X1)),X2)=X2|~one_to_one(X1)|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1)))). % 5.70/1.09 cnf(i_0_57, plain, (identity_relation(relation_dom(X1))=X1|in(esk12_2(relation_dom(X1),X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 5.70/1.09 cnf(i_0_58, plain, (apply(identity_relation(X1),X2)=X2|~in(X2,X1))). % 5.70/1.09 cnf(i_0_65, plain, (apply(relation_composition(function_inverse(X1),X1),X2)=X2|~one_to_one(X1)|~relation(X1)|~function(X1)|~in(X2,relation_rng(X1)))). % 5.70/1.09 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.70/1.09 # Begin printing tableau % 5.70/1.09 # Found 9 steps % 5.70/1.09 cnf(i_0_73, negated_conjecture, (one_to_one(esk13_0)), inference(start_rule)). % 5.70/1.09 cnf(i_0_85, plain, (one_to_one(esk13_0)), inference(extension_rule, [i_0_65])). % 5.70/1.09 cnf(i_0_449, plain, (~relation(esk13_0)), inference(closure_rule, [i_0_75])). % 5.70/1.09 cnf(i_0_450, plain, (~function(esk13_0)), inference(closure_rule, [i_0_74])). % 5.70/1.09 cnf(i_0_447, plain, (apply(relation_composition(function_inverse(esk13_0),esk13_0),esk12_2(relation_dom(relation_composition(function_inverse(esk13_0),esk13_0)),relation_composition(function_inverse(esk13_0),esk13_0)))=esk12_2(relation_dom(relation_composition(function_inverse(esk13_0),esk13_0)),relation_composition(function_inverse(esk13_0),esk13_0))), inference(extension_rule, [i_0_56])). % 5.70/1.09 cnf(i_0_451, plain, (~in(esk12_2(relation_dom(relation_composition(function_inverse(esk13_0),esk13_0)),relation_composition(function_inverse(esk13_0),esk13_0)),relation_rng(esk13_0))), inference(etableau_closure_rule, [i_0_451, ...])). % 5.70/1.09 cnf(i_0_544, plain, (identity_relation(relation_dom(relation_composition(function_inverse(esk13_0),esk13_0)))=relation_composition(function_inverse(esk13_0),esk13_0)), inference(etableau_closure_rule, [i_0_544, ...])). % 5.70/1.09 cnf(i_0_546, plain, (~relation(relation_composition(function_inverse(esk13_0),esk13_0))), inference(etableau_closure_rule, [i_0_546, ...])). % 5.70/1.09 cnf(i_0_547, plain, (~function(relation_composition(function_inverse(esk13_0),esk13_0))), inference(etableau_closure_rule, [i_0_547, ...])). % 5.70/1.09 # End printing tableau % 5.70/1.09 # SZS output end % 5.70/1.09 # Branches closed with saturation will be marked with an "s" % 5.70/1.09 # Child (10761) has found a proof. % 5.70/1.09 % 5.70/1.09 # Proof search is over... % 5.70/1.09 # Freeing feature tree %------------------------------------------------------------------------------