%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU030+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 : n022.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 2.08s 0.65s % Output : CNFRefutation 2.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU030+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.12/0.33 % Computer : n022.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 : Sat Jun 18 23:30:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 73 Number of unprocessed: 68 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 68 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 8 conjectures. % 0.12/0.37 # There are 8 start rule candidates: % 0.12/0.37 # Found 34 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 8 start rule tableaux created. % 0.12/0.37 # 34 extension rule candidate clauses % 0.12/0.37 # 34 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 2.08/0.65 # There were 2 total branch saturation attempts. % 2.08/0.65 # There were 0 of these attempts blocked. % 2.08/0.65 # There were 0 deferred branch saturation attempts. % 2.08/0.65 # There were 0 free duplicated saturations. % 2.08/0.65 # There were 2 total successful branch saturations. % 2.08/0.65 # There were 0 successful branch saturations in interreduction. % 2.08/0.65 # There were 0 successful branch saturations on the branch. % 2.08/0.65 # There were 2 successful branch saturations after the branch. % 2.08/0.65 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.08/0.65 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.08/0.65 # Begin clausification derivation % 2.08/0.65 % 2.08/0.65 # End clausification derivation % 2.08/0.65 # Begin listing active clauses obtained from FOF to CNF conversion % 2.08/0.65 cnf(i_0_71, negated_conjecture, (function(esk12_0))). % 2.08/0.65 cnf(i_0_69, negated_conjecture, (function(esk13_0))). % 2.08/0.65 cnf(i_0_72, negated_conjecture, (relation(esk12_0))). % 2.08/0.65 cnf(i_0_70, negated_conjecture, (relation(esk13_0))). % 2.08/0.65 cnf(i_0_16, plain, (empty(empty_set))). % 2.08/0.65 cnf(i_0_68, negated_conjecture, (one_to_one(esk12_0))). % 2.08/0.65 cnf(i_0_67, negated_conjecture, (relation_dom(esk13_0)=relation_rng(esk12_0))). % 2.08/0.65 cnf(i_0_66, negated_conjecture, (relation_composition(esk12_0,esk13_0)=identity_relation(relation_dom(esk12_0)))). % 2.08/0.65 cnf(i_0_34, plain, (function(esk2_0))). % 2.08/0.65 cnf(i_0_41, plain, (function(esk6_0))). % 2.08/0.65 cnf(i_0_50, plain, (function(esk10_0))). % 2.08/0.65 cnf(i_0_15, plain, (relation(empty_set))). % 2.08/0.65 cnf(i_0_37, plain, (empty(esk3_0))). % 2.08/0.65 cnf(i_0_40, plain, (empty(esk5_0))). % 2.08/0.65 cnf(i_0_42, plain, (empty(esk6_0))). % 2.08/0.65 cnf(i_0_35, plain, (relation(esk2_0))). % 2.08/0.65 cnf(i_0_36, plain, (relation(esk3_0))). % 2.08/0.65 cnf(i_0_43, plain, (relation(esk6_0))). % 2.08/0.65 cnf(i_0_44, plain, (relation(esk7_0))). % 2.08/0.65 cnf(i_0_51, plain, (relation(esk10_0))). % 2.08/0.65 cnf(i_0_53, plain, (relation(esk11_0))). % 2.08/0.65 cnf(i_0_49, plain, (one_to_one(esk10_0))). % 2.08/0.65 cnf(i_0_14, plain, (relation_empty_yielding(empty_set))). % 2.08/0.65 cnf(i_0_52, plain, (relation_empty_yielding(esk11_0))). % 2.08/0.65 cnf(i_0_21, plain, (function(identity_relation(X1)))). % 2.08/0.65 cnf(i_0_10, plain, (relation(identity_relation(X1)))). % 2.08/0.65 cnf(i_0_46, plain, (empty(esk8_1(X1)))). % 2.08/0.65 cnf(i_0_54, plain, (subset(X1,X1))). % 2.08/0.65 cnf(i_0_11, plain, (element(esk1_1(X1),X1))). % 2.08/0.65 cnf(i_0_47, plain, (element(esk8_1(X1),powerset(X1)))). % 2.08/0.65 cnf(i_0_65, negated_conjecture, (function_inverse(esk12_0)!=esk13_0)). % 2.08/0.65 cnf(i_0_45, plain, (~empty(esk7_0))). % 2.08/0.65 cnf(i_0_48, plain, (~empty(esk9_0))). % 2.08/0.65 cnf(i_0_19, plain, (~empty(powerset(X1)))). % 2.08/0.65 cnf(i_0_74, plain, (~empty(X1)|~in(X2,X1))). % 2.08/0.65 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 2.08/0.65 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 2.08/0.65 cnf(i_0_27, plain, (relation(relation_dom(X1))|~empty(X1))). % 2.08/0.65 cnf(i_0_73, plain, (X1=empty_set|~empty(X1))). % 2.08/0.65 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 2.08/0.65 cnf(i_0_38, plain, (empty(X1)|~empty(esk4_1(X1)))). % 2.08/0.65 cnf(i_0_55, plain, (element(X1,X2)|~in(X1,X2))). % 2.08/0.65 cnf(i_0_29, plain, (relation(relation_rng(X1))|~empty(X1))). % 2.08/0.65 cnf(i_0_7, plain, (function(function_inverse(X1))|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_8, plain, (relation(function_inverse(X1))|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_28, plain, (empty(relation_dom(X1))|~empty(X1))). % 2.08/0.65 cnf(i_0_30, plain, (empty(relation_rng(X1))|~empty(X1))). % 2.08/0.65 cnf(i_0_75, plain, (X1=X2|~empty(X2)|~empty(X1))). % 2.08/0.65 cnf(i_0_25, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 2.08/0.65 cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 2.08/0.65 cnf(i_0_58, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 2.08/0.65 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))). % 2.08/0.65 cnf(i_0_9, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))). % 2.08/0.65 cnf(i_0_60, plain, (relation_rng(function_inverse(X1))=relation_dom(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_61, plain, (relation_dom(function_inverse(X1))=relation_rng(X1)|~one_to_one(X1)|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_12, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 2.08/0.65 cnf(i_0_39, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))). % 2.08/0.65 cnf(i_0_31, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 2.08/0.65 cnf(i_0_62, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 2.08/0.65 cnf(i_0_57, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 2.08/0.65 cnf(i_0_56, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 2.08/0.65 cnf(i_0_13, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))). % 2.08/0.65 cnf(i_0_32, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))). % 2.08/0.65 cnf(i_0_17, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))). % 2.08/0.65 cnf(i_0_64, plain, (relation_composition(X1,function_inverse(X1))=identity_relation(relation_dom(X1))|~one_to_one(X1)|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_63, plain, (relation_composition(function_inverse(X1),X1)=identity_relation(relation_rng(X1))|~one_to_one(X1)|~relation(X1)|~function(X1))). % 2.08/0.65 cnf(i_0_59, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 2.08/0.65 cnf(i_0_33, plain, (X1=X2|relation_composition(X1,X3)!=identity_relation(relation_dom(X2))|relation_composition(X3,X2)!=identity_relation(relation_rng(X1))|~relation(X2)|~relation(X3)|~relation(X1)|~function(X2)|~function(X3)|~function(X1))). % 2.08/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.08/0.65 # Begin printing tableau % 2.08/0.65 # Found 6 steps % 2.08/0.65 cnf(i_0_70, negated_conjecture, (relation(esk13_0)), inference(start_rule)). % 2.08/0.65 cnf(i_0_81, plain, (relation(esk13_0)), inference(extension_rule, [i_0_7])). % 2.08/0.65 cnf(i_0_105, plain, (~function(esk13_0)), inference(closure_rule, [i_0_69])). % 2.08/0.65 cnf(i_0_103, plain, (function(function_inverse(esk13_0))), inference(extension_rule, [i_0_8])). % 2.08/0.65 cnf(i_0_124, plain, (relation(function_inverse(function_inverse(esk13_0)))), inference(etableau_closure_rule, [i_0_124, ...])). % 2.08/0.65 cnf(i_0_125, plain, (~relation(function_inverse(esk13_0))), inference(etableau_closure_rule, [i_0_125, ...])). % 2.08/0.65 # End printing tableau % 2.08/0.65 # SZS output end % 2.08/0.65 # Branches closed with saturation will be marked with an "s" % 2.08/0.65 # Child (8302) has found a proof. % 2.08/0.65 % 2.08/0.65 # Proof search is over... % 2.08/0.65 # Freeing feature tree %------------------------------------------------------------------------------