%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN651-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 : n021.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:05 EDT 2022 % Result : Unsatisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYN651-1 : TPTP v8.1.0. Released v2.5.0. % 0.04/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 : n021.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 : Tue Jul 12 00:52:54 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 45 Number of unprocessed: 45 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 45 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 45 conjectures. % 0.20/0.38 # There are 45 start rule candidates: % 0.20/0.38 # Found 15 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 45 start rule tableaux created. % 0.20/0.38 # 30 extension rule candidate clauses % 0.20/0.38 # 15 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_46, negated_conjecture, (p11(X1,X1))). % 0.20/0.39 cnf(i_0_58, negated_conjecture, (p23(f5(c27,c28),c30))). % 0.20/0.39 cnf(i_0_71, negated_conjecture, (p23(f5(f7(f10(c24,f12(c25,c26)),c27),c30),c29))). % 0.20/0.39 cnf(i_0_47, negated_conjecture, (p9(X1,X1))). % 0.20/0.39 cnf(i_0_48, negated_conjecture, (p8(X1,X1))). % 0.20/0.39 cnf(i_0_49, negated_conjecture, (p6(X1,X1))). % 0.20/0.39 cnf(i_0_50, negated_conjecture, (p4(X1,X1))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (p3(X1,X1))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (p21(X1,X1))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (p2(X1,X1))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (p19(X1,X1))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p17(X1,X1))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (p15(X1,X1))). % 0.20/0.39 cnf(i_0_57, negated_conjecture, (p13(X1,X1))). % 0.20/0.39 cnf(i_0_73, negated_conjecture, (~p23(f5(f7(f10(c24,f12(c25,f12(c25,c26))),c27),c28),c29))). % 0.20/0.39 cnf(i_0_83, negated_conjecture, (p3(X1,X2)|~p23(f5(f7(f10(c24,f12(c32,c33)),X3),X1),X2))). % 0.20/0.39 cnf(i_0_59, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.20/0.39 cnf(i_0_61, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_62, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_64, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))). % 0.20/0.39 cnf(i_0_84, negated_conjecture, (p23(f5(f7(f10(c24,f12(c32,c33)),X1),X2),X3)|~p3(X2,X3))). % 0.20/0.39 cnf(i_0_85, negated_conjecture, (p23(f5(c27,X1),f14(f22(c34,X2),X1))|~p23(f5(f7(f10(c24,f12(c25,c26)),c27),X1),X2))). % 0.20/0.39 cnf(i_0_66, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_67, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))). % 0.20/0.39 cnf(i_0_68, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))). % 0.20/0.39 cnf(i_0_69, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))). % 0.20/0.39 cnf(i_0_70, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))). % 0.20/0.39 cnf(i_0_72, negated_conjecture, (p23(X1,X2)|~p23(X3,X4)|~p3(X4,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_75, negated_conjecture, (p9(f12(X1,X2),f12(X3,X4))|~p9(X2,X4)|~p11(X1,X3))). % 0.20/0.39 cnf(i_0_76, negated_conjecture, (p6(f10(X1,X2),f10(X3,X4))|~p8(X1,X3)|~p9(X2,X4))). % 0.20/0.39 cnf(i_0_77, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.20/0.39 cnf(i_0_87, negated_conjecture, (p23(f5(f7(f10(c24,c26),c27),f14(f22(c34,X1),X2)),X1)|~p23(f5(f7(f10(c24,f12(c25,c26)),c27),X2),X1))). % 0.20/0.39 cnf(i_0_78, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p13(X1,X3)|~p3(X2,X4))). % 0.20/0.39 cnf(i_0_79, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p6(X1,X3))). % 0.20/0.39 cnf(i_0_80, negated_conjecture, (p17(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p9(X2,X4))). % 0.20/0.39 cnf(i_0_81, negated_conjecture, (p15(f18(X1,X2),f18(X3,X4))|~p17(X1,X3)|~p3(X2,X4))). % 0.20/0.39 cnf(i_0_74, negated_conjecture, (p13(f16(X1,X2),f16(X3,X4))|~p15(X1,X3)|~p2(X2,X4))). % 0.20/0.39 cnf(i_0_82, negated_conjecture, (p13(f22(X1,X2),f22(X3,X4))|~p21(X1,X3)|~p3(X2,X4))). % 0.20/0.39 cnf(i_0_86, negated_conjecture, (p23(f5(X1,f14(f16(f18(f20(c31,X2),X3),X1),X4)),X4)|~p23(f5(f7(f10(c24,f12(c25,X2)),X1),X3),X4))). % 0.20/0.39 cnf(i_0_88, negated_conjecture, (p23(f5(f7(f10(c24,f12(c25,X1)),X2),X3),X4)|~p23(f5(f7(f10(c24,X1),X2),X3),X5)|~p23(f5(X2,X5),X4))). % 0.20/0.39 cnf(i_0_89, negated_conjecture, (p23(f5(f7(f10(c24,f12(c25,c26)),c27),X1),X2)|~p23(f5(f7(f10(c24,c26),c27),X3),X2)|~p23(f5(c27,X1),X3))). % 0.20/0.39 cnf(i_0_90, negated_conjecture, (p23(f5(f7(f10(c24,X1),X2),X3),f14(f16(f18(f20(c31,X1),X3),X2),X4))|~p23(f5(f7(f10(c24,f12(c25,X1)),X2),X3),X4))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_90, negated_conjecture, (p23(f5(f7(f10(c24,c26),c27),c30),f14(f16(f18(f20(c31,c26),c30),c27),c29))|~p23(f5(f7(f10(c24,f12(c25,c26)),c27),c30),c29)), inference(start_rule)). % 0.20/0.39 cnf(i_0_92, plain, (~p23(f5(f7(f10(c24,f12(c25,c26)),c27),c30),c29)), inference(closure_rule, [i_0_71])). % 0.20/0.39 cnf(i_0_91, plain, (p23(f5(f7(f10(c24,c26),c27),c30),f14(f16(f18(f20(c31,c26),c30),c27),c29))), inference(extension_rule, [i_0_89])). % 0.20/0.39 cnf(i_0_195, plain, (~p23(f5(c27,c28),c30)), inference(closure_rule, [i_0_58])). % 0.20/0.39 cnf(i_0_193, plain, (p23(f5(f7(f10(c24,f12(c25,c26)),c27),c28),f14(f16(f18(f20(c31,c26),c30),c27),c29))), inference(extension_rule, [i_0_90])). % 0.20/0.39 cnf(i_0_196, plain, (p23(f5(f7(f10(c24,c26),c27),c28),f14(f16(f18(f20(c31,c26),c28),c27),f14(f16(f18(f20(c31,c26),c30),c27),c29)))), inference(etableau_closure_rule, [i_0_196, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (15220) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------