%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU225+3 : 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 : n021.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:24:58 EDT 2022 % Result : Theorem 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0. % 0.03/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 : n021.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 06:38:18 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 73 Number of unprocessed: 73 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 73 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 4 conjectures. % 0.20/0.37 # There are 4 start rule candidates: % 0.20/0.37 # Found 38 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 4 start rule tableaux created. % 0.20/0.37 # 35 extension rule candidate clauses % 0.20/0.37 # 38 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.20/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 13 tableaux to operate on % 0.20/0.40 # Creating equality axioms % 0.20/0.40 # Ran out of tableaux, making start rules for all clauses % 0.20/0.44 # There were 3 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 3 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 3 successful branch saturations after the branch. % 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_18, plain, (empty(empty_set))). % 0.20/0.44 cnf(i_0_23, plain, (empty(empty_set))). % 0.20/0.44 cnf(i_0_30, plain, (empty(empty_set))). % 0.20/0.44 cnf(i_0_41, plain, (empty(esk3_0))). % 0.20/0.44 cnf(i_0_44, plain, (empty(esk5_0))). % 0.20/0.44 cnf(i_0_46, plain, (empty(esk6_0))). % 0.20/0.44 cnf(i_0_38, plain, (function(esk2_0))). % 0.20/0.44 cnf(i_0_45, plain, (function(esk6_0))). % 0.20/0.44 cnf(i_0_54, plain, (function(esk10_0))). % 0.20/0.44 cnf(i_0_73, negated_conjecture, (function(esk15_0))). % 0.20/0.44 cnf(i_0_17, plain, (relation(empty_set))). % 0.20/0.44 cnf(i_0_29, plain, (relation(empty_set))). % 0.20/0.44 cnf(i_0_39, plain, (relation(esk2_0))). % 0.20/0.44 cnf(i_0_40, plain, (relation(esk3_0))). % 0.20/0.44 cnf(i_0_47, plain, (relation(esk6_0))). % 0.20/0.44 cnf(i_0_48, plain, (relation(esk7_0))). % 0.20/0.44 cnf(i_0_55, plain, (relation(esk10_0))). % 0.20/0.44 cnf(i_0_57, plain, (relation(esk11_0))). % 0.20/0.44 cnf(i_0_74, negated_conjecture, (relation(esk15_0))). % 0.20/0.44 cnf(i_0_53, plain, (one_to_one(esk10_0))). % 0.20/0.44 cnf(i_0_16, plain, (relation_empty_yielding(empty_set))). % 0.20/0.44 cnf(i_0_56, plain, (relation_empty_yielding(esk11_0))). % 0.20/0.44 cnf(i_0_49, plain, (~empty(esk7_0))). % 0.20/0.44 cnf(i_0_52, plain, (~empty(esk9_0))). % 0.20/0.44 cnf(i_0_70, plain, (X1=empty_set|~empty(X1))). % 0.20/0.44 cnf(i_0_50, plain, (empty(esk8_1(X1)))). % 0.20/0.44 cnf(i_0_72, negated_conjecture, (in(esk14_0,esk13_0))). % 0.20/0.44 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_60, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.20/0.44 cnf(i_0_58, plain, (subset(X1,X1))). % 0.20/0.44 cnf(i_0_34, plain, (set_intersection2(X1,X1)=X1)). % 0.20/0.44 cnf(i_0_76, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.44 cnf(i_0_25, plain, (~empty(singleton(X1)))). % 0.20/0.44 cnf(i_0_22, plain, (~empty(powerset(X1)))). % 0.20/0.44 cnf(i_0_33, plain, (empty(relation_dom(X1))|~empty(X1))). % 0.20/0.44 cnf(i_0_32, plain, (relation(relation_dom(X1))|~empty(X1))). % 0.20/0.44 cnf(i_0_15, plain, (element(esk1_1(X1),X1))). % 0.20/0.44 cnf(i_0_42, plain, (empty(X1)|~empty(esk4_1(X1)))). % 0.20/0.44 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 0.20/0.44 cnf(i_0_51, plain, (element(esk8_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_7, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.20/0.44 cnf(i_0_8, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.20/0.44 cnf(i_0_31, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 0.20/0.44 cnf(i_0_75, plain, (~empty(X2)|~in(X1,X2))). % 0.20/0.44 cnf(i_0_43, plain, (empty(X1)|element(esk4_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_59, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.44 cnf(i_0_14, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1))). % 0.20/0.44 cnf(i_0_61, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_62, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.44 cnf(i_0_27, plain, (function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))). % 0.20/0.44 cnf(i_0_21, plain, (relation(set_intersection2(X1,X2))|~relation(X2)|~relation(X1))). % 0.20/0.44 cnf(i_0_28, plain, (relation(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))). % 0.20/0.44 cnf(i_0_20, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))). % 0.20/0.44 cnf(i_0_19, plain, (relation_empty_yielding(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))). % 0.20/0.44 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.20/0.44 cnf(i_0_63, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_26, plain, (~empty(unordered_pair(X1,X2)))). % 0.20/0.44 cnf(i_0_9, plain, (X1=apply(X2,X3)|in(X3,relation_dom(X2))|X1!=empty_set|~function(X2)|~relation(X2))). % 0.20/0.44 cnf(i_0_10, plain, (X1=empty_set|in(X3,relation_dom(X2))|X1!=apply(X2,X3)|~function(X2)|~relation(X2))). % 0.20/0.44 cnf(i_0_65, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.44 cnf(i_0_71, negated_conjecture, (apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0)!=apply(esk15_0,esk14_0))). % 0.20/0.44 cnf(i_0_64, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.44 cnf(i_0_69, plain, (relation_dom(X1)=set_intersection2(relation_dom(X2),X3)|X1!=relation_dom_restriction(X2,X3)|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))). % 0.20/0.44 cnf(i_0_68, plain, (apply(X2,X1)=apply(X3,X1)|X2!=relation_dom_restriction(X3,X4)|~function(X3)|~function(X2)|~relation(X3)|~relation(X2)|~in(X1,relation_dom(X2)))). % 0.20/0.44 cnf(i_0_35, plain, (in(X1,relation_dom(relation_dom_restriction(X2,X3)))|~function(X2)|~relation(X2)|~in(X1,X3)|~in(X1,relation_dom(X2)))). % 0.20/0.44 cnf(i_0_36, plain, (in(X1,X2)|~function(X3)|~relation(X3)|~in(X1,relation_dom(relation_dom_restriction(X3,X2))))). % 0.20/0.44 cnf(i_0_24, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 0.20/0.44 cnf(i_0_37, plain, (in(X1,relation_dom(X2))|~function(X2)|~relation(X2)|~in(X1,relation_dom(relation_dom_restriction(X2,X3))))). % 0.20/0.44 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)|X1!=apply(X2,X3)|~function(X2)|~relation(X2)|~in(X3,relation_dom(X2)))). % 0.20/0.44 cnf(i_0_67, plain, (X2=relation_dom_restriction(X3,X1)|in(esk12_3(X1,X2,X3),relation_dom(X2))|relation_dom(X2)!=set_intersection2(relation_dom(X3),X1)|~function(X3)|~function(X2)|~relation(X3)|~relation(X2))). % 0.20/0.44 cnf(i_0_11, plain, (X2=apply(X3,X1)|~function(X3)|~relation(X3)|~in(X1,relation_dom(X3))|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 0.20/0.44 cnf(i_0_66, plain, (X1=relation_dom_restriction(X3,X2)|relation_dom(X1)!=set_intersection2(relation_dom(X3),X2)|apply(X1,esk12_3(X2,X1,X3))!=apply(X3,esk12_3(X2,X1,X3))|~function(X3)|~function(X1)|~relation(X3)|~relation(X1))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 8 steps % 0.20/0.44 cnf(i_0_73, negated_conjecture, (function(esk15_0)), inference(start_rule)). % 0.20/0.44 cnf(i_0_80, plain, (function(esk15_0)), inference(extension_rule, [i_0_27])). % 0.20/0.44 cnf(i_0_613, plain, (~relation(esk15_0)), inference(closure_rule, [i_0_74])). % 0.20/0.44 cnf(i_0_611, plain, (function(relation_dom_restriction(esk15_0,esk13_0))), inference(extension_rule, [i_0_9])). % 0.20/0.44 cnf(i_0_1110, plain, (apply(esk15_0,esk14_0)=apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0)), inference(closure_rule, [i_0_71])). % 0.20/0.44 cnf(i_0_1111, plain, (in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))), inference(etableau_closure_rule, [i_0_1111, ...])). % 0.20/0.44 cnf(i_0_1112, plain, (apply(esk15_0,esk14_0)!=empty_set), inference(etableau_closure_rule, [i_0_1112, ...])). % 0.20/0.44 cnf(i_0_1114, plain, (~relation(relation_dom_restriction(esk15_0,esk13_0))), inference(etableau_closure_rule, [i_0_1114, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (18559) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------