%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU446+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 : n005.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:27:09 EDT 2022 % Result : Theorem 2.93s 3.17s % Output : CNFRefutation 2.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU446+1 : TPTP v8.1.0. Released v3.4.0. % 0.11/0.12 % 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 : n005.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 : Mon Jun 20 07:11:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 92 Number of unprocessed: 92 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 2.54/2.76 # The folding up rule is enabled... % 2.54/2.76 # Local unification is enabled... % 2.54/2.76 # Any saturation attempts will use folding labels... % 2.54/2.76 # 92 beginning clauses after preprocessing and clausification % 2.54/2.76 # Creating start rules for all 2 conjectures. % 2.54/2.76 # There are 2 start rule candidates: % 2.54/2.76 # Found 24 unit axioms. % 2.54/2.76 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 2.54/2.76 # 2 start rule tableaux created. % 2.54/2.76 # 68 extension rule candidate clauses % 2.54/2.76 # 24 unit axiom clauses % 2.54/2.76 % 2.54/2.76 # Requested 8, 32 cores available to the main process. % 2.54/2.76 # There are not enough tableaux to fork, creating more from the initial 2 % 2.93/3.17 # There were 1 total branch saturation attempts. % 2.93/3.17 # There were 0 of these attempts blocked. % 2.93/3.17 # There were 0 deferred branch saturation attempts. % 2.93/3.17 # There were 0 free duplicated saturations. % 2.93/3.17 # There were 1 total successful branch saturations. % 2.93/3.17 # There were 0 successful branch saturations in interreduction. % 2.93/3.17 # There were 0 successful branch saturations on the branch. % 2.93/3.17 # There were 1 successful branch saturations after the branch. % 2.93/3.17 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.93/3.17 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.93/3.17 # Begin clausification derivation % 2.93/3.17 % 2.93/3.17 # End clausification derivation % 2.93/3.17 # Begin listing active clauses obtained from FOF to CNF conversion % 2.93/3.17 cnf(i_0_48, plain, (v1_xboole_0(k1_xboole_0))). % 2.93/3.17 cnf(i_0_53, plain, (v1_xboole_0(k1_xboole_0))). % 2.93/3.17 cnf(i_0_68, plain, (v1_xboole_0(esk9_0))). % 2.93/3.17 cnf(i_0_47, plain, (v1_relat_1(k1_xboole_0))). % 2.93/3.17 cnf(i_0_52, plain, (v1_relat_1(k1_xboole_0))). % 2.93/3.17 cnf(i_0_67, plain, (v1_relat_1(esk9_0))). % 2.93/3.17 cnf(i_0_71, plain, (v1_relat_1(esk11_0))). % 2.93/3.17 cnf(i_0_76, plain, (v1_relat_1(esk13_0))). % 2.93/3.17 cnf(i_0_46, plain, (v3_relat_1(k1_xboole_0))). % 2.93/3.17 cnf(i_0_75, plain, (v3_relat_1(esk13_0))). % 2.93/3.17 cnf(i_0_72, plain, (~v1_xboole_0(esk11_0))). % 2.93/3.17 cnf(i_0_101, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_73, plain, (v1_xboole_0(esk12_1(X1)))). % 2.93/3.17 cnf(i_0_4, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_92, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)). % 2.93/3.17 cnf(i_0_84, plain, (r1_tarski(X1,X1))). % 2.93/3.17 cnf(i_0_63, plain, (k3_xboole_0(X1,X1)=X1)). % 2.93/3.17 cnf(i_0_91, plain, (k1_funct_5(X1)=k1_relat_1(X1)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_90, plain, (k2_funct_5(X1)=k2_relat_1(X1)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_103, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_50, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 2.93/3.17 cnf(i_0_45, plain, (v1_xboole_0(k4_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_58, plain, (v1_xboole_0(k1_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_60, plain, (v1_xboole_0(k2_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_44, plain, (v1_relat_1(k4_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_29, plain, (v1_relat_1(k4_relat_1(X1))|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_57, plain, (v1_relat_1(k1_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_59, plain, (v1_relat_1(k2_relat_1(X1))|~v1_xboole_0(X1))). % 2.93/3.17 cnf(i_0_9, plain, (r1_tarski(X1,X2)|X1!=X2)). % 2.93/3.17 cnf(i_0_10, plain, (r1_tarski(X1,X2)|X1!=X2)). % 2.93/3.17 cnf(i_0_65, plain, (k4_relat_1(k4_relat_1(X1))=X1|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_40, plain, (m1_subset_1(esk7_1(X1),X1))). % 2.93/3.17 cnf(i_0_69, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk10_1(X1)))). % 2.93/3.17 cnf(i_0_74, plain, (m1_subset_1(esk12_1(X1),k1_zfmisc_1(X1)))). % 2.93/3.17 cnf(i_0_6, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))). % 2.93/3.17 cnf(i_0_55, plain, (v1_xboole_0(X1)|~v1_relat_1(X1)|~v1_xboole_0(k1_relat_1(X1)))). % 2.93/3.17 cnf(i_0_56, plain, (v1_xboole_0(X1)|~v1_relat_1(X1)|~v1_xboole_0(k2_relat_1(X1)))). % 2.93/3.17 cnf(i_0_102, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 2.93/3.17 cnf(i_0_51, plain, (v1_relat_1(k2_zfmisc_1(X1,X2)))). % 2.93/3.17 cnf(i_0_70, plain, (v1_xboole_0(X1)|m1_subset_1(esk10_1(X1),k1_zfmisc_1(X1)))). % 2.93/3.17 cnf(i_0_88, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 2.93/3.17 cnf(i_0_93, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 2.93/3.17 cnf(i_0_94, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 2.93/3.17 cnf(i_0_43, plain, (v1_xboole_0(k5_relat_1(X1,X2))|~v1_xboole_0(X2)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_62, plain, (v1_xboole_0(k5_relat_1(X1,X2))|~v1_xboole_0(X1)|~v1_relat_1(X2))). % 2.93/3.17 cnf(i_0_49, plain, (v1_relat_1(k3_xboole_0(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_42, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_xboole_0(X2)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_61, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_xboole_0(X1)|~v1_relat_1(X2))). % 2.93/3.17 cnf(i_0_31, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_3, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 2.93/3.17 cnf(i_0_95, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 2.93/3.17 cnf(i_0_8, plain, (X1=X2|~r1_tarski(X2,X1)|~r1_tarski(X1,X2))). % 2.93/3.17 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk1_0,esk2_0))). % 2.93/3.17 cnf(i_0_12, plain, (r1_tarski(X1,X2)|r2_hidden(esk4_2(X1,X2),X1))). % 2.93/3.17 cnf(i_0_54, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 2.93/3.17 cnf(i_0_13, plain, (r2_hidden(X3,X2)|~r2_hidden(X3,X1)|~r1_tarski(X1,X2))). % 2.93/3.17 cnf(i_0_89, plain, (r1_tarski(X1,X3)|~r1_tarski(X2,X3)|~r1_tarski(X1,X2))). % 2.93/3.17 cnf(i_0_18, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X4,X2)|~r2_hidden(X1,X3))). % 2.93/3.17 cnf(i_0_19, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X2,X4)|~r2_hidden(X1,X3))). % 2.93/3.17 cnf(i_0_100, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 2.93/3.17 cnf(i_0_97, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 2.93/3.17 cnf(i_0_11, plain, (r1_tarski(X1,X2)|~r2_hidden(esk4_2(X1,X2),X2))). % 2.93/3.17 cnf(i_0_41, plain, (m2_relset_1(esk8_2(X1,X2),X1,X2))). % 2.93/3.17 cnf(i_0_39, plain, (m1_relset_1(esk6_2(X1,X2),X1,X2))). % 2.93/3.17 cnf(i_0_17, plain, (r2_hidden(X1,X4)|X4!=k3_xboole_0(X2,X3)|~r2_hidden(X1,X3)|~r2_hidden(X1,X2))). % 2.93/3.17 cnf(i_0_87, plain, (k9_relat_1(k5_relat_1(X1,X2),X3)=k9_relat_1(X2,k9_relat_1(X1,X3))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_86, plain, (r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X1,X3))|~v1_relat_1(X1)|~r1_tarski(X2,X3))). % 2.93/3.17 cnf(i_0_5, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 2.93/3.17 cnf(i_0_64, plain, (k5_subset_1(X2,X1,X1)=X1|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 2.93/3.17 cnf(i_0_79, plain, (k5_subset_1(X2,X1,X3)=k3_xboole_0(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 2.93/3.17 cnf(i_0_82, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_83, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_80, plain, (k6_relset_1(X2,X3,X1)=k4_relat_1(X1)|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_78, plain, (k4_relset_1(X2,X3,X1)=k1_relat_1(X1)|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_38, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_7, plain, (k5_subset_1(X2,X1,X3)=k5_subset_1(X2,X3,X1)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 2.93/3.17 cnf(i_0_96, plain, (k9_relat_1(X1,k3_xboole_0(X4,k1_funct_5(X1)))=k9_relat_1(X1,X4)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 2.93/3.17 cnf(i_0_32, plain, (m1_subset_1(k5_subset_1(X2,X1,X3),k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 2.93/3.17 cnf(i_0_30, plain, (m1_subset_1(k4_relset_1(X2,X3,X1),k1_zfmisc_1(X2))|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_85, plain, (r1_tarski(k9_relat_1(X1,k3_xboole_0(X2,X3)),k3_xboole_0(k9_relat_1(X1,X2),k9_relat_1(X1,X3)))|~v1_relat_1(X1))). % 2.93/3.17 cnf(i_0_33, plain, (m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2)|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_66, plain, (k6_relset_1(X2,X3,k6_relset_1(X2,X3,X1))=X1|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_14, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk5_3(X1,X2,X3),X3)|r2_hidden(esk5_3(X1,X2,X3),X2))). % 2.93/3.17 cnf(i_0_15, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk5_3(X1,X2,X3),X3)|r2_hidden(esk5_3(X1,X2,X3),X1))). % 2.93/3.17 cnf(i_0_98, plain, (k2_funct_5(X1)=k10_relset_1(X2,X3,X1,X2)|~m2_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_77, plain, (k10_relset_1(X2,X3,X1,X4)=k9_relat_1(X1,X4)|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_99, plain, (k10_relset_1(X2,X3,k6_relset_1(X3,X2,X1),X2)=k1_funct_5(X1)|~m2_relset_1(X1,X3,X2))). % 2.93/3.17 cnf(i_0_16, plain, (X3=k3_xboole_0(X1,X2)|~r2_hidden(esk5_3(X1,X2,X3),X3)|~r2_hidden(esk5_3(X1,X2,X3),X2)|~r2_hidden(esk5_3(X1,X2,X3),X1))). % 2.93/3.17 cnf(i_0_20, plain, (m1_subset_1(k10_relset_1(X2,X3,X1,X4),k1_zfmisc_1(X3))|~m1_relset_1(X1,X2,X3))). % 2.93/3.17 cnf(i_0_81, plain, (k9_relset_2(X2,X3,X5,X1,X4)=k5_relat_1(X1,X4)|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X3,X5)))|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 2.93/3.17 cnf(i_0_35, plain, (m2_relset_1(k9_relset_2(X2,X3,X5,X1,X4),X2,X5)|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X3,X5)))|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 2.93/3.17 cnf(i_0_1, negated_conjecture, (k10_relset_1(esk2_0,esk2_0,k9_relset_2(esk2_0,esk1_0,esk2_0,k6_relset_1(esk1_0,esk2_0,esk3_0),esk3_0),esk2_0)!=k10_relset_1(esk1_0,esk2_0,esk3_0,esk1_0))). % 2.93/3.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.93/3.17 # Begin printing tableau % 2.93/3.17 # Found 4 steps % 2.93/3.17 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk1_0,esk2_0)), inference(start_rule)). % 2.93/3.17 cnf(i_0_105, plain, (m2_relset_1(esk3_0,esk1_0,esk2_0)), inference(extension_rule, [i_0_99])). % 2.93/3.17 cnf(i_0_428, plain, (k10_relset_1(esk2_0,esk1_0,k6_relset_1(esk1_0,esk2_0,esk3_0),esk2_0)=k1_funct_5(esk3_0)), inference(extension_rule, [i_0_9])). % 2.93/3.17 cnf(i_0_467, plain, (r1_tarski(k10_relset_1(esk2_0,esk1_0,k6_relset_1(esk1_0,esk2_0,esk3_0),esk2_0),k1_funct_5(esk3_0))), inference(etableau_closure_rule, [i_0_467, ...])). % 2.93/3.17 # End printing tableau % 2.93/3.17 # SZS output end % 2.93/3.17 # Branches closed with saturation will be marked with an "s" % 2.93/3.17 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 2.93/3.17 # We now have 6 tableaux to operate on % 2.93/3.17 # Found closed tableau during pool population. % 2.93/3.17 # Proof search is over... % 2.93/3.17 # Freeing feature tree %------------------------------------------------------------------------------