%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN617-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 : n018.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 47.55s 6.36s % Output : CNFRefutation 47.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYN617-1 : TPTP v8.1.0. Released v2.5.0. % 0.11/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 : n018.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 : Tue Jul 12 01:51:59 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 32 Number of unprocessed: 32 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 32 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 32 conjectures. % 0.12/0.36 # There are 32 start rule candidates: % 0.12/0.36 # Found 13 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 32 start rule tableaux created. % 0.12/0.36 # 19 extension rule candidate clauses % 0.12/0.36 # 13 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 47.55/6.36 # There were 7 total branch saturation attempts. % 47.55/6.36 # There were 0 of these attempts blocked. % 47.55/6.36 # There were 0 deferred branch saturation attempts. % 47.55/6.36 # There were 0 free duplicated saturations. % 47.55/6.36 # There were 1 total successful branch saturations. % 47.55/6.36 # There were 0 successful branch saturations in interreduction. % 47.55/6.36 # There were 0 successful branch saturations on the branch. % 47.55/6.36 # There were 1 successful branch saturations after the branch. % 47.55/6.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 47.55/6.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 47.55/6.36 # Begin clausification derivation % 47.55/6.36 % 47.55/6.36 # End clausification derivation % 47.55/6.36 # Begin listing active clauses obtained from FOF to CNF conversion % 47.55/6.36 cnf(i_0_38, negated_conjecture, (p19(c21,c22))). % 47.55/6.36 cnf(i_0_33, negated_conjecture, (p11(X1,X1))). % 47.55/6.36 cnf(i_0_34, negated_conjecture, (p9(X1,X1))). % 47.55/6.36 cnf(i_0_35, negated_conjecture, (p7(X1,X1))). % 47.55/6.36 cnf(i_0_36, negated_conjecture, (p2(X1,X1))). % 47.55/6.36 cnf(i_0_37, negated_conjecture, (p13(X1,X1))). % 47.55/6.36 cnf(i_0_41, negated_conjecture, (p9(f18(f5(c20),X1),f17(X1)))). % 47.55/6.36 cnf(i_0_42, negated_conjecture, (p13(f15(f5(c20),X1),f16(X1)))). % 47.55/6.36 cnf(i_0_39, negated_conjecture, (p11(f12(f14(X1,X2)),X2))). % 47.55/6.36 cnf(i_0_40, negated_conjecture, (p7(f8(f10(X1,X2)),X2))). % 47.55/6.36 cnf(i_0_50, negated_conjecture, (p9(f18(f3(X1),X2),f18(X1,f8(X2))))). % 47.55/6.36 cnf(i_0_51, negated_conjecture, (p13(f15(f3(X1),X2),f15(X1,f12(X2))))). % 47.55/6.36 cnf(i_0_64, negated_conjecture, (~p13(f15(f4(f4(f3(c22),f5(f6(c20))),c21),f14(c23,c24)),f15(f4(f4(c22,f5(f6(c20))),c21),c24)))). % 47.55/6.36 cnf(i_0_52, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 47.55/6.36 cnf(i_0_53, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 47.55/6.36 cnf(i_0_54, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 47.55/6.36 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 47.55/6.36 cnf(i_0_43, negated_conjecture, (p11(f12(X1),f12(X2))|~p11(X1,X2))). % 47.55/6.36 cnf(i_0_44, negated_conjecture, (p9(f17(X1),f17(X2))|~p7(X1,X2))). % 47.55/6.36 cnf(i_0_45, negated_conjecture, (p7(f8(X1),f8(X2))|~p7(X1,X2))). % 47.55/6.36 cnf(i_0_47, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 47.55/6.36 cnf(i_0_56, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))). % 47.55/6.36 cnf(i_0_46, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))). % 47.55/6.36 cnf(i_0_48, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 47.55/6.36 cnf(i_0_49, negated_conjecture, (p13(f16(X1),f16(X2))|~p11(X1,X2))). % 47.55/6.36 cnf(i_0_59, negated_conjecture, (p11(f14(X1,X2),f14(X3,X4))|~p13(X1,X3)|~p11(X2,X4))). % 47.55/6.36 cnf(i_0_58, negated_conjecture, (p9(f18(X1,X2),f18(X3,X4))|~p2(X1,X3)|~p7(X2,X4))). % 47.55/6.36 cnf(i_0_57, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 47.55/6.36 cnf(i_0_62, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X2,X4)|~p9(X1,X3))). % 47.55/6.36 cnf(i_0_61, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 47.55/6.36 cnf(i_0_60, negated_conjecture, (p13(f15(X1,X2),f15(X3,X4))|~p2(X1,X3)|~p11(X2,X4))). % 47.55/6.36 cnf(i_0_63, negated_conjecture, (p2(f4(f4(f3(X1),f5(f6(c20))),X2),f3(f4(f4(X1,f5(f6(c20))),X2)))|~p19(X2,X1))). % 47.55/6.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 47.55/6.36 # Begin printing tableau % 47.55/6.36 # Found 8 steps % 47.55/6.36 cnf(i_0_61, negated_conjecture, (p2(f4(f4(c22,f5(f6(c20))),c21),f4(f4(c22,f5(f6(c20))),c21))|~p2(c21,c21)|~p2(f4(c22,f5(f6(c20))),f4(c22,f5(f6(c20))))), inference(start_rule)). % 47.55/6.36 cnf(i_0_71, plain, (~p2(c21,c21)), inference(closure_rule, [i_0_36])). % 47.55/6.36 cnf(i_0_72, plain, (~p2(f4(c22,f5(f6(c20))),f4(c22,f5(f6(c20))))), inference(closure_rule, [i_0_36])). % 47.55/6.36 cnf(i_0_70, plain, (p2(f4(f4(c22,f5(f6(c20))),c21),f4(f4(c22,f5(f6(c20))),c21))), inference(extension_rule, [i_0_60])). % 47.55/6.36 cnf(i_0_132, plain, (~p11(f12(f14(X1,c24)),c24)), inference(closure_rule, [i_0_39])). % 47.55/6.36 cnf(i_0_130, plain, (p13(f15(f4(f4(c22,f5(f6(c20))),c21),f12(f14(X1,c24))),f15(f4(f4(c22,f5(f6(c20))),c21),c24))), inference(extension_rule, [i_0_56])). % 47.55/6.36 cnf(i_0_444909, plain, (p13(f15(f4(f4(f3(c22),f5(f6(c20))),c21),f14(c23,c24)),f15(f4(f4(c22,f5(f6(c20))),c21),c24))), inference(closure_rule, [i_0_64])). % 47.55/6.36 cnf(i_0_444911, plain, (~p13(f15(f4(f4(c22,f5(f6(c20))),c21),f12(f14(X1,c24))),f15(f4(f4(f3(c22),f5(f6(c20))),c21),f14(c23,c24)))), inference(etableau_closure_rule, [i_0_444911, ...])). % 47.55/6.36 # End printing tableau % 47.55/6.36 # SZS output end % 47.55/6.36 # Branches closed with saturation will be marked with an "s" % 47.55/6.36 # Child (15707) has found a proof. % 47.55/6.36 % 47.55/6.36 # Proof search is over... % 47.55/6.36 # Freeing feature tree %------------------------------------------------------------------------------