%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP638+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 : Sat Jul 16 09:07:30 EDT 2022 % Result : Theorem 0.20s 0.45s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP638+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.35 % Computer : n029.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 13 11:17:40 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 84 Number of unprocessed: 84 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 84 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 20 conjectures. % 0.13/0.38 # There are 20 start rule candidates: % 0.13/0.38 # Found 41 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 20 start rule tableaux created. % 0.13/0.38 # 43 extension rule candidate clauses % 0.13/0.38 # 41 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.45 # There were 1 total branch saturation attempts. % 0.20/0.45 # There were 0 of these attempts blocked. % 0.20/0.45 # There were 0 deferred branch saturation attempts. % 0.20/0.45 # There were 0 free duplicated saturations. % 0.20/0.45 # There were 1 total successful branch saturations. % 0.20/0.45 # There were 0 successful branch saturations in interreduction. % 0.20/0.45 # There were 0 successful branch saturations on the branch. % 0.20/0.45 # There were 1 successful branch saturations after the branch. % 0.20/0.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.45 # Begin clausification derivation % 0.20/0.45 % 0.20/0.45 # End clausification derivation % 0.20/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.45 cnf(i_0_19, negated_conjecture, (v3_group_1(esk1_0))). % 0.20/0.45 cnf(i_0_15, negated_conjecture, (v3_group_1(esk2_0))). % 0.20/0.45 cnf(i_0_18, negated_conjecture, (v4_group_1(esk1_0))). % 0.20/0.45 cnf(i_0_14, negated_conjecture, (v4_group_1(esk2_0))). % 0.20/0.45 cnf(i_0_17, negated_conjecture, (l1_group_1(esk1_0))). % 0.20/0.45 cnf(i_0_13, negated_conjecture, (l1_group_1(esk2_0))). % 0.20/0.45 cnf(i_0_54, plain, (l1_group_1(esk8_0))). % 0.20/0.45 cnf(i_0_12, negated_conjecture, (v1_funct_1(esk3_0))). % 0.20/0.45 cnf(i_0_63, plain, (v1_xboole_0(k1_xboole_0))). % 0.20/0.45 cnf(i_0_71, plain, (v1_xboole_0(esk17_0))). % 0.20/0.45 cnf(i_0_55, plain, (l1_struct_0(esk9_0))). % 0.20/0.45 cnf(i_0_79, plain, (l1_struct_0(esk21_0))). % 0.20/0.45 cnf(i_0_20, negated_conjecture, (~v3_struct_0(esk1_0))). % 0.20/0.45 cnf(i_0_16, negated_conjecture, (~v3_struct_0(esk2_0))). % 0.20/0.45 cnf(i_0_78, plain, (~v3_struct_0(esk21_0))). % 0.20/0.45 cnf(i_0_77, plain, (~v1_xboole_0(esk20_0))). % 0.20/0.45 cnf(i_0_96, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.20/0.45 cnf(i_0_75, plain, (v1_xboole_0(esk19_1(X1)))). % 0.20/0.45 cnf(i_0_8, negated_conjecture, (m1_group_2(esk4_0,esk2_0))). % 0.20/0.45 cnf(i_0_7, negated_conjecture, (m1_group_2(esk5_0,esk2_0))). % 0.20/0.45 cnf(i_0_6, negated_conjecture, (m1_group_2(esk6_0,esk1_0))). % 0.20/0.45 cnf(i_0_5, negated_conjecture, (m1_group_2(esk7_0,esk1_0))). % 0.20/0.45 cnf(i_0_41, plain, (l1_struct_0(X1)|~l1_group_1(X1))). % 0.20/0.45 cnf(i_0_87, plain, (r1_tarski(X1,X1))). % 0.20/0.45 cnf(i_0_98, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.20/0.45 cnf(i_0_62, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.20/0.45 cnf(i_0_52, plain, (v1_funct_1(u1_group_1(X1))|~l1_group_1(X1))). % 0.20/0.45 cnf(i_0_59, plain, (m1_subset_1(esk13_1(X1),X1))). % 0.20/0.45 cnf(i_0_69, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk16_1(X1)))). % 0.20/0.45 cnf(i_0_76, plain, (m1_subset_1(esk19_1(X1),k1_zfmisc_1(X1)))). % 0.20/0.45 cnf(i_0_61, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))). % 0.20/0.45 cnf(i_0_80, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk22_1(X1)))). % 0.20/0.45 cnf(i_0_97, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.20/0.45 cnf(i_0_66, plain, (v1_funct_1(esk15_2(X1,X2)))). % 0.20/0.45 cnf(i_0_72, plain, (v1_funct_1(esk18_2(X1,X2)))). % 0.20/0.45 cnf(i_0_67, plain, (v1_relat_1(esk15_2(X1,X2)))). % 0.20/0.45 cnf(i_0_73, plain, (v1_relat_1(esk18_2(X1,X2)))). % 0.20/0.45 cnf(i_0_70, plain, (v1_xboole_0(X1)|m1_subset_1(esk16_1(X1),k1_zfmisc_1(X1)))). % 0.20/0.45 cnf(i_0_89, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.20/0.45 cnf(i_0_56, plain, (v3_struct_0(X1)|m1_group_2(esk10_1(X1),X1)|~v3_group_1(X1)|~l1_group_1(X1))). % 0.20/0.45 cnf(i_0_90, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.20/0.45 cnf(i_0_91, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.20/0.45 cnf(i_0_21, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.20/0.45 cnf(i_0_44, plain, (v3_struct_0(X2)|v3_group_1(X1)|~v3_group_1(X2)|~l1_group_1(X2)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_43, plain, (v3_struct_0(X2)|l1_group_1(X1)|~v3_group_1(X2)|~l1_group_1(X2)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_92, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.20/0.45 cnf(i_0_45, plain, (v3_struct_0(X2)|~v3_struct_0(X1)|~v3_group_1(X2)|~l1_group_1(X2)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_10, negated_conjecture, (v1_group_6(esk3_0,esk1_0,esk2_0))). % 0.20/0.45 cnf(i_0_2, negated_conjecture, (m1_group_6(esk4_0,esk2_0,esk5_0))). % 0.20/0.45 cnf(i_0_81, plain, (v3_struct_0(X1)|m1_subset_1(esk22_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))). % 0.20/0.45 cnf(i_0_64, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 0.20/0.45 cnf(i_0_11, negated_conjecture, (v1_funct_2(esk3_0,u1_struct_0(esk1_0),u1_struct_0(esk2_0)))). % 0.20/0.45 cnf(i_0_9, negated_conjecture, (m2_relset_1(esk3_0,u1_struct_0(esk1_0),u1_struct_0(esk2_0)))). % 0.20/0.45 cnf(i_0_94, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.20/0.45 cnf(i_0_93, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.20/0.45 cnf(i_0_1, negated_conjecture, (~m1_group_6(esk6_0,esk1_0,esk7_0))). % 0.20/0.45 cnf(i_0_65, plain, (v1_funct_2(esk15_2(X1,X2),X1,X2))). % 0.20/0.45 cnf(i_0_60, plain, (m2_relset_1(esk14_2(X1,X2),X1,X2))). % 0.20/0.45 cnf(i_0_58, plain, (m1_relset_1(esk12_2(X1,X2),X1,X2))). % 0.20/0.45 cnf(i_0_68, plain, (m1_relset_1(esk15_2(X1,X2),X1,X2))). % 0.20/0.45 cnf(i_0_74, plain, (m1_relset_1(esk18_2(X1,X2),X1,X2))). % 0.20/0.45 cnf(i_0_34, plain, (v3_struct_0(X2)|v3_struct_0(X1)|r1_tarski(u1_struct_0(X1),u1_struct_0(X2))|~v3_group_1(X2)|~v3_group_1(X1)|~l1_group_1(X2)|~l1_group_1(X1)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_33, plain, (k1_realset1(u1_group_1(X2),u1_struct_0(X1))=u1_group_1(X1)|v3_struct_0(X2)|v3_struct_0(X1)|~v3_group_1(X2)|~v3_group_1(X1)|~l1_group_1(X2)|~l1_group_1(X1)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_88, plain, (r1_tarski(k10_relat_1(X1,X2),k10_relat_1(X1,X3))|~v1_relat_1(X1)|~r1_tarski(X2,X3))). % 0.20/0.45 cnf(i_0_24, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 0.20/0.45 cnf(i_0_51, plain, (v1_funct_2(u1_group_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_group_1(X1))). % 0.20/0.45 cnf(i_0_50, plain, (m2_relset_1(u1_group_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_group_1(X1))). % 0.20/0.45 cnf(i_0_83, plain, (v3_struct_0(X3)|m1_group_6(X1,X3,X2)|~v3_group_1(X3)|~v4_group_1(X3)|~l1_group_1(X3)|~m1_group_2(X2,X3)|~m1_group_2(X1,X2))). % 0.20/0.45 cnf(i_0_95, plain, (v3_struct_0(X1)|m1_group_2(X2,X3)|~v3_group_1(X1)|~v4_group_1(X1)|~l1_group_1(X1)|~m1_group_2(X3,X1)|~m1_group_2(X2,X1)|~r1_tarski(u1_struct_0(X2),u1_struct_0(X3)))). % 0.20/0.45 cnf(i_0_57, plain, (v3_struct_0(X1)|m1_group_6(esk11_2(X1,X2),X1,X2)|~v3_group_1(X1)|~v4_group_1(X1)|~l1_group_1(X1)|~m1_group_2(X2,X1))). % 0.20/0.45 cnf(i_0_85, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_86, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_32, plain, (v3_struct_0(X2)|v3_struct_0(X1)|m1_group_2(X1,X2)|k1_realset1(u1_group_1(X2),u1_struct_0(X1))!=u1_group_1(X1)|~v3_group_1(X2)|~v3_group_1(X1)|~l1_group_1(X2)|~l1_group_1(X1)|~r1_tarski(u1_struct_0(X1),u1_struct_0(X2)))). % 0.20/0.45 cnf(i_0_84, plain, (v3_struct_0(X2)|m1_group_2(X1,X3)|~v3_group_1(X2)|~v4_group_1(X2)|~l1_group_1(X2)|~m1_group_2(X3,X2)|~m1_group_6(X1,X2,X3))). % 0.20/0.45 cnf(i_0_46, plain, (v3_struct_0(X1)|m1_group_2(X3,X1)|~v3_group_1(X1)|~v4_group_1(X1)|~l1_group_1(X1)|~m1_group_2(X2,X1)|~m1_group_6(X3,X1,X2))). % 0.20/0.45 cnf(i_0_49, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_30, plain, (v1_xboole_0(X3)|v1_xboole_0(X2)|~v1_funct_1(X1)|~v1_xboole_0(X1)|~v1_funct_2(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_22, plain, (v1_funct_2(X1,X2,X3)|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3)|~v1_partfun1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_26, plain, (v1_xboole_0(X3)|v1_partfun1(X1,X2,X3)|~v1_funct_1(X1)|~v1_funct_2(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_29, plain, (v1_xboole_0(X3)|v1_xboole_0(X2)|v1_partfun1(X1,X2,X3)|~v1_funct_1(X1)|~v1_funct_2(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_4, negated_conjecture, (k3_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk2_0),esk3_0,u1_struct_0(esk4_0))=u1_struct_0(esk6_0))). % 0.20/0.45 cnf(i_0_3, negated_conjecture, (k3_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk2_0),esk3_0,u1_struct_0(esk5_0))=u1_struct_0(esk7_0))). % 0.20/0.45 cnf(i_0_82, plain, (k3_funct_2(X2,X3,X1,X4)=k10_relat_1(X1,X4)|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 cnf(i_0_40, plain, (m1_subset_1(k3_funct_2(X2,X3,X1,X4),k1_zfmisc_1(X2))|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3))). % 0.20/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.45 # Begin printing tableau % 0.20/0.45 # Found 5 steps % 0.20/0.45 cnf(i_0_13, negated_conjecture, (l1_group_1(esk2_0)), inference(start_rule)). % 0.20/0.45 cnf(i_0_113, plain, (l1_group_1(esk2_0)), inference(extension_rule, [i_0_41])). % 0.20/0.45 cnf(i_0_286, plain, (l1_struct_0(esk2_0)), inference(extension_rule, [i_0_61])). % 0.20/0.45 cnf(i_0_297, plain, (v3_struct_0(esk2_0)), inference(closure_rule, [i_0_16])). % 0.20/0.45 cnf(i_0_299, plain, (~v1_xboole_0(u1_struct_0(esk2_0))), inference(etableau_closure_rule, [i_0_299, ...])). % 0.20/0.45 # End printing tableau % 0.20/0.45 # SZS output end % 0.20/0.45 # Branches closed with saturation will be marked with an "s" % 0.20/0.45 # Child (10438) has found a proof. % 0.20/0.45 % 0.20/0.45 # Proof search is over... % 0.20/0.45 # Freeing feature tree %------------------------------------------------------------------------------