%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT295+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 : n016.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 : Sun Jul 17 04:50:20 EDT 2022 % Result : Theorem 0.18s 0.51s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : LAT295+1 : TPTP v8.1.0. Released v3.4.0. % 0.06/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.33 % Computer : n016.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 29 23:03:40 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 102 Number of unprocessed: 102 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 102 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 13 conjectures. % 0.12/0.37 # There are 13 start rule candidates: % 0.12/0.37 # Found 50 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 13 start rule tableaux created. % 0.12/0.37 # 52 extension rule candidate clauses % 0.12/0.37 # 50 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.50 # There were 2 total branch saturation attempts. % 0.18/0.50 # There were 0 of these attempts blocked. % 0.18/0.50 # There were 0 deferred branch saturation attempts. % 0.18/0.50 # There were 0 free duplicated saturations. % 0.18/0.50 # There were 2 total successful branch saturations. % 0.18/0.50 # There were 0 successful branch saturations in interreduction. % 0.18/0.50 # There were 0 successful branch saturations on the branch. % 0.18/0.50 # There were 2 successful branch saturations after the branch. % 0.18/0.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.51 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.51 # Begin clausification derivation % 0.18/0.51 % 0.18/0.51 # End clausification derivation % 0.18/0.51 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.51 cnf(i_0_6, negated_conjecture, (esk5_0=esk3_0)). % 0.18/0.51 cnf(i_0_5, negated_conjecture, (esk4_0=esk6_0)). % 0.18/0.51 cnf(i_0_14, negated_conjecture, (l3_lattices(esk1_0))). % 0.18/0.51 cnf(i_0_12, negated_conjecture, (l3_lattices(esk2_0))). % 0.18/0.51 cnf(i_0_62, plain, (l3_lattices(esk10_0))). % 0.18/0.51 cnf(i_0_99, plain, (l3_lattices(esk23_0))). % 0.18/0.51 cnf(i_0_106, plain, (l3_lattices(esk26_0))). % 0.18/0.51 cnf(i_0_98, plain, (v3_lattices(esk23_0))). % 0.18/0.51 cnf(i_0_104, plain, (v3_lattices(esk26_0))). % 0.18/0.51 cnf(i_0_68, plain, (v1_xboole_0(k1_xboole_0))). % 0.18/0.51 cnf(i_0_86, plain, (v1_xboole_0(esk17_0))). % 0.18/0.51 cnf(i_0_88, plain, (v1_xboole_0(esk18_0))). % 0.18/0.51 cnf(i_0_80, plain, (v1_funct_1(esk14_0))). % 0.18/0.51 cnf(i_0_87, plain, (v1_funct_1(esk18_0))). % 0.18/0.51 cnf(i_0_96, plain, (v1_funct_1(esk22_0))). % 0.18/0.51 cnf(i_0_82, plain, (v1_realset1(esk15_0))). % 0.18/0.51 cnf(i_0_81, plain, (v1_relat_1(esk14_0))). % 0.18/0.51 cnf(i_0_89, plain, (v1_relat_1(esk18_0))). % 0.18/0.51 cnf(i_0_97, plain, (v1_relat_1(esk22_0))). % 0.18/0.51 cnf(i_0_95, plain, (v2_funct_1(esk22_0))). % 0.18/0.51 cnf(i_0_61, plain, (l2_lattices(esk9_0))). % 0.18/0.51 cnf(i_0_59, plain, (l1_lattices(esk7_0))). % 0.18/0.51 cnf(i_0_60, plain, (l1_struct_0(esk8_0))). % 0.18/0.51 cnf(i_0_101, plain, (l1_struct_0(esk24_0))). % 0.18/0.51 cnf(i_0_15, negated_conjecture, (~v3_struct_0(esk1_0))). % 0.18/0.51 cnf(i_0_13, negated_conjecture, (~v3_struct_0(esk2_0))). % 0.18/0.51 cnf(i_0_100, plain, (~v3_struct_0(esk24_0))). % 0.18/0.51 cnf(i_0_105, plain, (~v3_struct_0(esk26_0))). % 0.18/0.51 cnf(i_0_83, plain, (~v1_xboole_0(esk15_0))). % 0.18/0.51 cnf(i_0_91, plain, (~v1_xboole_0(esk19_0))). % 0.18/0.51 cnf(i_0_94, plain, (~v1_xboole_0(esk21_0))). % 0.18/0.51 cnf(i_0_90, plain, (~v1_realset1(esk19_0))). % 0.18/0.51 cnf(i_0_117, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.18/0.51 cnf(i_0_92, plain, (v1_xboole_0(esk20_1(X1)))). % 0.18/0.51 cnf(i_0_72, plain, (v1_realset1(k1_tarski(X1)))). % 0.18/0.51 cnf(i_0_73, plain, (v1_finset_1(k1_tarski(X1)))). % 0.18/0.51 cnf(i_0_18, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))). % 0.18/0.51 cnf(i_0_19, plain, (v1_realset1(X1)|~v1_xboole_0(X1))). % 0.18/0.51 cnf(i_0_47, plain, (l2_lattices(X1)|~l3_lattices(X1))). % 0.18/0.51 cnf(i_0_48, plain, (l1_lattices(X1)|~l3_lattices(X1))). % 0.18/0.51 cnf(i_0_46, plain, (l1_struct_0(X1)|~l2_lattices(X1))). % 0.18/0.51 cnf(i_0_44, plain, (l1_struct_0(X1)|~l1_lattices(X1))). % 0.18/0.51 cnf(i_0_110, plain, (r1_tarski(X1,X1))). % 0.18/0.51 cnf(i_0_10, negated_conjecture, (m1_subset_1(esk3_0,u1_struct_0(esk1_0)))). % 0.18/0.51 cnf(i_0_9, negated_conjecture, (m1_subset_1(esk4_0,u1_struct_0(esk1_0)))). % 0.18/0.51 cnf(i_0_8, negated_conjecture, (m1_subset_1(esk5_0,u1_struct_0(esk2_0)))). % 0.18/0.51 cnf(i_0_7, negated_conjecture, (m1_subset_1(esk6_0,u1_struct_0(esk2_0)))). % 0.18/0.51 cnf(i_0_119, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.18/0.51 cnf(i_0_67, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.18/0.51 cnf(i_0_69, plain, (~v1_xboole_0(k1_tarski(X1)))). % 0.18/0.51 cnf(i_0_74, plain, (~v1_xboole_0(k1_tarski(X1)))). % 0.18/0.51 cnf(i_0_58, plain, (v1_funct_1(u2_lattices(X1))|~l2_lattices(X1))). % 0.18/0.51 cnf(i_0_54, plain, (v1_funct_1(u1_lattices(X1))|~l1_lattices(X1))). % 0.18/0.51 cnf(i_0_64, plain, (m1_subset_1(esk12_1(X1),X1))). % 0.18/0.51 cnf(i_0_84, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk16_1(X1)))). % 0.18/0.51 cnf(i_0_21, plain, (v2_funct_1(X1)|~v1_xboole_0(X1)|~v1_funct_1(X1)|~v1_relat_1(X1))). % 0.18/0.51 cnf(i_0_93, plain, (m1_subset_1(esk20_1(X1),k1_zfmisc_1(X1)))). % 0.18/0.51 cnf(i_0_24, plain, (k2_tarski(X1,X2)=k2_tarski(X2,X1))). % 0.18/0.51 cnf(i_0_66, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_102, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk25_1(X1)))). % 0.18/0.51 cnf(i_0_118, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.18/0.51 cnf(i_0_85, plain, (v1_xboole_0(X1)|m1_subset_1(esk16_1(X1),k1_zfmisc_1(X1)))). % 0.18/0.51 cnf(i_0_111, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.18/0.51 cnf(i_0_112, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.18/0.51 cnf(i_0_113, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.18/0.51 cnf(i_0_17, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.18/0.51 cnf(i_0_114, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.18/0.51 cnf(i_0_75, plain, (~v1_xboole_0(k2_tarski(X1,X2)))). % 0.18/0.51 cnf(i_0_103, plain, (v3_struct_0(X1)|m1_subset_1(esk25_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))). % 0.18/0.51 cnf(i_0_76, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 0.18/0.51 cnf(i_0_116, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.18/0.51 cnf(i_0_115, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.18/0.51 cnf(i_0_63, plain, (m1_relset_1(esk11_2(X1,X2),X1,X2))). % 0.18/0.51 cnf(i_0_65, plain, (m2_relset_1(esk13_2(X1,X2),X1,X2))). % 0.18/0.51 cnf(i_0_16, plain, (g3_lattices(u1_struct_0(X1),u2_lattices(X1),u1_lattices(X1))=X1|~l3_lattices(X1)|~v3_lattices(X1))). % 0.18/0.51 cnf(i_0_20, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.18/0.51 cnf(i_0_57, plain, (v1_funct_2(u2_lattices(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l2_lattices(X1))). % 0.18/0.51 cnf(i_0_53, plain, (v1_funct_2(u1_lattices(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_lattices(X1))). % 0.18/0.51 cnf(i_0_56, plain, (m2_relset_1(u2_lattices(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l2_lattices(X1))). % 0.18/0.51 cnf(i_0_52, plain, (m2_relset_1(u1_lattices(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_lattices(X1))). % 0.18/0.51 cnf(i_0_11, negated_conjecture, (g3_lattices(u1_struct_0(esk2_0),u2_lattices(esk2_0),u1_lattices(esk2_0))=g3_lattices(u1_struct_0(esk1_0),u2_lattices(esk1_0),u1_lattices(esk1_0)))). % 0.18/0.51 cnf(i_0_109, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.18/0.51 cnf(i_0_108, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.18/0.51 cnf(i_0_51, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.18/0.51 cnf(i_0_25, plain, (k1_funct_1(X1,k2_tarski(k2_tarski(X2,X3),k1_tarski(X2)))=k1_binop_1(X1,X2,X3)|~v1_funct_1(X1)|~v1_relat_1(X1))). % 0.18/0.51 cnf(i_0_35, plain, (v3_struct_0(X1)|m1_subset_1(k1_lattices(X1,X2,X3),u1_struct_0(X1))|~l2_lattices(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_40, plain, (v3_struct_0(X1)|m1_subset_1(k2_lattices(X1,X2,X3),u1_struct_0(X1))|~l1_lattices(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_29, plain, (k1_lattices(X1,X2,X3)=X3|v3_struct_0(X1)|~l2_lattices(X1)|~r1_lattices(X1,X2,X3)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_28, plain, (v3_struct_0(X1)|r1_lattices(X1,X2,X3)|k1_lattices(X1,X2,X3)!=X3|~l2_lattices(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_4, negated_conjecture, (r1_lattices(esk1_0,esk3_0,esk4_0)|r1_lattices(esk2_0,esk5_0,esk6_0)|k1_lattices(esk2_0,esk5_0,esk6_0)!=k1_lattices(esk1_0,esk3_0,esk4_0)|k2_lattices(esk2_0,esk5_0,esk6_0)!=k2_lattices(esk1_0,esk3_0,esk4_0))). % 0.18/0.51 cnf(i_0_1, negated_conjecture, (k1_lattices(esk2_0,esk5_0,esk6_0)!=k1_lattices(esk1_0,esk3_0,esk4_0)|k2_lattices(esk2_0,esk5_0,esk6_0)!=k2_lattices(esk1_0,esk3_0,esk4_0)|~r1_lattices(esk1_0,esk3_0,esk4_0)|~r1_lattices(esk2_0,esk5_0,esk6_0))). % 0.18/0.51 cnf(i_0_31, plain, (l3_lattices(g3_lattices(X1,X2,X3))|~v1_funct_1(X3)|~v1_funct_1(X2)|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1))). % 0.18/0.51 cnf(i_0_32, plain, (v3_lattices(g3_lattices(X1,X2,X3))|~v1_funct_1(X3)|~v1_funct_1(X2)|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1))). % 0.18/0.51 cnf(i_0_70, plain, (v1_xboole_0(X1)|v3_lattices(g3_lattices(X1,X2,X3))|~v1_funct_1(X3)|~v1_funct_1(X2)|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1))). % 0.18/0.51 cnf(i_0_77, plain, (X1=X2|g3_lattices(X3,X4,X1)!=g3_lattices(X5,X6,X2)|~v1_funct_1(X4)|~v1_funct_1(X1)|~v1_funct_2(X4,k2_zfmisc_1(X3,X3),X3)|~v1_funct_2(X1,k2_zfmisc_1(X3,X3),X3)|~m1_relset_1(X4,k2_zfmisc_1(X3,X3),X3)|~m1_relset_1(X1,k2_zfmisc_1(X3,X3),X3))). % 0.18/0.51 cnf(i_0_78, plain, (X1=X2|g3_lattices(X3,X1,X4)!=g3_lattices(X5,X2,X6)|~v1_funct_1(X4)|~v1_funct_1(X1)|~v1_funct_2(X4,k2_zfmisc_1(X3,X3),X3)|~v1_funct_2(X1,k2_zfmisc_1(X3,X3),X3)|~m1_relset_1(X4,k2_zfmisc_1(X3,X3),X3)|~m1_relset_1(X1,k2_zfmisc_1(X3,X3),X3))). % 0.18/0.51 cnf(i_0_79, plain, (X1=X2|g3_lattices(X1,X3,X4)!=g3_lattices(X2,X5,X6)|~v1_funct_1(X4)|~v1_funct_1(X3)|~v1_funct_2(X4,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X4,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1))). % 0.18/0.51 cnf(i_0_71, plain, (v1_xboole_0(X1)|~v1_funct_1(X3)|~v1_funct_1(X2)|~v3_struct_0(g3_lattices(X1,X2,X3))|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1))). % 0.18/0.51 cnf(i_0_26, plain, (k2_binop_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X1),u2_lattices(X1),X2,X3)=k1_lattices(X1,X2,X3)|v3_struct_0(X1)|~l2_lattices(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_27, plain, (k2_binop_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X1),u1_lattices(X1),X2,X3)=k2_lattices(X1,X2,X3)|v3_struct_0(X1)|~l1_lattices(X1)|~m1_subset_1(X3,u1_struct_0(X1))|~m1_subset_1(X2,u1_struct_0(X1)))). % 0.18/0.51 cnf(i_0_107, plain, (k2_binop_1(X1,X2,X4,X3,X5,X6)=k1_binop_1(X3,X5,X6)|v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_funct_1(X3)|~m1_subset_1(X6,X2)|~m1_subset_1(X5,X1)|~v1_funct_2(X3,k2_zfmisc_1(X1,X2),X4)|~m1_relset_1(X3,k2_zfmisc_1(X1,X2),X4))). % 0.18/0.51 cnf(i_0_39, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|m1_subset_1(k2_binop_1(X1,X2,X4,X3,X5,X6),X4)|~v1_funct_1(X3)|~m1_subset_1(X6,X2)|~m1_subset_1(X5,X1)|~v1_funct_2(X3,k2_zfmisc_1(X1,X2),X4)|~m1_relset_1(X3,k2_zfmisc_1(X1,X2),X4))). % 0.18/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.51 # Begin printing tableau % 0.18/0.51 # Found 5 steps % 0.18/0.51 cnf(i_0_9, negated_conjecture, (m1_subset_1(esk4_0,u1_struct_0(esk1_0))), inference(start_rule)). % 0.18/0.51 cnf(i_0_131, plain, (m1_subset_1(esk4_0,u1_struct_0(esk1_0))), inference(extension_rule, [i_0_112])). % 0.18/0.51 cnf(i_0_178, plain, (v1_xboole_0(u1_struct_0(esk1_0))), inference(extension_rule, [i_0_117])). % 0.18/0.51 cnf(i_0_179, plain, (r2_hidden(esk4_0,u1_struct_0(esk1_0))), inference(etableau_closure_rule, [i_0_179, ...])). % 0.18/0.51 cnf(i_0_181, plain, (u1_struct_0(esk1_0)=k1_xboole_0), inference(etableau_closure_rule, [i_0_181, ...])). % 0.18/0.51 # End printing tableau % 0.18/0.51 # SZS output end % 0.18/0.51 # Branches closed with saturation will be marked with an "s" % 0.18/0.51 # Child (23716) has found a proof. % 0.18/0.51 % 0.18/0.51 # Proof search is over... % 0.18/0.51 # Freeing feature tree %------------------------------------------------------------------------------