%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG226+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 : n028.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 : Thu Jul 14 16:52:09 EDT 2022 % Result : Theorem 283.11s 35.94s % Output : CNFRefutation 283.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : ALG226+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.12/0.33 % Computer : n028.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 8 22:14:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 101 Number of unprocessed: 101 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # 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 # 101 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 8 conjectures. % 0.12/0.37 # There are 8 start rule candidates: % 0.12/0.37 # Found 49 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 8 start rule tableaux created. % 0.12/0.37 # 52 extension rule candidate clauses % 0.12/0.37 # 49 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 283.11/35.94 # There were 13 total branch saturation attempts. % 283.11/35.94 # There were 0 of these attempts blocked. % 283.11/35.94 # There were 0 deferred branch saturation attempts. % 283.11/35.94 # There were 0 free duplicated saturations. % 283.11/35.94 # There were 6 total successful branch saturations. % 283.11/35.94 # There were 0 successful branch saturations in interreduction. % 283.11/35.94 # There were 0 successful branch saturations on the branch. % 283.11/35.94 # There were 6 successful branch saturations after the branch. % 283.11/35.94 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 283.11/35.94 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 283.11/35.94 # Begin clausification derivation % 283.11/35.94 % 283.11/35.94 # End clausification derivation % 283.11/35.94 # Begin listing active clauses obtained from FOF to CNF conversion % 283.11/35.94 cnf(i_0_46, plain, (v1_xboole_0(k1_xboole_0))). % 283.11/35.94 cnf(i_0_64, plain, (v1_xboole_0(esk10_0))). % 283.11/35.94 cnf(i_0_72, plain, (v1_xboole_0(esk14_0))). % 283.11/35.94 cnf(i_0_74, plain, (v1_xboole_0(esk15_0))). % 283.11/35.94 cnf(i_0_7, negated_conjecture, (v2_relat_1(esk2_0))). % 283.11/35.94 cnf(i_0_5, negated_conjecture, (v2_relat_1(esk3_0))). % 283.11/35.94 cnf(i_0_92, plain, (v2_relat_1(esk21_0))). % 283.11/35.94 cnf(i_0_59, plain, (v1_fraenkel(esk10_0))). % 283.11/35.94 cnf(i_0_60, plain, (v1_finset_1(esk10_0))). % 283.11/35.94 cnf(i_0_65, plain, (v1_finset_1(esk11_0))). % 283.11/35.94 cnf(i_0_62, plain, (v1_funct_1(esk10_0))). % 283.11/35.94 cnf(i_0_67, plain, (v1_funct_1(esk12_0))). % 283.11/35.94 cnf(i_0_69, plain, (v1_funct_1(esk13_0))). % 283.11/35.94 cnf(i_0_73, plain, (v1_funct_1(esk15_0))). % 283.11/35.94 cnf(i_0_82, plain, (v1_funct_1(esk18_0))). % 283.11/35.94 cnf(i_0_88, plain, (v1_funct_1(esk20_0))). % 283.11/35.94 cnf(i_0_91, plain, (v1_funct_1(esk21_0))). % 283.11/35.94 cnf(i_0_70, plain, (v3_relat_1(esk13_0))). % 283.11/35.94 cnf(i_0_89, plain, (v3_relat_1(esk20_0))). % 283.11/35.94 cnf(i_0_63, plain, (v1_relat_1(esk10_0))). % 283.11/35.94 cnf(i_0_68, plain, (v1_relat_1(esk12_0))). % 283.11/35.94 cnf(i_0_71, plain, (v1_relat_1(esk13_0))). % 283.11/35.94 cnf(i_0_75, plain, (v1_relat_1(esk15_0))). % 283.11/35.94 cnf(i_0_83, plain, (v1_relat_1(esk18_0))). % 283.11/35.94 cnf(i_0_90, plain, (v1_relat_1(esk20_0))). % 283.11/35.94 cnf(i_0_93, plain, (v1_relat_1(esk21_0))). % 283.11/35.94 cnf(i_0_61, plain, (v2_funct_1(esk10_0))). % 283.11/35.94 cnf(i_0_81, plain, (v2_funct_1(esk18_0))). % 283.11/35.94 cnf(i_0_8, negated_conjecture, (~v1_xboole_0(esk1_0))). % 283.11/35.94 cnf(i_0_66, plain, (~v1_xboole_0(esk11_0))). % 283.11/35.94 cnf(i_0_80, plain, (~v1_xboole_0(esk17_0))). % 283.11/35.94 cnf(i_0_103, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 283.11/35.94 cnf(i_0_85, plain, (v2_relat_1(esk19_1(X1)))). % 283.11/35.94 cnf(i_0_76, plain, (v1_funct_1(esk16_1(X1)))). % 283.11/35.94 cnf(i_0_84, plain, (v1_funct_1(esk19_1(X1)))). % 283.11/35.94 cnf(i_0_77, plain, (v3_relat_1(esk16_1(X1)))). % 283.11/35.94 cnf(i_0_78, plain, (v1_relat_1(esk16_1(X1)))). % 283.11/35.94 cnf(i_0_86, plain, (v1_relat_1(esk19_1(X1)))). % 283.11/35.94 cnf(i_0_6, negated_conjecture, (m1_pboole(esk2_0,esk1_0))). % 283.11/35.94 cnf(i_0_4, negated_conjecture, (m1_pboole(esk3_0,esk1_0))). % 283.11/35.94 cnf(i_0_10, plain, (v1_fraenkel(X1)|~v1_xboole_0(X1))). % 283.11/35.94 cnf(i_0_11, plain, (v1_finset_1(X1)|~v1_xboole_0(X1))). % 283.11/35.94 cnf(i_0_12, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))). % 283.11/35.94 cnf(i_0_99, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)). % 283.11/35.94 cnf(i_0_58, plain, (k3_xboole_0(X1,X1)=X1)). % 283.11/35.94 cnf(i_0_106, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 283.11/35.94 cnf(i_0_42, plain, (m1_pboole(esk6_1(X1),X1))). % 283.11/35.94 cnf(i_0_79, plain, (m1_pboole(esk16_1(X1),X1))). % 283.11/35.94 cnf(i_0_87, plain, (m1_pboole(esk19_1(X1),X1))). % 283.11/35.94 cnf(i_0_43, plain, (m1_subset_1(esk7_1(X1),X1))). % 283.11/35.94 cnf(i_0_3, negated_conjecture, (k1_closure3(esk1_0,esk3_0)=k1_closure3(esk1_0,esk2_0))). % 283.11/35.94 cnf(i_0_15, plain, (v2_funct_1(X1)|~v1_xboole_0(X1)|~v1_funct_1(X1)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_39, plain, (v1_funct_1(X1)|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_40, plain, (v1_relat_1(X1)|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_19, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))). % 283.11/35.94 cnf(i_0_105, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 283.11/35.94 cnf(i_0_98, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 283.11/35.94 cnf(i_0_25, plain, (m1_pboole(X1,X2)|k1_relat_1(X1)!=X2|~v1_funct_1(X1)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_44, plain, (v1_finset_1(k3_xboole_0(X2,X1))|~v1_finset_1(X1))). % 283.11/35.94 cnf(i_0_45, plain, (v1_finset_1(k3_xboole_0(X1,X2))|~v1_finset_1(X1))). % 283.11/35.94 cnf(i_0_38, plain, (v1_relat_1(k7_relat_1(X1,X2))|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_14, plain, (v1_xboole_0(X1)|~v2_relat_1(X2)|~v3_relat_1(X2)|~m1_pboole(X2,X1))). % 283.11/35.94 cnf(i_0_18, plain, (v1_xboole_0(X1)|~v2_relat_1(X2)|~v3_relat_1(X2)|~m1_pboole(X2,X1))). % 283.11/35.94 cnf(i_0_100, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 283.11/35.94 cnf(i_0_26, plain, (k1_relat_1(X1)=X2|~v1_funct_1(X1)|~v1_relat_1(X1)|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_13, plain, (v1_pre_circ(X1,X2)|~v3_relat_1(X1)|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_48, plain, (v1_funct_1(k7_relat_1(X1,X2))|~v1_funct_1(X1)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_49, plain, (v1_relat_1(k7_relat_1(X1,X2))|~v1_funct_1(X1)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_9, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 283.11/35.94 cnf(i_0_107, plain, (k1_relat_1(k7_relat_1(X1,X2))=k3_xboole_0(k1_relat_1(X1),X2)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_31, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X4,X2)|~r2_hidden(X1,X3))). % 283.11/35.94 cnf(i_0_32, plain, (r2_hidden(X1,X2)|X3!=k3_xboole_0(X2,X4)|~r2_hidden(X1,X3))). % 283.11/35.94 cnf(i_0_2, negated_conjecture, (k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0))=k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)))). % 283.11/35.94 cnf(i_0_23, plain, (X1=k1_closure3(X2,X3)|v1_xboole_0(X2)|X1!=a_2_0_closure3(X2,X3)|~m1_pboole(X3,X2))). % 283.11/35.94 cnf(i_0_24, plain, (X1=a_2_0_closure3(X2,X3)|v1_xboole_0(X2)|X1!=k1_closure3(X2,X3)|~m1_pboole(X3,X2))). % 283.11/35.94 cnf(i_0_21, plain, (v2_relat_1(X2)|r2_hidden(esk4_2(X1,X2),X1)|~m1_pboole(X2,X1))). % 283.11/35.94 cnf(i_0_1, negated_conjecture, (~r6_pboole(esk1_0,esk2_0,esk3_0))). % 283.11/35.94 cnf(i_0_101, plain, (X1=X2|r2_hidden(esk22_2(X1,X2),X2)|r2_hidden(esk22_2(X1,X2),X1))). % 283.11/35.94 cnf(i_0_30, plain, (r2_hidden(X1,X4)|X4!=k3_xboole_0(X2,X3)|~r2_hidden(X1,X3)|~r2_hidden(X1,X2))). % 283.11/35.94 cnf(i_0_109, plain, (X1=X2|r2_hidden(esk23_2(X1,X2),k1_relat_1(X1))|k1_relat_1(X1)!=k1_relat_1(X2)|~v1_funct_1(X2)|~v1_funct_1(X1)|~v1_relat_1(X2)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_96, plain, (r6_pboole(X2,X1,X1)|~m1_pboole(X3,X2)|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_22, plain, (~v2_relat_1(X1)|~m1_pboole(X1,X3)|~r2_hidden(X2,X3)|~v1_xboole_0(k1_funct_1(X1,X2)))). % 283.11/35.94 cnf(i_0_94, plain, (r6_pboole(X3,X1,X2)|X1!=X2|~m1_pboole(X2,X3)|~m1_pboole(X1,X3))). % 283.11/35.94 cnf(i_0_47, plain, (v1_xboole_0(X1)|~v2_relat_1(X2)|~m1_pboole(X2,X1)|~m1_subset_1(X3,X1)|~v1_xboole_0(k1_funct_1(X2,X3)))). % 283.11/35.94 cnf(i_0_50, plain, (k1_funct_1(X4,X1)=k1_xboole_0|v1_xboole_0(X2)|r2_hidden(X3,a_2_0_closure3(X2,X4))|X1!=X3|~m1_pboole(X4,X2)|~m1_subset_1(X1,X2))). % 283.11/35.94 cnf(i_0_20, plain, (v2_relat_1(X1)|v1_xboole_0(k1_funct_1(X1,esk4_2(X2,X1)))|~m1_pboole(X1,X2))). % 283.11/35.94 cnf(i_0_54, plain, (k1_funct_1(X4,X1)=k1_xboole_0|v1_xboole_0(X2)|r2_hidden(X3,a_2_1_closure3(X2,X4))|X1!=X3|~v2_relat_1(X4)|~m1_pboole(X4,X2)|~m1_subset_1(X1,X2))). % 283.11/35.94 cnf(i_0_102, plain, (X1=X2|~r2_hidden(esk22_2(X1,X2),X2)|~r2_hidden(esk22_2(X1,X2),X1))). % 283.11/35.94 cnf(i_0_95, plain, (X2=X3|~m1_pboole(X3,X1)|~m1_pboole(X2,X1)|~r6_pboole(X1,X2,X3))). % 283.11/35.94 cnf(i_0_52, plain, (esk8_3(X1,X2,X3)=X1|v1_xboole_0(X2)|~m1_pboole(X3,X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3)))). % 283.11/35.94 cnf(i_0_56, plain, (esk9_3(X1,X2,X3)=X1|v1_xboole_0(X2)|~v2_relat_1(X3)|~m1_pboole(X3,X2)|~r2_hidden(X1,a_2_1_closure3(X2,X3)))). % 283.11/35.94 cnf(i_0_108, plain, (X1=X2|k1_relat_1(X1)!=k1_relat_1(X2)|k1_funct_1(X1,esk23_2(X1,X2))!=k1_funct_1(X2,esk23_2(X1,X2))|~v1_funct_1(X2)|~v1_funct_1(X1)|~v1_relat_1(X2)|~v1_relat_1(X1))). % 283.11/35.94 cnf(i_0_104, plain, (k1_funct_1(k7_relat_1(X1,X3),X2)=k1_funct_1(X1,X2)|~v1_funct_1(X1)|~v1_relat_1(X1)|~r2_hidden(X2,k1_relat_1(k7_relat_1(X1,X3))))). % 283.11/35.94 cnf(i_0_97, plain, (r6_pboole(X2,X3,X1)|~m1_pboole(X3,X2)|~m1_pboole(X1,X2)|~r6_pboole(X2,X1,X3))). % 283.11/35.94 cnf(i_0_53, plain, (v1_xboole_0(X2)|m1_subset_1(esk8_3(X1,X2,X3),X2)|~m1_pboole(X3,X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3)))). % 283.11/35.94 cnf(i_0_57, plain, (v1_xboole_0(X2)|m1_subset_1(esk9_3(X1,X2,X3),X2)|~v2_relat_1(X3)|~m1_pboole(X3,X2)|~r2_hidden(X1,a_2_1_closure3(X2,X3)))). % 283.11/35.94 cnf(i_0_27, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk5_3(X1,X2,X3),X3)|r2_hidden(esk5_3(X1,X2,X3),X2))). % 283.11/35.94 cnf(i_0_28, plain, (X3=k3_xboole_0(X1,X2)|r2_hidden(esk5_3(X1,X2,X3),X3)|r2_hidden(esk5_3(X1,X2,X3),X1))). % 283.11/35.94 cnf(i_0_51, plain, (v1_xboole_0(X3)|k1_funct_1(X1,esk8_3(X2,X3,X1))!=k1_xboole_0|~m1_pboole(X1,X3)|~r2_hidden(X2,a_2_0_closure3(X3,X1)))). % 283.11/35.94 cnf(i_0_55, plain, (v1_xboole_0(X3)|k1_funct_1(X1,esk9_3(X2,X3,X1))!=k1_xboole_0|~v2_relat_1(X1)|~m1_pboole(X1,X3)|~r2_hidden(X2,a_2_1_closure3(X3,X1)))). % 283.11/35.94 cnf(i_0_29, 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))). % 283.11/35.94 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 283.11/35.94 # Begin printing tableau % 283.11/35.94 # Found 12 steps % 283.11/35.94 cnf(i_0_1, negated_conjecture, (~r6_pboole(esk1_0,esk2_0,esk3_0)), inference(start_rule)). % 283.11/35.94 cnf(i_0_110, plain, (~r6_pboole(esk1_0,esk2_0,esk3_0)), inference(extension_rule, [i_0_94])). % 283.11/35.94 cnf(i_0_219, plain, (~m1_pboole(esk3_0,esk1_0)), inference(closure_rule, [i_0_4])). % 283.11/35.94 cnf(i_0_220, plain, (~m1_pboole(esk2_0,esk1_0)), inference(closure_rule, [i_0_6])). % 283.11/35.94 cnf(i_0_218, plain, (esk2_0!=esk3_0), inference(extension_rule, [i_0_109])). % 283.11/35.94 cnf(i_0_1036203, plain, (r2_hidden(esk23_2(esk2_0,esk3_0),k1_relat_1(esk2_0))), inference(extension_rule, [i_0_98])). % 283.11/35.94 cnf(i_0_1036204, plain, (k1_relat_1(esk3_0)!=k1_relat_1(esk2_0)), inference(etableau_closure_rule, [i_0_1036204, ...])). % 283.11/35.94 cnf(i_0_1036205, plain, (~v1_funct_1(esk3_0)), inference(etableau_closure_rule, [i_0_1036205, ...])). % 283.11/35.94 cnf(i_0_1036206, plain, (~v1_funct_1(esk2_0)), inference(etableau_closure_rule, [i_0_1036206, ...])). % 283.11/35.94 cnf(i_0_1036207, plain, (~v1_relat_1(esk3_0)), inference(etableau_closure_rule, [i_0_1036207, ...])). % 283.11/35.94 cnf(i_0_1036208, plain, (~v1_relat_1(esk2_0)), inference(etableau_closure_rule, [i_0_1036208, ...])). % 283.11/35.94 cnf(i_0_1195420, plain, (m1_subset_1(esk23_2(esk2_0,esk3_0),k1_relat_1(esk2_0))), inference(etableau_closure_rule, [i_0_1195420, ...])). % 283.11/35.94 # End printing tableau % 283.11/35.94 # SZS output end % 283.11/35.94 # Branches closed with saturation will be marked with an "s" % 283.11/35.95 # Child (1680) has found a proof. % 283.11/35.95 % 283.11/35.95 # Proof search is over... % 283.11/35.95 # Freeing feature tree %------------------------------------------------------------------------------