%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN625-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 : n019.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.22s 0.47s % Output : CNFRefutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SYN625-1 : TPTP v8.1.0. Released v2.5.0. % 0.13/0.14 % 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 : n019.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 : Tue Jul 12 06:09:38 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: 35 Number of unprocessed: 35 % 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 # 35 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 35 conjectures. % 0.13/0.38 # There are 35 start rule candidates: % 0.13/0.38 # Found 8 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 35 start rule tableaux created. % 0.13/0.38 # 27 extension rule candidate clauses % 0.13/0.38 # 8 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.22/0.47 # There were 1 total branch saturation attempts. % 0.22/0.47 # There were 0 of these attempts blocked. % 0.22/0.47 # There were 0 deferred branch saturation attempts. % 0.22/0.47 # There were 0 free duplicated saturations. % 0.22/0.47 # There were 1 total successful branch saturations. % 0.22/0.47 # There were 0 successful branch saturations in interreduction. % 0.22/0.47 # There were 0 successful branch saturations on the branch. % 0.22/0.47 # There were 1 successful branch saturations after the branch. % 0.22/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.47 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.47 # Begin clausification derivation % 0.22/0.47 % 0.22/0.47 # End clausification derivation % 0.22/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.47 cnf(i_0_36, negated_conjecture, (p15(c21))). % 0.22/0.47 cnf(i_0_37, negated_conjecture, (p10(X1,X1))). % 0.22/0.47 cnf(i_0_38, negated_conjecture, (p8(X1,X1))). % 0.22/0.47 cnf(i_0_39, negated_conjecture, (p6(X1,X1))). % 0.22/0.47 cnf(i_0_40, negated_conjecture, (p5(X1,X1))). % 0.22/0.47 cnf(i_0_41, negated_conjecture, (p3(X1,X1))). % 0.22/0.47 cnf(i_0_42, negated_conjecture, (p2(X1,X1))). % 0.22/0.47 cnf(i_0_43, negated_conjecture, (~p15(f4(f7(c19,c20),c21)))). % 0.22/0.47 cnf(i_0_51, negated_conjecture, (~p17(X1,f11(c20))|~p16(f9(c21),X1,c19))). % 0.22/0.47 cnf(i_0_45, negated_conjecture, (~p18(f9(X1),X2,X2)|~p15(X1))). % 0.22/0.47 cnf(i_0_46, negated_conjecture, (p15(X1)|~p3(X2,X1)|~p15(X2))). % 0.22/0.47 cnf(i_0_47, negated_conjecture, (p10(f11(X1),f11(X2))|~p6(X1,X2))). % 0.22/0.47 cnf(i_0_48, negated_conjecture, (p8(f9(X1),f9(X2))|~p3(X1,X2))). % 0.22/0.47 cnf(i_0_49, negated_conjecture, (p5(f14(X1),f14(X2))|~p3(X1,X2))). % 0.22/0.47 cnf(i_0_44, negated_conjecture, (p16(X1,X2,X3)|~p5(X2,X3))). % 0.22/0.47 cnf(i_0_50, negated_conjecture, (p18(f9(X1),f14(X1),f14(X1))|p15(X1))). % 0.22/0.47 cnf(i_0_52, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.22/0.47 cnf(i_0_53, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.22/0.47 cnf(i_0_54, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.22/0.47 cnf(i_0_55, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.22/0.47 cnf(i_0_56, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.22/0.47 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.22/0.47 cnf(i_0_60, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.22/0.47 cnf(i_0_61, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))). % 0.22/0.47 cnf(i_0_59, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p5(X3,X1)|~p10(X4,X2))). % 0.22/0.47 cnf(i_0_58, negated_conjecture, (p16(X1,X2,X3)|~p16(X1,X4,X3)|~p16(X1,X2,X4))). % 0.22/0.47 cnf(i_0_67, negated_conjecture, (p18(f9(X1),X2,X3)|p16(f9(X1),X2,X4)|~p18(f9(f4(f7(X4,X5),X1)),X2,X3))). % 0.22/0.47 cnf(i_0_64, negated_conjecture, (p16(X1,X2,X3)|~p16(X4,X5,X6)|~p5(X5,X2)|~p5(X6,X3)|~p8(X4,X1))). % 0.22/0.47 cnf(i_0_62, negated_conjecture, (p16(X1,X2,f13(X1,X2,X3))|p5(X2,X3)|~p16(X1,X2,X3))). % 0.22/0.47 cnf(i_0_63, negated_conjecture, (p16(X1,f13(X1,X2,X3),X3)|p5(X2,X3)|~p16(X1,X2,X3))). % 0.22/0.47 cnf(i_0_65, negated_conjecture, (p18(X1,X2,X3)|~p18(X4,X5,X6)|~p5(X5,X2)|~p5(X6,X3)|~p8(X4,X1))). % 0.22/0.47 cnf(i_0_66, negated_conjecture, (p5(f13(X1,X2,X3),f13(X4,X5,X6))|~p5(X3,X6)|~p5(X2,X5)|~p8(X1,X4))). % 0.22/0.47 cnf(i_0_68, negated_conjecture, (p17(f12(X1,X2,X3,X4,X5),f11(X3))|p18(f9(X1),X4,X5)|~p18(f9(f4(f7(X2,X3),X1)),X4,X5))). % 0.22/0.47 cnf(i_0_69, negated_conjecture, (p18(f9(X1),X2,X3)|p16(f9(X1),f12(X1,X4,X5,X2,X3),X3)|~p18(f9(f4(f7(X4,X5),X1)),X2,X3))). % 0.22/0.47 cnf(i_0_70, negated_conjecture, (p5(f12(X1,X2,X3,X4,X5),f12(X6,X7,X8,X9,X10))|~p3(X1,X6)|~p5(X5,X10)|~p5(X4,X9)|~p5(X2,X7)|~p6(X3,X8))). % 0.22/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.47 # Begin printing tableau % 0.22/0.47 # Found 15 steps % 0.22/0.47 cnf(i_0_70, negated_conjecture, (p5(f12(X17,X18,X19,X20,X21),f12(X17,X18,X19,X20,X21))|~p3(X17,X17)|~p5(X21,X21)|~p5(X20,X20)|~p5(X18,X18)|~p6(X19,X19)), inference(start_rule)). % 0.22/0.47 cnf(i_0_72, plain, (~p3(X17,X17)), inference(closure_rule, [i_0_41])). % 0.22/0.47 cnf(i_0_73, plain, (~p5(X21,X21)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_74, plain, (~p5(X20,X20)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_75, plain, (~p5(X18,X18)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_76, plain, (~p6(X19,X19)), inference(closure_rule, [i_0_39])). % 0.22/0.47 cnf(i_0_71, plain, (p5(f12(X17,X18,X19,X20,X21),f12(X17,X18,X19,X20,X21))), inference(extension_rule, [i_0_70])). % 0.22/0.47 cnf(i_0_163, plain, (~p3(X25,X25)), inference(closure_rule, [i_0_41])). % 0.22/0.47 cnf(i_0_165, plain, (~p5(X22,X22)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_166, plain, (~p5(X24,X24)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_167, plain, (~p6(X23,X23)), inference(closure_rule, [i_0_39])). % 0.22/0.47 cnf(i_0_162, plain, (p5(f12(X25,X24,X23,X22,f12(X17,X18,X19,X20,X21)),f12(X25,X24,X23,X22,f12(X17,X18,X19,X20,X21)))), inference(extension_rule, [i_0_66])). % 0.22/0.47 cnf(i_0_176, plain, (~p5(X8,X8)), inference(closure_rule, [i_0_40])). % 0.22/0.47 cnf(i_0_177, plain, (~p8(X7,X7)), inference(closure_rule, [i_0_38])). % 0.22/0.47 cnf(i_0_174, plain, (p5(f13(X7,X8,f12(X25,X24,X23,X22,f12(X17,X18,X19,X20,X21))),f13(X7,X8,f12(X25,X24,X23,X22,f12(X17,X18,X19,X20,X21))))), inference(etableau_closure_rule, [i_0_174, ...])). % 0.22/0.47 # End printing tableau % 0.22/0.47 # SZS output end % 0.22/0.47 # Branches closed with saturation will be marked with an "s" % 0.22/0.47 # Child (16511) has found a proof. % 0.22/0.47 % 0.22/0.47 # Proof search is over... % 0.22/0.47 # Freeing feature tree %------------------------------------------------------------------------------