%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU044+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 : n012.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:35 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 : SEU044+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 : n012.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 : Sat Jun 18 20:30: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___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 63 Number of unprocessed: 63 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # 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 # 63 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 5 conjectures. % 0.20/0.38 # There are 5 start rule candidates: % 0.20/0.38 # Found 29 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 5 start rule tableaux created. % 0.20/0.38 # 34 extension rule candidate clauses % 0.20/0.38 # 29 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 5 % 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 % 0.20/0.39 # There were 1 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 1 total successful branch saturations. % 0.20/0.39 # There were 0 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_3, plain, (empty(empty_set))). % 0.20/0.39 cnf(i_0_6, plain, (empty(empty_set))). % 0.20/0.39 cnf(i_0_7, plain, (empty(empty_set))). % 0.20/0.39 cnf(i_0_32, plain, (empty(esk3_0))). % 0.20/0.39 cnf(i_0_42, plain, (empty(esk7_0))). % 0.20/0.39 cnf(i_0_47, plain, (empty(esk10_0))). % 0.20/0.39 cnf(i_0_2, plain, (relation(empty_set))). % 0.20/0.39 cnf(i_0_5, plain, (relation(empty_set))). % 0.20/0.39 cnf(i_0_30, plain, (relation(esk2_0))). % 0.20/0.39 cnf(i_0_33, plain, (relation(esk3_0))). % 0.20/0.39 cnf(i_0_36, plain, (relation(esk4_0))). % 0.20/0.39 cnf(i_0_41, plain, (relation(esk7_0))). % 0.20/0.39 cnf(i_0_43, plain, (relation(esk8_0))). % 0.20/0.39 cnf(i_0_46, plain, (relation(esk9_0))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (relation(esk14_0))). % 0.20/0.39 cnf(i_0_4, plain, (relation_empty_yielding(empty_set))). % 0.20/0.39 cnf(i_0_45, plain, (relation_empty_yielding(esk9_0))). % 0.20/0.39 cnf(i_0_29, plain, (function(esk2_0))). % 0.20/0.39 cnf(i_0_31, plain, (function(esk3_0))). % 0.20/0.39 cnf(i_0_35, plain, (function(esk4_0))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (function(esk14_0))). % 0.20/0.39 cnf(i_0_34, plain, (one_to_one(esk4_0))). % 0.20/0.39 cnf(i_0_44, plain, (~empty(esk8_0))). % 0.20/0.39 cnf(i_0_48, plain, (~empty(esk11_0))). % 0.20/0.39 cnf(i_0_23, plain, (X1=empty_set|~empty(X1))). % 0.20/0.39 cnf(i_0_39, plain, (empty(esk6_1(X1)))). % 0.20/0.39 cnf(i_0_17, plain, (relation(X1)|~empty(X1))). % 0.20/0.39 cnf(i_0_9, plain, (function(X1)|~empty(X1))). % 0.20/0.39 cnf(i_0_1, plain, (subset(X1,X1))). % 0.20/0.39 cnf(i_0_24, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.39 cnf(i_0_13, plain, (~empty(powerset(X1)))). % 0.20/0.39 cnf(i_0_16, plain, (empty(relation_dom(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_15, plain, (relation(relation_dom(X1))|~empty(X1))). % 0.20/0.39 cnf(i_0_8, plain, (element(esk1_1(X1),X1))). % 0.20/0.39 cnf(i_0_37, plain, (empty(X1)|~empty(esk5_1(X1)))). % 0.20/0.39 cnf(i_0_10, plain, (one_to_one(X1)|~empty(X1)|~relation(X1)|~function(X1))). % 0.20/0.39 cnf(i_0_40, plain, (element(esk6_1(X1),powerset(X1)))). % 0.20/0.39 cnf(i_0_14, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 0.20/0.39 cnf(i_0_50, plain, (~empty(X2)|~in(X1,X2))). % 0.20/0.39 cnf(i_0_38, plain, (empty(X1)|element(esk5_1(X1),powerset(X1)))). % 0.20/0.39 cnf(i_0_49, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.39 cnf(i_0_26, plain, (relation(relation_rng_restriction(X2,X1))|~relation(X1))). % 0.20/0.39 cnf(i_0_18, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.20/0.39 cnf(i_0_19, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_28, plain, (relation(relation_rng_restriction(X1,X2))|~relation(X2)|~function(X2))). % 0.20/0.39 cnf(i_0_27, plain, (function(relation_rng_restriction(X1,X2))|~relation(X2)|~function(X2))). % 0.20/0.39 cnf(i_0_25, plain, (~in(X2,X1)|~in(X1,X2))). % 0.20/0.39 cnf(i_0_20, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.39 cnf(i_0_22, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.39 cnf(i_0_21, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (in(esk13_0,relation_dom(esk14_0))|in(esk13_0,relation_dom(relation_rng_restriction(esk12_0,esk14_0))))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (in(apply(esk14_0,esk13_0),esk12_0)|in(esk13_0,relation_dom(relation_rng_restriction(esk12_0,esk14_0))))). % 0.20/0.39 cnf(i_0_65, plain, (in(X1,relation_dom(X2))|X3!=relation_rng_restriction(X4,X2)|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(X1,relation_dom(X3)))). % 0.20/0.39 cnf(i_0_62, plain, (apply(X2,X1)=apply(X3,X1)|X2!=relation_rng_restriction(X4,X3)|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(X1,relation_dom(X2)))). % 0.20/0.39 cnf(i_0_64, plain, (in(apply(X1,X2),X3)|X4!=relation_rng_restriction(X3,X1)|~relation(X4)|~relation(X1)|~function(X4)|~function(X1)|~in(X2,relation_dom(X4)))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (~in(esk13_0,relation_dom(esk14_0))|~in(apply(esk14_0,esk13_0),esk12_0)|~in(esk13_0,relation_dom(relation_rng_restriction(esk12_0,esk14_0))))). % 0.20/0.39 cnf(i_0_63, plain, (in(X1,relation_dom(X4))|X4!=relation_rng_restriction(X3,X2)|~relation(X4)|~relation(X2)|~function(X4)|~function(X2)|~in(X1,relation_dom(X2))|~in(apply(X2,X1),X3))). % 0.20/0.39 cnf(i_0_59, plain, (X2=relation_rng_restriction(X1,X3)|in(esk15_3(X1,X2,X3),relation_dom(X3))|in(esk15_3(X1,X2,X3),relation_dom(X2))|in(esk16_3(X1,X2,X3),relation_dom(X2))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2))). % 0.20/0.39 cnf(i_0_57, plain, (X2=relation_rng_restriction(X1,X3)|in(esk15_3(X1,X2,X3),relation_dom(X2))|in(esk16_3(X1,X2,X3),relation_dom(X2))|in(apply(X3,esk15_3(X1,X2,X3)),X1)|~relation(X3)|~relation(X2)|~function(X3)|~function(X2))). % 0.20/0.39 cnf(i_0_58, plain, (X1=relation_rng_restriction(X2,X3)|in(esk15_3(X2,X1,X3),relation_dom(X3))|in(esk15_3(X2,X1,X3),relation_dom(X1))|apply(X1,esk16_3(X2,X1,X3))!=apply(X3,esk16_3(X2,X1,X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1))). % 0.20/0.39 cnf(i_0_56, plain, (X1=relation_rng_restriction(X2,X3)|in(esk15_3(X2,X1,X3),relation_dom(X1))|in(apply(X3,esk15_3(X2,X1,X3)),X2)|apply(X1,esk16_3(X2,X1,X3))!=apply(X3,esk16_3(X2,X1,X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1))). % 0.20/0.39 cnf(i_0_61, plain, (X2=relation_rng_restriction(X1,X3)|in(esk16_3(X1,X2,X3),relation_dom(X2))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(esk15_3(X1,X2,X3),relation_dom(X3))|~in(esk15_3(X1,X2,X3),relation_dom(X2))|~in(apply(X3,esk15_3(X1,X2,X3)),X1))). % 0.20/0.39 cnf(i_0_60, plain, (X1=relation_rng_restriction(X2,X3)|apply(X1,esk16_3(X2,X1,X3))!=apply(X3,esk16_3(X2,X1,X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1)|~in(esk15_3(X2,X1,X3),relation_dom(X3))|~in(esk15_3(X2,X1,X3),relation_dom(X1))|~in(apply(X3,esk15_3(X2,X1,X3)),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 5 steps % 0.20/0.39 cnf(i_0_54, negated_conjecture, (function(esk14_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_73, plain, (function(esk14_0)), inference(extension_rule, [i_0_28])). % 0.20/0.39 cnf(i_0_811, plain, (~relation(esk14_0)), inference(closure_rule, [i_0_55])). % 0.20/0.39 cnf(i_0_810, plain, (relation(relation_rng_restriction(X3,esk14_0))), inference(extension_rule, [i_0_26])). % 0.20/0.39 cnf(i_0_1298, plain, (relation(relation_rng_restriction(X5,relation_rng_restriction(X3,esk14_0)))), inference(etableau_closure_rule, [i_0_1298, ...])). % 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 (340) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------