%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU444+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 : n019.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:07 EDT 2022 % Result : Theorem 0.19s 0.39s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU444+1 : TPTP v8.1.0. Released v3.4.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 20 10:51:54 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.19/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.38 # % 0.19/0.38 # Number of axioms: 50 Number of unprocessed: 50 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.39 # The folding up rule is enabled... % 0.19/0.39 # Local unification is enabled... % 0.19/0.39 # Any saturation attempts will use folding labels... % 0.19/0.39 # 50 beginning clauses after preprocessing and clausification % 0.19/0.39 # Creating start rules for all 2 conjectures. % 0.19/0.39 # There are 2 start rule candidates: % 0.19/0.39 # Found 20 unit axioms. % 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.39 # 2 start rule tableaux created. % 0.19/0.39 # 30 extension rule candidate clauses % 0.19/0.39 # 20 unit axiom clauses % 0.19/0.39 % 0.19/0.39 # Requested 8, 32 cores available to the main process. % 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.39 # There were 1 total branch saturation attempts. % 0.19/0.39 # There were 0 of these attempts blocked. % 0.19/0.39 # There were 0 deferred branch saturation attempts. % 0.19/0.39 # There were 0 free duplicated saturations. % 0.19/0.39 # There were 1 total successful branch saturations. % 0.19/0.39 # There were 0 successful branch saturations in interreduction. % 0.19/0.39 # There were 0 successful branch saturations on the branch. % 0.19/0.39 # There were 1 successful branch saturations after the branch. % 0.19/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.39 # Begin clausification derivation % 0.19/0.39 % 0.19/0.39 # End clausification derivation % 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.39 cnf(i_0_8, plain, (v1_relat_1(k1_xboole_0))). % 0.19/0.39 cnf(i_0_10, plain, (v1_relat_1(k1_xboole_0))). % 0.19/0.39 cnf(i_0_4, plain, (v1_relat_1(esk4_0))). % 0.19/0.39 cnf(i_0_20, plain, (v1_relat_1(esk5_0))). % 0.19/0.39 cnf(i_0_24, plain, (v1_relat_1(esk7_0))). % 0.19/0.39 cnf(i_0_7, plain, (v3_relat_1(k1_xboole_0))). % 0.19/0.39 cnf(i_0_3, plain, (v3_relat_1(esk4_0))). % 0.19/0.39 cnf(i_0_9, plain, (v1_xboole_0(k1_xboole_0))). % 0.19/0.39 cnf(i_0_11, plain, (v1_xboole_0(k1_xboole_0))). % 0.19/0.39 cnf(i_0_21, plain, (v1_xboole_0(esk5_0))). % 0.19/0.39 cnf(i_0_25, plain, (~v1_xboole_0(esk7_0))). % 0.19/0.39 cnf(i_0_29, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.19/0.39 cnf(i_0_26, plain, (v1_xboole_0(esk8_1(X1)))). % 0.19/0.39 cnf(i_0_16, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))). % 0.19/0.39 cnf(i_0_15, plain, (r1_tarski(X1,X1))). % 0.19/0.39 cnf(i_0_31, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.19/0.39 cnf(i_0_42, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.19/0.39 cnf(i_0_37, plain, (v1_relat_1(k4_relat_1(X1))|~v1_relat_1(X1))). % 0.19/0.39 cnf(i_0_17, plain, (v1_relat_1(k4_relat_1(X1))|~v1_xboole_0(X1))). % 0.19/0.39 cnf(i_0_18, plain, (v1_xboole_0(k4_relat_1(X1))|~v1_xboole_0(X1))). % 0.19/0.39 cnf(i_0_32, plain, (k4_relat_1(k4_relat_1(X1))=X1|~v1_relat_1(X1))). % 0.19/0.39 cnf(i_0_34, plain, (m1_subset_1(esk10_1(X1),X1))). % 0.19/0.39 cnf(i_0_22, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk6_1(X1)))). % 0.19/0.39 cnf(i_0_27, plain, (m1_subset_1(esk8_1(X1),k1_zfmisc_1(X1)))). % 0.19/0.39 cnf(i_0_30, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.19/0.39 cnf(i_0_43, plain, (v1_relat_1(k2_zfmisc_1(X1,X2)))). % 0.19/0.39 cnf(i_0_23, plain, (v1_xboole_0(X1)|m1_subset_1(esk6_1(X1),k1_zfmisc_1(X1)))). % 0.19/0.39 cnf(i_0_12, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.19/0.39 cnf(i_0_28, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.19/0.39 cnf(i_0_44, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.19/0.39 cnf(i_0_5, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.19/0.39 cnf(i_0_45, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.19/0.39 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk2_0,esk1_0))). % 0.19/0.39 cnf(i_0_19, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 0.19/0.39 cnf(i_0_14, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.19/0.39 cnf(i_0_13, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.19/0.39 cnf(i_0_47, plain, (m2_relset_1(esk11_2(X1,X2),X1,X2))). % 0.19/0.39 cnf(i_0_33, plain, (m1_relset_1(esk9_2(X1,X2),X1,X2))). % 0.19/0.39 cnf(i_0_41, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.19/0.39 cnf(i_0_50, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_51, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_49, plain, (k6_relset_1(X2,X3,X1)=k4_relat_1(X1)|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_56, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_55, plain, (m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2)|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_46, plain, (k6_relset_1(X2,X3,k6_relset_1(X2,X3,X1))=X1|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_57, plain, (k2_funct_5(X1)=k10_relset_1(X2,X3,X1,X2)|~m2_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_48, plain, (k10_relset_1(X2,X3,X1,X4)=k9_relat_1(X1,X4)|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_58, plain, (k10_relset_1(X2,X3,k6_relset_1(X3,X2,X1),X2)=k1_funct_5(X1)|~m2_relset_1(X1,X3,X2))). % 0.19/0.39 cnf(i_0_52, plain, (m1_subset_1(k10_relset_1(X2,X3,X1,X4),k1_zfmisc_1(X3))|~m1_relset_1(X1,X2,X3))). % 0.19/0.39 cnf(i_0_1, negated_conjecture, (k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)!=k1_funct_5(esk3_0)|k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))!=k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)))). % 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.39 # Begin printing tableau % 0.19/0.39 # Found 4 steps % 0.19/0.39 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk2_0,esk1_0)), inference(start_rule)). % 0.19/0.39 cnf(i_0_61, plain, (m2_relset_1(esk3_0,esk2_0,esk1_0)), inference(extension_rule, [i_0_58])). % 0.19/0.39 cnf(i_0_251, plain, (k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)=k1_funct_5(esk3_0)), inference(extension_rule, [i_0_1])). % 0.19/0.39 cnf(i_0_321, plain, (k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))!=k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0))), inference(etableau_closure_rule, [i_0_321, ...])). % 0.19/0.39 # End printing tableau % 0.19/0.39 # SZS output end % 0.19/0.39 # Branches closed with saturation will be marked with an "s" % 0.19/0.39 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.19/0.39 # We now have 7 tableaux to operate on % 0.19/0.39 # Found closed tableau during pool population. % 0.19/0.39 # Proof search is over... % 0.19/0.39 # Freeing feature tree %------------------------------------------------------------------------------