%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN627-1 : TPTP v8.1.0. Released v2.5.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 : n013.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 21 06:12:55 EDT 2022 % Result : Unsatisfiable 0.20s 0.49s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN627-1 : TPTP v8.1.0. Released v2.5.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.12/0.34 % Computer : n013.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 : Tue Jul 12 01:06:00 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 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 # 36 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 36 conjectures. % 0.12/0.37 # There are 36 start rule candidates: % 0.12/0.37 # Found 10 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 36 start rule tableaux created. % 0.12/0.37 # 26 extension rule candidate clauses % 0.12/0.37 # 10 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.49 # There were 1 total branch saturation attempts. % 0.20/0.49 # There were 0 of these attempts blocked. % 0.20/0.49 # There were 0 deferred branch saturation attempts. % 0.20/0.49 # There were 0 free duplicated saturations. % 0.20/0.49 # There were 1 total successful branch saturations. % 0.20/0.49 # There were 0 successful branch saturations in interreduction. % 0.20/0.49 # There were 0 successful branch saturations on the branch. % 0.20/0.49 # There were 1 successful branch saturations after the branch. % 0.20/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.49 # Begin clausification derivation % 0.20/0.49 % 0.20/0.49 # End clausification derivation % 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.49 cnf(i_0_43, negated_conjecture, (p15(c18,c19))). % 0.20/0.49 cnf(i_0_45, negated_conjecture, (p3(c23,f4(f7(c17,c18),c21)))). % 0.20/0.49 cnf(i_0_46, negated_conjecture, (p16(c17,c20,f9(c19,c18),c21,c22))). % 0.20/0.49 cnf(i_0_37, negated_conjecture, (p10(X1,X1))). % 0.20/0.49 cnf(i_0_38, negated_conjecture, (p8(X1,X1))). % 0.20/0.49 cnf(i_0_39, negated_conjecture, (p6(X1,X1))). % 0.20/0.49 cnf(i_0_40, negated_conjecture, (p5(X1,X1))). % 0.20/0.49 cnf(i_0_41, negated_conjecture, (p3(X1,X1))). % 0.20/0.49 cnf(i_0_42, negated_conjecture, (p2(X1,X1))). % 0.20/0.49 cnf(i_0_44, negated_conjecture, (~p3(c23,c24))). % 0.20/0.49 cnf(i_0_50, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.49 cnf(i_0_48, negated_conjecture, (p10(f12(X1),f12(X2))|~p10(X1,X2))). % 0.20/0.49 cnf(i_0_57, negated_conjecture, (p3(c23,f4(f7(c17,X1),f13(X1)))|~p15(X1,c19))). % 0.20/0.49 cnf(i_0_56, negated_conjecture, (p3(c24,f4(f7(c17,X1),f14(X1)))|~p15(X1,c19))). % 0.20/0.49 cnf(i_0_47, negated_conjecture, (p3(f14(X1),f14(X2))|~p6(X1,X2))). % 0.20/0.49 cnf(i_0_49, negated_conjecture, (p3(f13(X1),f13(X2))|~p6(X1,X2))). % 0.20/0.49 cnf(i_0_51, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.49 cnf(i_0_59, negated_conjecture, (p16(c17,c20,f9(c19,X1),f14(X1),c25)|~p15(X1,c19))). % 0.20/0.49 cnf(i_0_52, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.20/0.49 cnf(i_0_53, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.49 cnf(i_0_54, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.49 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.49 cnf(i_0_58, negated_conjecture, (p16(c17,c20,f9(c19,X1),f13(X1),c22)|~p15(X1,c19))). % 0.20/0.49 cnf(i_0_67, negated_conjecture, (p10(f12(c22),c25)|~p16(c17,c20,X1,X2,f12(c22))|~p16(c17,c20,X1,X3,c25))). % 0.20/0.49 cnf(i_0_65, negated_conjecture, (p10(c22,X1)|~p16(c17,c20,X2,X3,c22)|~p16(c17,c20,X2,X4,X1))). % 0.20/0.49 cnf(i_0_66, negated_conjecture, (p3(X1,X2)|~p16(c17,c20,X3,X1,f12(c22))|~p16(c17,c20,X3,X2,c25))). % 0.20/0.49 cnf(i_0_64, negated_conjecture, (p3(X1,X2)|~p16(c17,c20,X3,X1,c22)|~p16(c17,c20,X3,X2,X4))). % 0.20/0.49 cnf(i_0_60, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p6(X3,X1)|~p8(X4,X2))). % 0.20/0.49 cnf(i_0_61, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p6(X2,X4)|~p8(X1,X3))). % 0.20/0.49 cnf(i_0_63, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.20/0.49 cnf(i_0_62, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))). % 0.20/0.49 cnf(i_0_71, negated_conjecture, (p16(X1,X2,X3,X4,X5)|~p16(X6,X7,X8,X9,X10)|~p3(X7,X2)|~p3(X9,X4)|~p5(X6,X1)|~p8(X8,X3)|~p10(X10,X5))). % 0.20/0.49 cnf(i_0_69, negated_conjecture, (p3(X1,f4(f7(c17,X2),f11(X3,X4,X5,X1,X2)))|~p16(c17,X3,X5,X1,f12(X4))|~p15(X2,X5))). % 0.20/0.49 cnf(i_0_68, negated_conjecture, (p3(f4(f7(c17,X1),f4(f7(c17,X2),X3)),f4(f7(c17,X2),f4(f7(c17,X1),X3)))|p6(X1,X2))). % 0.20/0.49 cnf(i_0_70, negated_conjecture, (p16(c17,X1,f9(X2,X3),f11(X1,X4,X2,X5,X3),X4)|~p16(c17,X1,X2,X5,f12(X4))|~p15(X3,X2))). % 0.20/0.49 cnf(i_0_72, negated_conjecture, (p3(f11(X1,X2,X3,X4,X5),f11(X6,X7,X8,X9,X10))|~p3(X4,X9)|~p3(X1,X6)|~p6(X5,X10)|~p8(X3,X8)|~p10(X2,X7))). % 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.49 # Begin printing tableau % 0.20/0.49 # Found 11 steps % 0.20/0.49 cnf(i_0_61, negated_conjecture, (p8(f9(X28,X27),f9(X28,X27))|~p6(X27,X27)|~p8(X28,X28)), inference(start_rule)). % 0.20/0.49 cnf(i_0_101, plain, (~p6(X27,X27)), inference(closure_rule, [i_0_39])). % 0.20/0.49 cnf(i_0_102, plain, (~p8(X28,X28)), inference(closure_rule, [i_0_38])). % 0.20/0.49 cnf(i_0_100, plain, (p8(f9(X28,X27),f9(X28,X27))), inference(extension_rule, [i_0_72])). % 0.20/0.49 cnf(i_0_162, plain, (~p3(X14,X14)), inference(closure_rule, [i_0_41])). % 0.20/0.49 cnf(i_0_163, plain, (~p3(X11,X11)), inference(closure_rule, [i_0_41])). % 0.20/0.49 cnf(i_0_164, plain, (~p6(X15,X15)), inference(closure_rule, [i_0_39])). % 0.20/0.49 cnf(i_0_166, plain, (~p10(X12,X12)), inference(closure_rule, [i_0_37])). % 0.20/0.49 cnf(i_0_161, plain, (p3(f11(X11,X12,f9(X28,X27),X14,X15),f11(X11,X12,f9(X28,X27),X14,X15))), inference(extension_rule, [i_0_63])). % 0.20/0.49 cnf(i_0_886, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_42])). % 0.20/0.49 cnf(i_0_885, plain, (p3(f4(X5,f11(X11,X12,f9(X28,X27),X14,X15)),f4(X5,f11(X11,X12,f9(X28,X27),X14,X15)))), inference(etableau_closure_rule, [i_0_885, ...])). % 0.20/0.49 # End printing tableau % 0.20/0.49 # SZS output end % 0.20/0.49 # Branches closed with saturation will be marked with an "s" % 0.20/0.49 # Child (19929) has found a proof. % 0.20/0.49 % 0.20/0.49 # Proof search is over... % 0.20/0.49 # Freeing feature tree %------------------------------------------------------------------------------