%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU055+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 : n006.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:38 EDT 2022 % Result : Theorem 6.65s 1.25s % Output : CNFRefutation 6.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : SEU055+1 : TPTP v8.1.0. Released v3.2.0. % 0.09/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.37 % Computer : n006.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Mon Jun 20 05:29:25 EDT 2022 % 0.15/0.37 % CPUTime : % 0.22/0.40 # No SInE strategy applied % 0.22/0.40 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.22/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.22/0.40 # % 0.22/0.40 # Presaturation interreduction done % 0.22/0.40 # Number of axioms: 67 Number of unprocessed: 64 % 0.22/0.40 # Tableaux proof search. % 0.22/0.40 # APR header successfully linked. % 0.22/0.40 # Hello from C++ % 0.22/0.41 # The folding up rule is enabled... % 0.22/0.41 # Local unification is enabled... % 0.22/0.41 # Any saturation attempts will use folding labels... % 0.22/0.41 # 64 beginning clauses after preprocessing and clausification % 0.22/0.41 # Creating start rules for all 4 conjectures. % 0.22/0.41 # There are 4 start rule candidates: % 0.22/0.41 # Found 33 unit axioms. % 0.22/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.22/0.41 # 4 start rule tableaux created. % 0.22/0.41 # 31 extension rule candidate clauses % 0.22/0.41 # 33 unit axiom clauses % 0.22/0.41 % 0.22/0.41 # Requested 8, 32 cores available to the main process. % 0.22/0.41 # There are not enough tableaux to fork, creating more from the initial 4 % 0.22/0.41 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.22/0.41 # We now have 15 tableaux to operate on % 5.55/1.12 # Creating equality axioms % 5.55/1.12 # Ran out of tableaux, making start rules for all clauses % 6.65/1.25 # There were 2 total branch saturation attempts. % 6.65/1.25 # There were 0 of these attempts blocked. % 6.65/1.25 # There were 0 deferred branch saturation attempts. % 6.65/1.25 # There were 0 free duplicated saturations. % 6.65/1.25 # There were 1 total successful branch saturations. % 6.65/1.25 # There were 0 successful branch saturations in interreduction. % 6.65/1.25 # There were 0 successful branch saturations on the branch. % 6.65/1.25 # There were 1 successful branch saturations after the branch. % 6.65/1.25 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.65/1.25 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.65/1.25 # Begin clausification derivation % 6.65/1.25 % 6.65/1.25 # End clausification derivation % 6.65/1.25 # Begin listing active clauses obtained from FOF to CNF conversion % 6.65/1.25 cnf(i_0_53, negated_conjecture, (function(esk15_0))). % 6.65/1.25 cnf(i_0_54, negated_conjecture, (relation(esk15_0))). % 6.65/1.25 cnf(i_0_29, plain, (function(esk5_0))). % 6.65/1.25 cnf(i_0_36, plain, (function(esk9_0))). % 6.65/1.25 cnf(i_0_19, plain, (empty(empty_set))). % 6.65/1.25 cnf(i_0_45, plain, (function(esk13_0))). % 6.65/1.25 cnf(i_0_18, plain, (relation(empty_set))). % 6.65/1.25 cnf(i_0_30, plain, (relation(esk5_0))). % 6.65/1.25 cnf(i_0_31, plain, (relation(esk6_0))). % 6.65/1.25 cnf(i_0_38, plain, (relation(esk9_0))). % 6.65/1.25 cnf(i_0_39, plain, (relation(esk10_0))). % 6.65/1.25 cnf(i_0_32, plain, (empty(esk6_0))). % 6.65/1.25 cnf(i_0_35, plain, (empty(esk8_0))). % 6.65/1.25 cnf(i_0_46, plain, (relation(esk13_0))). % 6.65/1.25 cnf(i_0_48, plain, (relation(esk14_0))). % 6.65/1.25 cnf(i_0_44, plain, (one_to_one(esk13_0))). % 6.65/1.25 cnf(i_0_37, plain, (empty(esk9_0))). % 6.65/1.25 cnf(i_0_17, plain, (relation_empty_yielding(empty_set))). % 6.65/1.25 cnf(i_0_47, plain, (relation_empty_yielding(esk14_0))). % 6.65/1.25 cnf(i_0_64, plain, (set_difference(empty_set,X1)=empty_set)). % 6.65/1.25 cnf(i_0_49, plain, (subset(X1,X1))). % 6.65/1.25 cnf(i_0_61, plain, (set_difference(X1,empty_set)=X1)). % 6.65/1.25 cnf(i_0_41, plain, (empty(esk11_1(X1)))). % 6.65/1.25 cnf(i_0_16, plain, (element(esk4_1(X1),X1))). % 6.65/1.25 cnf(i_0_52, negated_conjecture, (set_difference(relation_image(esk15_0,X1),relation_image(esk15_0,X2))=relation_image(esk15_0,set_difference(X1,X2)))). % 6.65/1.25 cnf(i_0_9, plain, (in(X1,singleton(X1)))). % 6.65/1.25 cnf(i_0_42, plain, (element(esk11_1(X1),powerset(X1)))). % 6.65/1.25 cnf(i_0_51, negated_conjecture, (~one_to_one(esk15_0))). % 6.65/1.25 cnf(i_0_40, plain, (~empty(esk10_0))). % 6.65/1.25 cnf(i_0_43, plain, (~empty(esk12_0))). % 6.65/1.25 cnf(i_0_22, plain, (~empty(singleton(X1)))). % 6.65/1.25 cnf(i_0_20, plain, (~empty(powerset(X1)))). % 6.65/1.25 cnf(i_0_57, plain, (set_difference(singleton(X1),singleton(X1))!=singleton(X1))). % 6.65/1.25 cnf(i_0_68, plain, (~empty(X1)|~in(X2,X1))). % 6.65/1.25 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 6.65/1.25 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 6.65/1.25 cnf(i_0_67, plain, (X1=empty_set|~empty(X1))). % 6.65/1.25 cnf(i_0_27, plain, (relation(relation_dom(X1))|~empty(X1))). % 6.65/1.25 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))). % 6.65/1.25 cnf(i_0_23, plain, (relation(set_difference(X1,X2))|~relation(X2)|~relation(X1))). % 6.65/1.25 cnf(i_0_69, plain, (X1=X2|~empty(X2)|~empty(X1))). % 6.65/1.25 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 6.65/1.25 cnf(i_0_33, plain, (empty(X1)|~empty(esk7_1(X1)))). % 6.65/1.25 cnf(i_0_55, plain, (element(X1,X2)|~in(X1,X2))). % 6.65/1.25 cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 6.65/1.25 cnf(i_0_28, plain, (empty(relation_dom(X1))|~empty(X1))). % 6.65/1.25 cnf(i_0_60, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 6.65/1.25 cnf(i_0_11, plain, (one_to_one(X1)|esk3_1(X1)!=esk2_1(X1)|~relation(X1)|~function(X1))). % 6.65/1.25 cnf(i_0_59, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 6.65/1.25 cnf(i_0_63, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 6.65/1.25 cnf(i_0_66, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 6.65/1.25 cnf(i_0_62, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 6.65/1.25 cnf(i_0_58, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 6.65/1.25 cnf(i_0_10, plain, (X1=X2|~in(X1,singleton(X2)))). % 6.65/1.25 cnf(i_0_34, plain, (element(esk7_1(X1),powerset(X1))|empty(X1))). % 6.65/1.25 cnf(i_0_56, plain, (set_difference(singleton(X1),singleton(X2))=singleton(X1)|X1=X2)). % 6.65/1.25 cnf(i_0_8, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 6.65/1.25 cnf(i_0_65, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 6.65/1.25 cnf(i_0_14, plain, (one_to_one(X1)|in(esk2_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 6.65/1.25 cnf(i_0_13, plain, (one_to_one(X1)|in(esk3_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 6.65/1.25 cnf(i_0_7, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 6.65/1.25 cnf(i_0_12, plain, (apply(X1,esk3_1(X1))=apply(X1,esk2_1(X1))|one_to_one(X1)|~relation(X1)|~function(X1))). % 6.65/1.25 cnf(i_0_50, plain, (relation_image(X1,singleton(X2))=singleton(apply(X1,X2))|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1)))). % 6.65/1.25 cnf(i_0_15, 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)))). % 6.65/1.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.65/1.25 # Begin printing tableau % 6.65/1.25 # Found 7 steps % 6.65/1.25 cnf(i_0_51, negated_conjecture, (~one_to_one(esk15_0)), inference(start_rule)). % 6.65/1.25 cnf(i_0_74, plain, (~one_to_one(esk15_0)), inference(extension_rule, [i_0_13])). % 6.65/1.25 cnf(i_0_143, plain, (~relation(esk15_0)), inference(closure_rule, [i_0_54])). % 6.65/1.25 cnf(i_0_144, plain, (~function(esk15_0)), inference(closure_rule, [i_0_53])). % 6.65/1.25 cnf(i_0_142, plain, (in(esk3_1(esk15_0),relation_dom(esk15_0))), inference(extension_rule, [i_0_68])). % 6.65/1.25 cnf(i_0_418, plain, (~empty(relation_dom(esk15_0))), inference(extension_rule, [i_0_33])). % 6.65/1.25 cnf(i_0_76624, plain, (~empty(esk7_1(relation_dom(esk15_0)))), inference(etableau_closure_rule, [i_0_76624, ...])). % 6.65/1.25 # End printing tableau % 6.65/1.25 # SZS output end % 6.65/1.25 # Branches closed with saturation will be marked with an "s" % 6.65/1.25 # Child (15173) has found a proof. % 6.65/1.25 % 6.65/1.25 # Proof search is over... % 6.65/1.25 # Freeing feature tree %------------------------------------------------------------------------------