%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU243+1 : TPTP v8.1.0. Released v3.3.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 : n025.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:25:09 EDT 2022 % Result : Theorem 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SEU243+1 : TPTP v8.1.0. Released v3.3.0. % 0.10/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.33 % Computer : n025.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jun 19 20:25:29 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Number of axioms: 45 Number of unprocessed: 45 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 45 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 3 conjectures. % 0.13/0.36 # There are 3 start rule candidates: % 0.13/0.36 # Found 17 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 3 start rule tableaux created. % 0.13/0.36 # 28 extension rule candidate clauses % 0.13/0.36 # 17 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 9 tableaux to operate on % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_27, plain, (empty(empty_set))). % 0.13/0.38 cnf(i_0_33, plain, (empty(esk7_0))). % 0.13/0.38 cnf(i_0_35, plain, (empty(esk8_0))). % 0.13/0.38 cnf(i_0_31, plain, (function(esk6_0))). % 0.13/0.38 cnf(i_0_34, plain, (function(esk8_0))). % 0.13/0.38 cnf(i_0_39, plain, (function(esk10_0))). % 0.13/0.38 cnf(i_0_32, plain, (relation(esk6_0))). % 0.13/0.38 cnf(i_0_36, plain, (relation(esk8_0))). % 0.13/0.38 cnf(i_0_40, plain, (relation(esk10_0))). % 0.13/0.38 cnf(i_0_52, negated_conjecture, (relation(esk11_0))). % 0.13/0.38 cnf(i_0_38, plain, (one_to_one(esk10_0))). % 0.13/0.38 cnf(i_0_37, plain, (~empty(esk9_0))). % 0.13/0.38 cnf(i_0_53, plain, (X1=empty_set|~empty(X1))). % 0.13/0.38 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.13/0.38 cnf(i_0_43, plain, (set_union2(X1,empty_set)=X1)). % 0.13/0.38 cnf(i_0_41, plain, (subset(X1,X1))). % 0.13/0.38 cnf(i_0_30, plain, (set_union2(X1,X1)=X1)). % 0.13/0.38 cnf(i_0_55, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.13/0.38 cnf(i_0_8, plain, (well_founded_relation(X1)|esk2_1(X1)!=empty_set|~relation(X1))). % 0.13/0.38 cnf(i_0_50, negated_conjecture, (well_founded_relation(esk11_0)|is_well_founded_in(esk11_0,relation_field(esk11_0)))). % 0.13/0.38 cnf(i_0_26, plain, (element(esk5_1(X1),X1))). % 0.13/0.38 cnf(i_0_3, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_6, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.13/0.38 cnf(i_0_54, plain, (~empty(X2)|~in(X1,X2))). % 0.13/0.38 cnf(i_0_51, negated_conjecture, (~well_founded_relation(esk11_0)|~is_well_founded_in(esk11_0,relation_field(esk11_0)))). % 0.13/0.38 cnf(i_0_42, plain, (disjoint(X2,X1)|~disjoint(X1,X2))). % 0.13/0.38 cnf(i_0_44, plain, (element(X1,X2)|~in(X1,X2))). % 0.13/0.38 cnf(i_0_17, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_9, plain, (well_founded_relation(X1)|subset(esk2_1(X1),relation_field(X1))|~relation(X1))). % 0.13/0.38 cnf(i_0_45, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.13/0.38 cnf(i_0_46, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.13/0.38 cnf(i_0_13, plain, (is_well_founded_in(X1,X2)|esk4_2(X1,X2)!=empty_set|~relation(X1))). % 0.13/0.38 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.13/0.38 cnf(i_0_47, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.13/0.38 cnf(i_0_29, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.13/0.38 cnf(i_0_28, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.13/0.38 cnf(i_0_14, plain, (is_well_founded_in(X1,X2)|subset(esk4_2(X1,X2),X2)|~relation(X1))). % 0.13/0.38 cnf(i_0_49, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.13/0.38 cnf(i_0_48, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.13/0.38 cnf(i_0_11, plain, (X2=empty_set|in(esk1_2(X1,X2),X2)|~relation(X1)|~well_founded_relation(X1)|~subset(X2,relation_field(X1)))). % 0.13/0.38 cnf(i_0_7, plain, (well_founded_relation(X2)|~relation(X2)|~in(X1,esk2_1(X2))|~disjoint(fiber(X2,X1),esk2_1(X2)))). % 0.13/0.38 cnf(i_0_10, plain, (X2=empty_set|disjoint(fiber(X1,esk1_2(X1,X2)),X2)|~relation(X1)|~well_founded_relation(X1)|~subset(X2,relation_field(X1)))). % 0.13/0.38 cnf(i_0_16, plain, (X3=empty_set|in(esk3_3(X1,X2,X3),X3)|~relation(X1)|~subset(X3,X2)|~is_well_founded_in(X1,X2))). % 0.13/0.38 cnf(i_0_12, plain, (is_well_founded_in(X2,X3)|~relation(X2)|~in(X1,esk4_2(X2,X3))|~disjoint(fiber(X2,X1),esk4_2(X2,X3)))). % 0.13/0.38 cnf(i_0_15, plain, (X3=empty_set|disjoint(fiber(X1,esk3_3(X1,X2,X3)),X3)|~relation(X1)|~subset(X3,X2)|~is_well_founded_in(X1,X2))). % 0.13/0.38 cnf(i_0_389, plain, (X58=X58)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 8 steps % 0.13/0.38 cnf(i_0_389, plain, (esk5_1(set_union2(empty_set,empty_set))=esk5_1(set_union2(empty_set,empty_set))), inference(start_rule)). % 0.13/0.38 cnf(i_0_508, plain, (esk5_1(set_union2(empty_set,empty_set))=esk5_1(set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_393])). % 0.13/0.38 cnf(i_0_600, plain, (set_union2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_43])). % 0.13/0.38 cnf(i_0_598, plain, (in(esk5_1(set_union2(empty_set,empty_set)),empty_set)), inference(extension_rule, [i_0_54])). % 0.13/0.38 cnf(i_0_616, plain, (~empty(empty_set)), inference(closure_rule, [i_0_27])). % 0.13/0.38 cnf(i_0_601, plain, (~in(esk5_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(extension_rule, [i_0_45])). % 0.13/0.38 cnf(i_0_643, plain, (~element(esk5_1(set_union2(empty_set,empty_set)),set_union2(empty_set,empty_set))), inference(closure_rule, [i_0_26])). % 0.13/0.38 cnf(i_0_641, plain, (empty(set_union2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_641, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Child (1597) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------