%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN616-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 : n016.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:51 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN616-1 : TPTP v8.1.0. Released v2.5.0. % 0.13/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.35 % Computer : n016.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.20/0.35 % WCLimit : 600 % 0.20/0.35 % DateTime : Mon Jul 11 20:00:58 EDT 2022 % 0.20/0.35 % CPUTime : % 0.20/0.41 # No SInE strategy applied % 0.20/0.41 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.41 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.41 # % 0.20/0.41 # Presaturation interreduction done % 0.20/0.41 # Number of axioms: 32 Number of unprocessed: 32 % 0.20/0.41 # Tableaux proof search. % 0.20/0.41 # APR header successfully linked. % 0.20/0.41 # Hello from C++ % 0.20/0.41 # The folding up rule is enabled... % 0.20/0.41 # Local unification is enabled... % 0.20/0.41 # Any saturation attempts will use folding labels... % 0.20/0.41 # 32 beginning clauses after preprocessing and clausification % 0.20/0.41 # Creating start rules for all 32 conjectures. % 0.20/0.41 # There are 32 start rule candidates: % 0.20/0.41 # Found 13 unit axioms. % 0.20/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.41 # 32 start rule tableaux created. % 0.20/0.41 # 19 extension rule candidate clauses % 0.20/0.41 # 13 unit axiom clauses % 0.20/0.41 % 0.20/0.41 # Requested 8, 32 cores available to the main process. % 0.20/0.41 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.20/0.41 # There were 0 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 0 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 0 successful branch saturations after the branch. % 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_33, negated_conjecture, (p17(c28))). % 0.20/0.41 cnf(i_0_39, negated_conjecture, (p2(c25,c28))). % 0.20/0.41 cnf(i_0_38, negated_conjecture, (p19(c26,c27))). % 0.20/0.41 cnf(i_0_41, negated_conjecture, (p13(f3(f4(f5(c20))),c21))). % 0.20/0.41 cnf(i_0_34, negated_conjecture, (p10(X1,X1))). % 0.20/0.41 cnf(i_0_35, negated_conjecture, (p9(X1,X1))). % 0.20/0.41 cnf(i_0_36, negated_conjecture, (p2(X1,X1))). % 0.20/0.41 cnf(i_0_37, negated_conjecture, (p18(X1,X1))). % 0.20/0.41 cnf(i_0_51, negated_conjecture, (p2(f11(c23,c24,f3(f5(c20))),f8(c21,f3(f5(c20)))))). % 0.20/0.41 cnf(i_0_57, negated_conjecture, (p14(f7(c22,f8(c21,f3(f5(c20)))),f3(f5(c20)),f6(c21)))). % 0.20/0.41 cnf(i_0_61, negated_conjecture, (p14(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f3(f5(c20)),f6(c21)))). % 0.20/0.41 cnf(i_0_40, negated_conjecture, (~p15(c25,c27))). % 0.20/0.41 cnf(i_0_62, negated_conjecture, (~p14(f7(c22,f12(f8(c21,f3(f5(c20))),c28)),f3(f5(c20)),f6(c21)))). % 0.20/0.41 cnf(i_0_42, negated_conjecture, (p17(X1)|~p2(X2,X1)|~p17(X2))). % 0.20/0.41 cnf(i_0_47, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.41 cnf(i_0_46, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_45, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_44, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_48, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.20/0.41 cnf(i_0_49, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.41 cnf(i_0_50, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.20/0.41 cnf(i_0_43, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_52, negated_conjecture, (p15(X1,c24)|~p16(X1,f8(c21,f3(f5(c20))))|~p17(X1))). % 0.20/0.41 cnf(i_0_58, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.41 cnf(i_0_60, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.41 cnf(i_0_59, negated_conjecture, (p2(f12(X1,X2),f12(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.41 cnf(i_0_54, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p18(X3,X1)|~p10(X4,X2))). % 0.20/0.41 cnf(i_0_56, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X3,X1)|~p10(X4,X2))). % 0.20/0.41 cnf(i_0_53, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.41 cnf(i_0_55, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.41 cnf(i_0_63, negated_conjecture, (p14(X1,X2,X3)|~p14(X4,X5,X6)|~p2(X4,X1)|~p2(X5,X2)|~p2(X6,X3))). % 0.20/0.41 cnf(i_0_64, negated_conjecture, (p2(f11(X1,X2,X3),f11(X4,X5,X6))|~p2(X3,X6)|~p9(X1,X4)|~p10(X2,X5))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 10 steps % 0.20/0.41 cnf(i_0_63, negated_conjecture, (p14(f7(c22,f12(f8(c21,f3(f5(c20))),c28)),f3(f5(c20)),f6(c21))|~p14(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f3(f5(c20)),f6(c21))|~p2(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f7(c22,f12(f8(c21,f3(f5(c20))),c28)))|~p2(f3(f5(c20)),f3(f5(c20)))|~p2(f6(c21),f6(c21))), inference(start_rule)). % 0.20/0.41 cnf(i_0_69, plain, (p14(f7(c22,f12(f8(c21,f3(f5(c20))),c28)),f3(f5(c20)),f6(c21))), inference(closure_rule, [i_0_62])). % 0.20/0.41 cnf(i_0_70, plain, (~p14(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f3(f5(c20)),f6(c21))), inference(closure_rule, [i_0_61])). % 0.20/0.41 cnf(i_0_72, plain, (~p2(f3(f5(c20)),f3(f5(c20)))), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_73, plain, (~p2(f6(c21),f6(c21))), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_71, plain, (~p2(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f7(c22,f12(f8(c21,f3(f5(c20))),c28)))), inference(extension_rule, [i_0_60])). % 0.20/0.41 cnf(i_0_168, plain, (~p2(c22,c22)), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_167, plain, (~p2(f12(f8(c21,f3(f5(c20))),c25),f12(f8(c21,f3(f5(c20))),c28))), inference(extension_rule, [i_0_59])). % 0.20/0.41 cnf(i_0_195, plain, (~p2(c25,c28)), inference(closure_rule, [i_0_39])). % 0.20/0.41 cnf(i_0_196, plain, (~p2(f8(c21,f3(f5(c20))),f8(c21,f3(f5(c20))))), inference(closure_rule, [i_0_36])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Child (7392) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------