%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.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 : n029.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:26:38 EDT 2022 % Result : Theorem 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0. % 0.08/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 : n029.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 21:05:30 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___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 47 Number of unprocessed: 47 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 47 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 9 conjectures. % 0.13/0.37 # There are 9 start rule candidates: % 0.13/0.37 # Found 21 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 9 start rule tableaux created. % 0.13/0.37 # 26 extension rule candidate clauses % 0.13/0.37 # 21 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))). % 0.13/0.39 cnf(i_0_8, negated_conjecture, (l1_orders_2(esk2_0))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r2_hidden(esk4_0,u1_struct_0(esk1_0)))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))). % 0.13/0.39 cnf(i_0_32, plain, (l1_orders_2(esk5_0))). % 0.13/0.39 cnf(i_0_33, plain, (l1_struct_0(esk6_0))). % 0.13/0.39 cnf(i_0_37, plain, (v1_xboole_0(k1_xboole_0))). % 0.13/0.39 cnf(i_0_41, plain, (v1_xboole_0(esk10_0))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))). % 0.13/0.39 cnf(i_0_4, negated_conjecture, (m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))))). % 0.13/0.39 cnf(i_0_48, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)). % 0.13/0.39 cnf(i_0_45, plain, (r1_tarski(X1,X1))). % 0.13/0.39 cnf(i_0_40, plain, (k3_xboole_0(X1,X1)=X1)). % 0.13/0.39 cnf(i_0_35, plain, (m1_subset_1(esk8_1(X1),X1))). % 0.13/0.39 cnf(i_0_34, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))). % 0.13/0.39 cnf(i_0_36, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))). % 0.13/0.39 cnf(i_0_13, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0)))). % 0.13/0.39 cnf(i_0_42, plain, (~v1_xboole_0(esk11_0))). % 0.13/0.39 cnf(i_0_55, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X1))). % 0.13/0.39 cnf(i_0_25, plain, (l1_struct_0(X1)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_54, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.13/0.39 cnf(i_0_11, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))). % 0.13/0.39 cnf(i_0_46, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.13/0.39 cnf(i_0_18, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_51, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.13/0.39 cnf(i_0_50, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.13/0.39 cnf(i_0_53, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X3)|~m1_subset_1(X3,k1_zfmisc_1(X1)))). % 0.13/0.39 cnf(i_0_56, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.13/0.39 cnf(i_0_44, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_12, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.13/0.39 cnf(i_0_17, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))). % 0.13/0.39 cnf(i_0_43, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_49, plain, (v1_xboole_0(X1)|r2_hidden(X2,X1)|~m1_subset_1(X2,X1))). % 0.13/0.39 cnf(i_0_19, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_52, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(X2)))). % 0.13/0.39 cnf(i_0_30, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_16, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))). % 0.13/0.39 cnf(i_0_10, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~v1_orders_2(X1)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_38, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))). % 0.13/0.39 cnf(i_0_39, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))). % 0.13/0.39 cnf(i_0_29, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_14, plain, (r1_orders_2(X1,X2,X3)|~r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1))|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1))|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_15, plain, (r2_hidden(k4_tarski(X1,X2),u1_orders_2(X3))|~r1_orders_2(X3,X1,X2)|~m1_subset_1(X2,u1_struct_0(X3))|~m1_subset_1(X1,u1_struct_0(X3))|~l1_orders_2(X3))). % 0.13/0.39 cnf(i_0_47, plain, (r2_hidden(X1,u1_struct_0(X2))|~r2_hidden(k4_tarski(X1,X3),u1_orders_2(k1_latsum_1(X2,X4)))|~r2_hidden(X3,u1_struct_0(X2))|~v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),X4)|~m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),k1_zfmisc_1(u1_struct_0(X4)))|~l1_# There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 orders_2(X4)|~l1_orders_2(X2))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r2_hidden(esk4_0,u1_struct_0(esk1_0))), inference(start_rule)). % 0.13/0.39 cnf(i_0_63, plain, (r2_hidden(esk4_0,u1_struct_0(esk1_0))), inference(extension_rule, [i_0_55])). % 0.13/0.39 cnf(i_0_66, plain, (~v1_xboole_0(u1_struct_0(esk1_0))), inference(extension_rule, [i_0_49])). % 0.13/0.39 cnf(i_0_98, plain, (r2_hidden(esk3_0,u1_struct_0(esk1_0))), inference(closure_rule, [i_0_1])). % 0.13/0.39 cnf(i_0_99, plain, (~m1_subset_1(esk3_0,u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_99, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_9, negated_conjecture, (l1_orders_2(esk1_0))). % 0.13/0.39 cnf(i_0_8, negated_conjecture, (l1_orders_2(esk2_0))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r2_hidden(esk4_0,u1_struct_0(esk1_0)))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))). % 0.13/0.39 cnf(i_0_32, plain, (l1_orders_2(esk5_0))). % 0.13/0.39 cnf(i_0_33, plain, (l1_struct_0(esk6_0))). % 0.13/0.39 cnf(i_0_37, plain, (v1_xboole_0(k1_xboole_0))). % 0.13/0.39 cnf(i_0_41, plain, (v1_xboole_0(esk10_0))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0))). % 0.13/0.39 cnf(i_0_4, negated_conjecture, (m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))))). % 0.13/0.39 cnf(i_0_48, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)). % 0.13/0.39 cnf(i_0_45, plain, (r1_tarski(X1,X1))). % 0.13/0.39 cnf(i_0_40, plain, (k3_xboole_0(X1,X1)=X1)). % 0.13/0.39 cnf(i_0_35, plain, (m1_subset_1(esk8_1(X1),X1))). % 0.13/0.39 cnf(i_0_34, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))). % 0.13/0.39 cnf(i_0_36, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))). % 0.13/0.39 cnf(i_0_13, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0)))). % 0.13/0.39 cnf(i_0_42, plain, (~v1_xboole_0(esk11_0))). % 0.13/0.39 cnf(i_0_55, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X1))). % 0.13/0.39 cnf(i_0_25, plain, (l1_struct_0(X1)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_54, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.13/0.39 cnf(i_0_11, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))). % 0.13/0.39 cnf(i_0_46, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.13/0.39 cnf(i_0_18, plain, (l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_51, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.13/0.39 cnf(i_0_50, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.13/0.39 cnf(i_0_53, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X3)|~m1_subset_1(X3,k1_zfmisc_1(X1)))). % 0.13/0.39 cnf(i_0_56, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.13/0.39 cnf(i_0_44, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_12, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.13/0.39 cnf(i_0_17, plain, (v1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))). % 0.13/0.39 cnf(i_0_43, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_49, plain, (v1_xboole_0(X1)|r2_hidden(X2,X1)|~m1_subset_1(X2,X1))). % 0.13/0.39 cnf(i_0_19, plain, (v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_52, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(X2)))). % 0.13/0.39 cnf(i_0_30, plain, (m2_relset_1(u1_orders_2(X1),u1_struct_0(X1),u1_struct_0(X1))|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_16, plain, (l1_orders_2(g1_orders_2(X1,X2))|~m1_relset_1(X2,X1,X1))). % 0.13/0.39 cnf(i_0_10, plain, (g1_orders_2(u1_struct_0(X1),u1_orders_2(X1))=X1|~v1_orders_2(X1)|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_38, plain, (X1=X2|g1_orders_2(X3,X1)!=g1_orders_2(X4,X2)|~m1_relset_1(X1,X3,X3))). % 0.13/0.39 cnf(i_0_39, plain, (X1=X2|g1_orders_2(X1,X3)!=g1_orders_2(X2,X4)|~m1_relset_1(X3,X1,X1))). % 0.13/0.39 cnf(i_0_29, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.13/0.39 cnf(i_0_14, plain, (r1_orders_2(X1,X2,X3)|~r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1))|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1))|~l1_orders_2(X1))). % 0.13/0.39 cnf(i_0_15, plain, (r2_hidden(k4_tarski(X1,X2),u1_orders_2(X3))|~r1_orders_2(X3,X1,X2)|~m1_subset_1(X2,u1_struct_0(X3))|~m1_subset_1(X1,u1_struct_0(X3))|~l1_orders_2(X3))). % 0.13/0.39 cnf(i_0_47, plain, (r2_hidden(X1,u1_struct_0(X2))|~r2_hidden(k4_tarski(X1,X3),u1_orders_2(k1_latsum_1(X2,X4)))|~r2_hidden(X3,u1_struct_0(X2))|~v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),X4)|~m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),k1_zfmisc_1(u1_struct_0(X4)))|~l1_orders_2(X4)|~l1_orders_2(X2))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 7 steps % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk3_0,u1_struct_0(esk1_0))), inference(start_rule)). % 0.13/0.39 cnf(i_0_57, plain, (~r2_hidden(esk3_0,u1_struct_0(esk1_0))), inference(extension_rule, [i_0_49])). % 0.13/0.39 cnf(i_0_97, plain, (v1_xboole_0(u1_struct_0(esk1_0))), inference(extension_rule, [i_0_55])). % 0.13/0.39 cnf(i_0_101, plain, (~r2_hidden(esk4_0,u1_struct_0(esk1_0))), inference(closure_rule, [i_0_2])). % 0.13/0.39 cnf(i_0_99, plain, (~m1_subset_1(esk3_0,u1_struct_0(esk1_0))), inference(extension_rule, [i_0_52])). % 0.13/0.39 cnf(i_0_136, plain, (~m1_subset_1(esk8_1(k1_zfmisc_1(u1_struct_0(esk1_0))),k1_zfmisc_1(u1_struct_0(esk1_0)))), inference(closure_rule, [i_0_35])). % 0.13/0.39 cnf(i_0_135, plain, (~r2_hidden(esk3_0,esk8_1(k1_zfmisc_1(u1_struct_0(esk1_0))))), inference(etableau_closure_rule, [i_0_135, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (26023) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------