%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET995+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 : n018.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 01:04:20 EDT 2022 % Result : Theorem 1.63s 0.57s % Output : CNFRefutation 1.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET995+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 : n018.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 Jul 9 17:32:41 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___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 62 Number of unprocessed: 62 % 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.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 62 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 8 conjectures. % 0.12/0.36 # There are 8 start rule candidates: % 0.12/0.36 # Found 30 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 8 start rule tableaux created. % 0.12/0.36 # 32 extension rule candidate clauses % 0.12/0.36 # 30 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 1.63/0.57 # There were 1 total branch saturation attempts. % 1.63/0.57 # There were 0 of these attempts blocked. % 1.63/0.57 # There were 0 deferred branch saturation attempts. % 1.63/0.57 # There were 0 free duplicated saturations. % 1.63/0.57 # There were 1 total successful branch saturations. % 1.63/0.57 # There were 0 successful branch saturations in interreduction. % 1.63/0.57 # There were 0 successful branch saturations on the branch. % 1.63/0.57 # There were 1 successful branch saturations after the branch. % 1.63/0.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.63/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.63/0.57 # Begin clausification derivation % 1.63/0.57 % 1.63/0.57 # End clausification derivation % 1.63/0.57 # Begin listing active clauses obtained from FOF to CNF conversion % 1.63/0.57 cnf(i_0_44, negated_conjecture, (esk16_0!=esk15_0)). % 1.63/0.57 cnf(i_0_17, plain, (empty(empty_set))). % 1.63/0.57 cnf(i_0_19, plain, (empty(empty_set))). % 1.63/0.57 cnf(i_0_22, plain, (empty(empty_set))). % 1.63/0.57 cnf(i_0_32, plain, (empty(esk7_0))). % 1.63/0.57 cnf(i_0_35, plain, (empty(esk9_0))). % 1.63/0.57 cnf(i_0_29, plain, (function(esk6_0))). % 1.63/0.57 cnf(i_0_50, negated_conjecture, (function(esk15_0))). % 1.63/0.57 cnf(i_0_48, negated_conjecture, (function(esk16_0))). % 1.63/0.57 cnf(i_0_16, plain, (relation(empty_set))). % 1.63/0.57 cnf(i_0_21, plain, (relation(empty_set))). % 1.63/0.57 cnf(i_0_30, plain, (relation(esk6_0))). % 1.63/0.57 cnf(i_0_31, plain, (relation(esk7_0))). % 1.63/0.57 cnf(i_0_36, plain, (relation(esk10_0))). % 1.63/0.57 cnf(i_0_42, plain, (relation(esk13_0))). % 1.63/0.57 cnf(i_0_51, negated_conjecture, (relation(esk15_0))). % 1.63/0.57 cnf(i_0_49, negated_conjecture, (relation(esk16_0))). % 1.63/0.57 cnf(i_0_15, plain, (relation_empty_yielding(empty_set))). % 1.63/0.57 cnf(i_0_41, plain, (relation_empty_yielding(esk13_0))). % 1.63/0.57 cnf(i_0_37, plain, (~empty(esk10_0))). % 1.63/0.57 cnf(i_0_40, plain, (~empty(esk12_0))). % 1.63/0.57 cnf(i_0_46, negated_conjecture, (singleton(esk14_0)=relation_rng(esk15_0))). % 1.63/0.57 cnf(i_0_45, negated_conjecture, (singleton(esk14_0)=relation_rng(esk16_0))). % 1.63/0.57 cnf(i_0_47, negated_conjecture, (relation_dom(esk16_0)=relation_dom(esk15_0))). % 1.63/0.57 cnf(i_0_58, plain, (X1=empty_set|~empty(X1))). % 1.63/0.57 cnf(i_0_38, plain, (empty(esk11_1(X1)))). % 1.63/0.57 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 1.63/0.57 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 1.63/0.57 cnf(i_0_43, plain, (subset(X1,X1))). % 1.63/0.57 cnf(i_0_60, plain, (X1=X2|~empty(X2)|~empty(X1))). % 1.63/0.57 cnf(i_0_20, plain, (~empty(singleton(X1)))). % 1.63/0.57 cnf(i_0_18, plain, (~empty(powerset(X1)))). % 1.63/0.57 cnf(i_0_28, plain, (empty(relation_rng(X1))|~empty(X1))). % 1.63/0.57 cnf(i_0_26, plain, (empty(relation_dom(X1))|~empty(X1))). % 1.63/0.57 cnf(i_0_27, plain, (relation(relation_rng(X1))|~empty(X1))). % 1.63/0.57 cnf(i_0_25, plain, (relation(relation_dom(X1))|~empty(X1))). % 1.63/0.57 cnf(i_0_14, plain, (element(esk5_1(X1),X1))). % 1.63/0.57 cnf(i_0_33, plain, (empty(X1)|~empty(esk8_1(X1)))). % 1.63/0.57 cnf(i_0_6, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))). % 1.63/0.57 cnf(i_0_39, plain, (element(esk11_1(X1),powerset(X1)))). % 1.63/0.57 cnf(i_0_24, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 1.63/0.57 cnf(i_0_23, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 1.63/0.57 cnf(i_0_59, plain, (~empty(X2)|~in(X1,X2))). % 1.63/0.57 cnf(i_0_34, plain, (empty(X1)|element(esk8_1(X1),powerset(X1)))). % 1.63/0.57 cnf(i_0_7, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))). % 1.63/0.57 cnf(i_0_52, plain, (element(X1,X2)|~in(X1,X2))). % 1.63/0.57 cnf(i_0_53, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 1.63/0.57 cnf(i_0_54, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 1.63/0.57 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 1.63/0.57 cnf(i_0_55, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 1.63/0.57 cnf(i_0_4, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))). % 1.63/0.57 cnf(i_0_57, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 1.63/0.57 cnf(i_0_56, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 1.63/0.57 cnf(i_0_62, plain, (X1=X2|in(esk17_2(X1,X2),relation_dom(X1))|relation_dom(X1)!=relation_dom(X2)|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))). % 1.63/0.57 cnf(i_0_5, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))). % 1.63/0.57 cnf(i_0_11, plain, (in(X3,X4)|X4!=relation_rng(X2)|X3!=apply(X2,X1)|~function(X2)|~relation(X2)|~in(X1,relation_dom(X2)))). % 1.63/0.57 cnf(i_0_9, plain, (X2=relation_rng(X1)|in(esk3_2(X1,X2),X2)|in(esk4_2(X1,X2),relation_dom(X1))|~function(X1)|~relation(X1))). % 1.63/0.57 cnf(i_0_8, plain, (X2=relation_rng(X1)|apply(X1,esk4_2(X1,X2))=esk3_2(X1,X2)|in(esk3_2(X1,X2),X2)|~function(X1)|~relation(X1))). % 1.63/0.57 cnf(i_0_10, plain, (X2=relation_rng(X1)|esk3_2(X1,X2)!=apply(X1,X3)|~function(X1)|~relation(X1)|~in(X3,relation_dom(X1))|~in(esk3_2(X1,X2),X2))). % 1.63/0.57 cnf(i_0_12, plain, (apply(X2,esk2_3(X2,X3,X1))=X1|X3!=relation_rng(X2)|~function(X2)|~relation(X2)|~in(X1,X3))). % 1.63/0.57 cnf(i_0_61, plain, (X1=X2|relation_dom(X1)!=relation_dom(X2)|apply(X1,esk17_2(X1,X2))!=apply(X2,esk17_2(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))). % 1.63/0.57 cnf(i_0_13, plain, (in(esk2_3(X1,X2,X3),relation_dom(X1))|X2!=relation_rng(X1)|~function(X1)|~relation(X1)|~in(X3,X2))). % 1.63/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.63/0.57 # Begin printing tableau % 1.63/0.57 # Found 9 steps % 1.63/0.57 cnf(i_0_50, negated_conjecture, (function(esk15_0)), inference(start_rule)). % 1.63/0.57 cnf(i_0_69, plain, (function(esk15_0)), inference(extension_rule, [i_0_62])). % 1.63/0.57 cnf(i_0_126, plain, (esk16_0=esk15_0), inference(closure_rule, [i_0_44])). % 1.63/0.57 cnf(i_0_128, plain, (relation_dom(esk16_0)!=relation_dom(esk15_0)), inference(closure_rule, [i_0_47])). % 1.63/0.57 cnf(i_0_130, plain, (~function(esk16_0)), inference(closure_rule, [i_0_48])). % 1.63/0.57 cnf(i_0_131, plain, (~relation(esk15_0)), inference(closure_rule, [i_0_51])). % 1.63/0.57 cnf(i_0_132, plain, (~relation(esk16_0)), inference(closure_rule, [i_0_49])). % 1.63/0.57 cnf(i_0_127, plain, (in(esk17_2(esk16_0,esk15_0),relation_dom(esk16_0))), inference(extension_rule, [i_0_59])). % 1.63/0.57 cnf(i_0_161, plain, (~empty(relation_dom(esk16_0))), inference(etableau_closure_rule, [i_0_161, ...])). % 1.63/0.57 # End printing tableau % 1.63/0.57 # SZS output end % 1.63/0.57 # Branches closed with saturation will be marked with an "s" % 1.63/0.57 # Child (28794) has found a proof. % 1.63/0.57 % 1.63/0.57 # Proof search is over... % 1.63/0.57 # Freeing feature tree %------------------------------------------------------------------------------