%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN631-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 : n029.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:57 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.03/0.12 % Problem : SYN631-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 17:06:17 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.20/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 38 Number of unprocessed: 38 % 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.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 38 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 38 conjectures. % 0.20/0.37 # There are 38 start rule candidates: % 0.20/0.37 # Found 13 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 38 start rule tableaux created. % 0.20/0.37 # 25 extension rule candidate clauses % 0.20/0.37 # 13 unit axiom clauses % 0.20/0.37 % 0.20/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_47, negated_conjecture, (p22(c25,c28))). % 0.20/0.49 cnf(i_0_39, negated_conjecture, (p10(X1,X1))). % 0.20/0.49 cnf(i_0_40, negated_conjecture, (p9(X1,X1))). % 0.20/0.49 cnf(i_0_41, negated_conjecture, (p7(X1,X1))). % 0.20/0.49 cnf(i_0_42, negated_conjecture, (p6(X1,X1))). % 0.20/0.49 cnf(i_0_43, negated_conjecture, (p5(X1,X1))). % 0.20/0.49 cnf(i_0_44, negated_conjecture, (p3(X1,X1))). % 0.20/0.49 cnf(i_0_45, negated_conjecture, (p2(X1,X1))). % 0.20/0.49 cnf(i_0_46, negated_conjecture, (p12(X1,X1))). % 0.20/0.49 cnf(i_0_53, negated_conjecture, (p10(f11(X1),f11(X2))|~p9(X1,X2))). % 0.20/0.49 cnf(i_0_52, negated_conjecture, (p9(f15(X1),f15(X2))|~p9(X1,X2))). % 0.20/0.49 cnf(i_0_57, negated_conjecture, (p5(f17(X1),f17(X2))|~p5(X1,X2))). % 0.20/0.49 cnf(i_0_56, negated_conjecture, (p5(f16(X1),f16(X2))|~p5(X1,X2))). % 0.20/0.49 cnf(i_0_55, negated_conjecture, (p5(f14(X1),f14(X2))|~p6(X1,X2))). % 0.20/0.49 cnf(i_0_58, negated_conjecture, (p5(f20(X1),f20(X2))|~p5(X1,X2))). % 0.20/0.49 cnf(i_0_54, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_50, negated_conjecture, (p23(f13(c27,f14(c28)),f11(f15(c24))))). % 0.20/0.49 cnf(i_0_59, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.49 cnf(i_0_60, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.20/0.49 cnf(i_0_61, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.20/0.49 cnf(i_0_62, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.20/0.49 cnf(i_0_63, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.49 cnf(i_0_64, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.49 cnf(i_0_65, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.49 cnf(i_0_66, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.20/0.49 cnf(i_0_48, negated_conjecture, (p5(f17(f18(X1,X2)),X1))). % 0.20/0.49 cnf(i_0_49, negated_conjecture, (p5(f16(f18(X1,X2)),X2))). % 0.20/0.49 cnf(i_0_69, negated_conjecture, (p22(X1,X2)|~p6(X4,X2)|~p3(X3,X1)|~p22(X3,X4))). % 0.20/0.49 cnf(i_0_67, negated_conjecture, (p23(X1,X2)|~p10(X4,X2)|~p12(X3,X1)|~p23(X3,X4))). % 0.20/0.49 cnf(i_0_68, negated_conjecture, (p21(X1,X2)|~p7(X4,X1)|~p3(X3,X2)|~p21(X4,X3))). % 0.20/0.49 cnf(i_0_51, negated_conjecture, (~p23(f13(f16(c27),f14(c28)),f11(c24)))). % 0.20/0.49 cnf(i_0_71, negated_conjecture, (p5(f18(X1,X2),f18(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.20/0.49 cnf(i_0_70, negated_conjecture, (p12(f13(X1,X2),f13(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.20/0.49 cnf(i_0_74, negated_conjecture, (p21(f8(c26,X1,X2),f4(c26))|~p22(c25,X2)|~p23(f13(X1,f14(X2)),f11(c24)))). % 0.20/0.49 cnf(i_0_75, negated_conjecture, (p7(f8(X1,X2,X3),f8(X4,X5,X6))|~p6(X3,X6)|~p5(X2,X5)|~p2(X1,X4))). % 0.20/0.49 cnf(i_0_76, negated_conjecture, (p5(f19(X1,X2,X3),f19(X4,X5,X6))|~p9(X1,X4)|~p5(X3,X6)|~p5(X2,X5))). % 0.20/0.49 cnf(i_0_73, negated_conjecture, (p23(f13(f19(X1,X2,X3),X3),f11(X1))|~p23(f13(X2,X3),f11(f15(X1))))). % 0.20/0.49 cnf(i_0_72, negated_conjecture, (p5(X1,f18(f20(c29),f19(X2,X1,X3)))|~p23(f13(X1,X3),f11(f15(X2))))). % 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_70, negated_conjecture, (p12(f13(f16(f18(X10,f16(c27))),f16(f18(X9,f14(c28)))),f13(f16(c27),f14(c28)))|~p5(f16(f18(X9,f14(c28))),f14(c28))|~p5(f16(f18(X10,f16(c27))),f16(c27))), inference(start_rule)). % 0.20/0.49 cnf(i_0_93, plain, (~p5(f16(f18(X9,f14(c28))),f14(c28))), inference(closure_rule, [i_0_49])). % 0.20/0.49 cnf(i_0_94, plain, (~p5(f16(f18(X10,f16(c27))),f16(c27))), inference(closure_rule, [i_0_49])). % 0.20/0.49 cnf(i_0_92, plain, (p12(f13(f16(f18(X10,f16(c27))),f16(f18(X9,f14(c28)))),f13(f16(c27),f14(c28)))), inference(extension_rule, [i_0_67])). % 0.20/0.49 cnf(i_0_186, plain, (p23(f13(f16(c27),f14(c28)),f11(c24))), inference(closure_rule, [i_0_51])). % 0.20/0.49 cnf(i_0_187, plain, (~p10(f11(c24),f11(c24))), inference(closure_rule, [i_0_39])). % 0.20/0.49 cnf(i_0_189, plain, (~p23(f13(f16(f18(X10,f16(c27))),f16(f18(X9,f14(c28)))),f11(c24))), inference(extension_rule, [i_0_67])). % 0.20/0.49 cnf(i_0_258, plain, (~p10(f11(c24),f11(c24))), inference(closure_rule, [i_0_39])). % 0.20/0.49 cnf(i_0_260, plain, (~p23(f13(f19(c24,c27,f14(c28)),f14(c28)),f11(c24))), inference(extension_rule, [i_0_73])). % 0.20/0.49 cnf(i_0_264, plain, (~p23(f13(c27,f14(c28)),f11(f15(c24)))), inference(closure_rule, [i_0_50])). % 0.20/0.49 cnf(i_0_259, plain, (~p12(f13(f19(c24,c27,f14(c28)),f14(c28)),f13(f16(f18(X10,f16(c27))),f16(f18(X9,f14(c28)))))), inference(etableau_closure_rule, [i_0_259, ...])). % 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 (11397) has found a proof. % 0.20/0.49 % 0.20/0.49 # Proof search is over... % 0.20/0.49 # Freeing feature tree %------------------------------------------------------------------------------