%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT026+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 : Fri Jul 15 00:00:00 EDT 2022 % Result : Theorem 0.19s 0.48s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : CAT026+1 : TPTP v8.1.0. Released v3.4.0. % 0.07/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 : n029.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 : Sun May 29 19:12:43 EDT 2022 % 0.13/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: 60 Number of unprocessed: 60 % 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 # 60 beginning clauses after preprocessing and clausification % 0.19/0.39 # Creating start rules for all 10 conjectures. % 0.19/0.39 # There are 10 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 # 10 start rule tableaux created. % 0.19/0.39 # 40 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.48 # There were 2 total branch saturation attempts. % 0.19/0.48 # There were 0 of these attempts blocked. % 0.19/0.48 # There were 0 deferred branch saturation attempts. % 0.19/0.48 # There were 0 free duplicated saturations. % 0.19/0.48 # There were 2 total successful branch saturations. % 0.19/0.48 # There were 0 successful branch saturations in interreduction. % 0.19/0.48 # There were 0 successful branch saturations on the branch. % 0.19/0.48 # There were 2 successful branch saturations after the branch. % 0.19/0.48 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.48 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.48 # Begin clausification derivation % 0.19/0.48 % 0.19/0.48 # End clausification derivation % 0.19/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.48 cnf(i_0_10, negated_conjecture, (v2_cat_1(esk1_0))). % 0.19/0.48 cnf(i_0_8, negated_conjecture, (v2_cat_1(esk2_0))). % 0.19/0.48 cnf(i_0_6, negated_conjecture, (v2_cat_1(esk3_0))). % 0.19/0.48 cnf(i_0_9, negated_conjecture, (l1_cat_1(esk1_0))). % 0.19/0.48 cnf(i_0_7, negated_conjecture, (l1_cat_1(esk2_0))). % 0.19/0.48 cnf(i_0_5, negated_conjecture, (l1_cat_1(esk3_0))). % 0.19/0.48 cnf(i_0_52, plain, (l1_cat_1(esk13_0))). % 0.19/0.48 cnf(i_0_14, plain, (v1_xboole_0(k1_xboole_0))). % 0.19/0.48 cnf(i_0_31, plain, (v1_xboole_0(esk9_0))). % 0.19/0.48 cnf(i_0_34, plain, (~v1_xboole_0(esk11_0))). % 0.19/0.48 cnf(i_0_38, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.19/0.48 cnf(i_0_32, plain, (v1_xboole_0(esk10_1(X1)))). % 0.19/0.48 cnf(i_0_11, plain, (r1_tarski(X1,X1))). % 0.19/0.48 cnf(i_0_40, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.19/0.48 cnf(i_0_27, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.19/0.48 cnf(i_0_19, plain, (m1_subset_1(esk7_1(X1),X1))). % 0.19/0.48 cnf(i_0_29, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk8_1(X1)))). % 0.19/0.48 cnf(i_0_50, plain, (~l1_cat_1(X1)|~v1_xboole_0(u2_cat_1(X1)))). % 0.19/0.48 cnf(i_0_33, plain, (m1_subset_1(esk10_1(X1),k1_zfmisc_1(X1)))). % 0.19/0.48 cnf(i_0_39, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.19/0.48 cnf(i_0_30, plain, (v1_xboole_0(X1)|m1_subset_1(esk8_1(X1),k1_zfmisc_1(X1)))). % 0.19/0.48 cnf(i_0_15, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.19/0.48 cnf(i_0_35, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.19/0.48 cnf(i_0_36, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.19/0.48 cnf(i_0_46, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 0.19/0.48 cnf(i_0_12, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.19/0.48 cnf(i_0_37, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.19/0.48 cnf(i_0_42, plain, (k16_cat_2(X1,X2)=k8_isocat_2(X1,X2)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_43, plain, (k17_cat_2(X1,X2)=k9_isocat_2(X1,X2)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_28, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 0.19/0.48 cnf(i_0_56, plain, (v2_cat_1(k11_cat_2(X1,X2))|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_55, plain, (l1_cat_1(k11_cat_2(X1,X2))|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_17, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.19/0.48 cnf(i_0_16, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.19/0.48 cnf(i_0_4, negated_conjecture, (m2_cat_1(esk4_0,esk1_0,k11_cat_2(esk2_0,esk3_0)))). % 0.19/0.48 cnf(i_0_3, negated_conjecture, (m2_cat_1(esk5_0,esk1_0,k11_cat_2(esk2_0,esk3_0)))). % 0.19/0.48 cnf(i_0_18, plain, (m1_relset_1(esk6_2(X1,X2),X1,X2))). % 0.19/0.48 cnf(i_0_41, plain, (m2_relset_1(esk12_2(X1,X2),X1,X2))). % 0.19/0.48 cnf(i_0_53, plain, (m2_cat_1(esk14_2(X1,X2),X1,X2)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_26, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.19/0.48 cnf(i_0_63, plain, (v1_funct_1(X1)|~v2_cat_1(X3)|~v2_cat_1(X2)|~l1_cat_1(X3)|~l1_cat_1(X2)|~m2_cat_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_20, plain, (m2_cat_1(k16_cat_2(X1,X2),k11_cat_2(X1,X2),X1)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_21, plain, (m2_cat_1(k17_cat_2(X1,X2),k11_cat_2(X1,X2),X2)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_47, plain, (m2_cat_1(k8_isocat_2(X1,X2),k11_cat_2(X1,X2),X1)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_48, plain, (m2_cat_1(k9_isocat_2(X1,X2),k11_cat_2(X1,X2),X2)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1))). % 0.19/0.48 cnf(i_0_45, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_44, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_49, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_61, plain, (m2_relset_1(X1,u2_cat_1(X2),u2_cat_1(X3))|~v2_cat_1(X3)|~v2_cat_1(X2)|~l1_cat_1(X3)|~l1_cat_1(X2)|~m2_cat_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_62, plain, (v1_funct_2(X1,u2_cat_1(X2),u2_cat_1(X3))|~v2_cat_1(X3)|~v2_cat_1(X2)|~l1_cat_1(X3)|~l1_cat_1(X2)|~m2_cat_1(X1,X2,X3))). % 0.19/0.48 cnf(i_0_2, negated_conjecture, (r2_nattra_1(esk1_0,k11_cat_2(esk2_0,esk3_0),esk4_0,esk5_0))). % 0.19/0.48 cnf(i_0_51, plain, (r2_nattra_1(X1,X2,X3,X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X4,X1,X2)|~m2_cat_1(X3,X1,X2))). % 0.19/0.48 cnf(i_0_57, plain, (m2_cat_1(k11_isocat_2(X1,X2,X3,X4),X1,X2)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X4,X1,k11_cat_2(X2,X3)))). % 0.19/0.48 cnf(i_0_58, plain, (m2_cat_1(k12_isocat_2(X1,X2,X3,X4),X1,X3)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X4,X1,k11_cat_2(X2,X3)))). % 0.19/0.48 cnf(i_0_54, plain, (k2_isocat_1(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X5,X2,X3)|~m2_cat_1(X4,X1,X2))). % 0.19/0.48 cnf(i_0_64, plain, (k2_isocat_1(X1,k11_cat_2(X2,X3),X2,X4,k8_isocat_2(X2,X3))=k11_isocat_2(X1,X2,X3,X4)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X4,X1,k11_cat_2(X2,X3)))). % 0.19/0.48 cnf(i_0_65, plain, (k2_isocat_1(X1,k11_cat_2(X2,X3),X3,X4,k9_isocat_2(X2,X3))=k12_isocat_2(X1,X2,X3,X4)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X4,X1,k11_cat_2(X2,X3)))). % 0.19/0.48 cnf(i_0_59, plain, (m2_cat_1(k2_isocat_1(X1,X2,X3,X4,X5),X1,X3)|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X5,X2,X3)|~m2_cat_1(X4,X1,X2))). % 0.19/0.48 cnf(i_0_1, negated_conjecture, (~r2_nattra_1(esk1_0,esk2_0,k11_isocat_2(esk1_0,esk2_0,esk3_0,esk4_0),k11_isocat_2(esk1_0,esk2_0,esk3_0,esk5_0))|~r2_nattra_1(esk1_0,esk3_0,k12_isocat_2(esk1_0,esk2_0,esk3_0,esk4_0),k12_isocat_2(esk1_0,esk2_0,esk3_0,esk5_0)))). % 0.19/0.48 cnf(i_0_66, plain, (r2_nattra_1(X1,X3,k2_isocat_1(X1,X2,X3,X4,X6),k2_isocat_1(X1,X2,X3,X5,X7))|~v2_cat_1(X3)|~v2_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X3)|~l1_cat_1(X2)|~l1_cat_1(X1)|~m2_cat_1(X7,X2,X3)|~m2_cat_1(X6,X2,X3)|~m2_cat_1(X5,X1,X2)|~m2_cat_1(X4,X1,X2)|~r2_nattra_1(X2,X3,X6,X7)|~r2_nattra_1(X1,X2,X4,X5))). % 0.19/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.48 # Begin printing tableau % 0.19/0.48 # Found 10 steps % 0.19/0.48 cnf(i_0_6, negated_conjecture, (v2_cat_1(esk3_0)), inference(start_rule)). % 0.19/0.48 cnf(i_0_75, plain, (v2_cat_1(esk3_0)), inference(extension_rule, [i_0_56])). % 0.19/0.48 cnf(i_0_1606, plain, (~v2_cat_1(esk3_0)), inference(closure_rule, [i_0_6])). % 0.19/0.48 cnf(i_0_1607, plain, (~l1_cat_1(esk3_0)), inference(closure_rule, [i_0_5])). % 0.19/0.48 cnf(i_0_1608, plain, (~l1_cat_1(esk3_0)), inference(closure_rule, [i_0_5])). % 0.19/0.48 cnf(i_0_1604, plain, (v2_cat_1(k11_cat_2(esk3_0,esk3_0))), inference(extension_rule, [i_0_55])). % 0.19/0.48 cnf(i_0_1641, plain, (~v2_cat_1(esk3_0)), inference(closure_rule, [i_0_6])). % 0.19/0.48 cnf(i_0_1643, plain, (~l1_cat_1(esk3_0)), inference(closure_rule, [i_0_5])). % 0.19/0.48 cnf(i_0_1639, plain, (l1_cat_1(k11_cat_2(esk3_0,k11_cat_2(esk3_0,esk3_0)))), inference(etableau_closure_rule, [i_0_1639, ...])). % 0.19/0.48 cnf(i_0_1642, plain, (~l1_cat_1(k11_cat_2(esk3_0,esk3_0))), inference(etableau_closure_rule, [i_0_1642, ...])). % 0.19/0.48 # End printing tableau % 0.19/0.48 # SZS output end % 0.19/0.48 # Branches closed with saturation will be marked with an "s" % 0.19/0.49 # Child (30980) has found a proof. % 0.19/0.49 % 0.19/0.49 # Proof search is over... % 0.19/0.49 # Freeing feature tree %------------------------------------------------------------------------------