%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN641-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 : n008.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:13:01 EDT 2022 % Result : Unsatisfiable 1.83s 0.61s % Output : CNFRefutation 1.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN641-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.13/0.34 % Computer : n008.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 : Mon Jul 11 17:54:53 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 42 Number of unprocessed: 42 % 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 # 42 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 42 conjectures. % 0.13/0.38 # There are 42 start rule candidates: % 0.13/0.38 # Found 15 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 42 start rule tableaux created. % 0.13/0.38 # 27 extension rule candidate clauses % 0.13/0.38 # 15 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 1.83/0.61 # There were 1 total branch saturation attempts. % 1.83/0.61 # There were 0 of these attempts blocked. % 1.83/0.61 # There were 0 deferred branch saturation attempts. % 1.83/0.61 # There were 0 free duplicated saturations. % 1.83/0.61 # There were 1 total successful branch saturations. % 1.83/0.61 # There were 0 successful branch saturations in interreduction. % 1.83/0.61 # There were 0 successful branch saturations on the branch. % 1.83/0.61 # There were 1 successful branch saturations after the branch. % 1.83/0.61 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.83/0.61 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.83/0.61 # Begin clausification derivation % 1.83/0.61 % 1.83/0.61 # End clausification derivation % 1.83/0.61 # Begin listing active clauses obtained from FOF to CNF conversion % 1.83/0.61 cnf(i_0_43, negated_conjecture, (p15(f3(c19)))). % 1.83/0.61 cnf(i_0_44, negated_conjecture, (p15(f3(c18)))). % 1.83/0.61 cnf(i_0_51, negated_conjecture, (p6(f8(f3(c19)),f8(c19)))). % 1.83/0.61 cnf(i_0_56, negated_conjecture, (p6(f8(f3(c18)),f8(c18)))). % 1.83/0.61 cnf(i_0_55, negated_conjecture, (p6(f7(f3(c19)),f7(c19)))). % 1.83/0.61 cnf(i_0_45, negated_conjecture, (p11(X1,X1))). % 1.83/0.61 cnf(i_0_46, negated_conjecture, (p6(X1,X1))). % 1.83/0.61 cnf(i_0_47, negated_conjecture, (p4(X1,X1))). % 1.83/0.61 cnf(i_0_48, negated_conjecture, (p2(X1,X1))). % 1.83/0.61 cnf(i_0_49, negated_conjecture, (p16(X1,X1))). % 1.83/0.61 cnf(i_0_50, negated_conjecture, (p12(X1,X1))). % 1.83/0.61 cnf(i_0_54, negated_conjecture, (p6(f7(f3(c18)),f7(c18)))). % 1.83/0.61 cnf(i_0_53, negated_conjecture, (p4(f5(f3(c19)),f5(c19)))). % 1.83/0.61 cnf(i_0_52, negated_conjecture, (p4(f5(f3(c18)),f5(c18)))). % 1.83/0.61 cnf(i_0_70, negated_conjecture, (~p6(f7(f10(f3(c19),f3(c18))),f9(f7(c19),f7(c18))))). % 1.83/0.61 cnf(i_0_57, negated_conjecture, (p15(X1)|~p2(X2,X1)|~p15(X2))). % 1.83/0.61 cnf(i_0_63, negated_conjecture, (p15(f10(X1,X2))|~p15(X2)|~p15(X1))). % 1.83/0.61 cnf(i_0_59, negated_conjecture, (p6(f8(X1),f8(X2))|~p2(X1,X2))). % 1.83/0.61 cnf(i_0_64, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 1.83/0.61 cnf(i_0_65, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 1.83/0.61 cnf(i_0_66, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 1.83/0.61 cnf(i_0_67, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 1.83/0.61 cnf(i_0_60, negated_conjecture, (p6(f7(X1),f7(X2))|~p2(X1,X2))). % 1.83/0.61 cnf(i_0_61, negated_conjecture, (p4(f5(X1),f5(X2))|~p2(X1,X2))). % 1.83/0.61 cnf(i_0_62, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 1.83/0.61 cnf(i_0_58, negated_conjecture, (p12(f13(X1),f13(X2))|~p11(X1,X2))). % 1.83/0.61 cnf(i_0_71, negated_conjecture, (p17(X1,X2,c19)|p12(f13(X1),c20)|~p17(X1,X2,f3(c19)))). % 1.83/0.61 cnf(i_0_68, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 1.83/0.61 cnf(i_0_69, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 1.83/0.61 cnf(i_0_75, negated_conjecture, (p6(f9(X1,X2),f9(X3,X4))|~p6(X2,X4)|~p6(X1,X3))). % 1.83/0.61 cnf(i_0_77, negated_conjecture, (p4(f14(X1,X2),f14(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 1.83/0.61 cnf(i_0_76, negated_conjecture, (p2(f10(X1,X2),f10(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 1.83/0.61 cnf(i_0_81, negated_conjecture, (p17(X1,X2,X3)|~p17(X4,X5,X6)|~p16(X5,X2)|~p2(X6,X3)|~p11(X4,X1))). % 1.83/0.61 cnf(i_0_73, negated_conjecture, (p17(X1,X2,f3(c19))|p12(f13(X1),c20)|~p17(X1,X2,c19))). % 1.83/0.61 cnf(i_0_72, negated_conjecture, (p17(X1,X2,c18)|p12(f13(X1),c20)|~p17(X1,X2,f3(c18)))). % 1.83/0.61 cnf(i_0_74, negated_conjecture, (p17(X1,X2,f3(c18))|p12(f13(X1),c20)|~p17(X1,X2,c18))). % 1.83/0.61 cnf(i_0_78, negated_conjecture, (p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))|~p15(X2)|~p15(X1))). % 1.83/0.61 cnf(i_0_80, negated_conjecture, (p6(f7(f10(X1,X2)),f9(f7(X1),f7(X2)))|~p15(X2)|~p15(X1))). % 1.83/0.61 cnf(i_0_79, negated_conjecture, (p4(f5(f10(X1,X2)),f14(f5(X1),f5(X2)))|~p15(X2)|~p15(X1))). % 1.83/0.61 cnf(i_0_82, negated_conjecture, (p17(X1,X2,f10(X3,X4))|p17(X1,X2,X3)|p12(f13(X1),c20)|~p15(X4)|~p15(X3))). % 1.83/0.61 cnf(i_0_84, negated_conjecture, (p17(X1,X2,X3)|p12(f13(X1),c20)|~p17(X1,X2,f10(X4,X3))|~p17(X1,X2,X4)|~p15(X4)|~p15(X3))). % 1.83/0.61 cnf(i_0_83, negated_conjecture, (p17(X1,X2,f10(X3,X4))|p12(f13(X1),c20)|~p17(X1,X2,X4)|~p15(X4)|~p15(X3))). % 1.83/0.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.83/0.61 # Begin printing tableau % 1.83/0.61 # Found 7 steps % 1.83/0.61 cnf(i_0_76, negated_conjecture, (p2(f10(X12,X11),f10(X12,X11))|~p2(X11,X11)|~p2(X12,X12)), inference(start_rule)). % 1.83/0.61 cnf(i_0_125, plain, (~p2(X11,X11)), inference(closure_rule, [i_0_48])). % 1.83/0.61 cnf(i_0_126, plain, (~p2(X12,X12)), inference(closure_rule, [i_0_48])). % 1.83/0.61 cnf(i_0_124, plain, (p2(f10(X12,X11),f10(X12,X11))), inference(extension_rule, [i_0_61])). % 1.83/0.61 cnf(i_0_17633, plain, (p4(f5(f10(X12,X11)),f5(f10(X12,X11)))), inference(extension_rule, [i_0_77])). % 1.83/0.61 cnf(i_0_17651, plain, (~p4(f5(f3(c18)),f5(c18))), inference(closure_rule, [i_0_52])). % 1.83/0.61 cnf(i_0_17649, plain, (p4(f14(f5(f3(c18)),f5(f10(X12,X11))),f14(f5(c18),f5(f10(X12,X11))))), inference(etableau_closure_rule, [i_0_17649, ...])). % 1.83/0.61 # End printing tableau % 1.83/0.61 # SZS output end % 1.83/0.61 # Branches closed with saturation will be marked with an "s" % 1.83/0.61 # Child (19668) has found a proof. % 1.83/0.61 % 1.83/0.61 # Proof search is over... % 1.83/0.61 # Freeing feature tree %------------------------------------------------------------------------------