%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN601-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 : n003.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:44 EDT 2022 % Result : Unsatisfiable 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN601-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/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 : n003.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 22:37:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 30 Number of unprocessed: 30 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # 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 # 30 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 30 conjectures. % 0.20/0.38 # There are 30 start rule candidates: % 0.20/0.38 # Found 12 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 30 start rule tableaux created. % 0.20/0.38 # 18 extension rule candidate clauses % 0.20/0.38 # 12 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_37, negated_conjecture, (p3(c22,c23))). % 0.20/0.38 cnf(i_0_36, negated_conjecture, (p17(c22,c23))). % 0.20/0.38 cnf(i_0_38, negated_conjecture, (p18(c22,f8(c21)))). % 0.20/0.38 cnf(i_0_39, negated_conjecture, (p17(f5(f6(f7(c20))),f4(c21)))). % 0.20/0.38 cnf(i_0_31, negated_conjecture, (p10(X1,X1))). % 0.20/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,X1))). % 0.20/0.38 cnf(i_0_33, negated_conjecture, (p3(X1,X1))). % 0.20/0.38 cnf(i_0_34, negated_conjecture, (p2(X1,X1))). % 0.20/0.38 cnf(i_0_35, negated_conjecture, (p12(X1,X1))). % 0.20/0.38 cnf(i_0_52, negated_conjecture, (p19(c21,f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25)))). % 0.20/0.38 cnf(i_0_53, negated_conjecture, (~p19(c21,f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25)))). % 0.20/0.38 cnf(i_0_59, negated_conjecture, (~p10(f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25),f16(f5(c20))))). % 0.20/0.38 cnf(i_0_47, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.38 cnf(i_0_41, negated_conjecture, (p10(f16(X1),f16(X2))|~p3(X1,X2))). % 0.20/0.38 cnf(i_0_40, negated_conjecture, (p3(f8(X1),f8(X2))|~p2(X1,X2))). % 0.20/0.38 cnf(i_0_46, negated_conjecture, (p3(f7(X1),f7(X2))|~p3(X1,X2))). % 0.20/0.38 cnf(i_0_45, negated_conjecture, (p3(f6(X1),f6(X2))|~p3(X1,X2))). % 0.20/0.38 cnf(i_0_44, negated_conjecture, (p3(f5(X1),f5(X2))|~p3(X1,X2))). % 0.20/0.38 cnf(i_0_48, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.20/0.38 cnf(i_0_49, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.38 cnf(i_0_50, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.38 cnf(i_0_51, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.20/0.38 cnf(i_0_43, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.20/0.38 cnf(i_0_42, negated_conjecture, (p3(f15(X1),f15(X2))|~p2(X1,X2))). % 0.20/0.38 cnf(i_0_58, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p3(X1,X3))). % 0.20/0.38 cnf(i_0_57, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p3(X2,X4)|~p3(X1,X3))). % 0.20/0.38 cnf(i_0_55, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p3(X4,X2)|~p3(X3,X1))). % 0.20/0.38 cnf(i_0_56, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p3(X4,X2)|~p3(X3,X1))). % 0.20/0.38 cnf(i_0_54, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p2(X3,X1)|~p10(X4,X2))). % 0.20/0.38 cnf(i_0_60, negated_conjecture, (p10(f11(X1,X2,X3),f11(X4,X5,X6))|~p2(X1,X4)|~p9(X2,X5)|~p10(X3,X6))). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 10 steps % 0.20/0.38 cnf(i_0_54, negated_conjecture, (p19(c21,f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25))|~p19(c21,f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25))|~p2(c21,c21)|~p10(f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25),f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25))), inference(start_rule)). % 0.20/0.38 cnf(i_0_65, plain, (p19(c21,f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25))), inference(closure_rule, [i_0_53])). % 0.20/0.38 cnf(i_0_66, plain, (~p19(c21,f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25))), inference(closure_rule, [i_0_52])). % 0.20/0.38 cnf(i_0_67, plain, (~p2(c21,c21)), inference(closure_rule, [i_0_34])). % 0.20/0.38 cnf(i_0_68, plain, (~p10(f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25),f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25))), inference(extension_rule, [i_0_60])). % 0.20/0.38 cnf(i_0_126, plain, (~p9(c24,c24)), inference(closure_rule, [i_0_32])). % 0.20/0.38 cnf(i_0_127, plain, (~p10(c25,c25)), inference(closure_rule, [i_0_31])). % 0.20/0.38 cnf(i_0_125, plain, (~p2(f13(f15(c21),f14(f4(c21),c22)),f13(f15(c21),f14(f4(c21),c23)))), inference(extension_rule, [i_0_58])). % 0.20/0.38 cnf(i_0_145, plain, (~p3(f15(c21),f15(c21))), inference(closure_rule, [i_0_33])). % 0.20/0.38 cnf(i_0_144, plain, (~p12(f14(f4(c21),c22),f14(f4(c21),c23))), inference(etableau_closure_rule, [i_0_144, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (4269) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------